YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:15:54,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:15:54,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:15:54,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:15:54,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:15:54,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:15:54,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:15:54,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:15:54,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:15:54,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:15:54,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:15:54,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:15:54,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:15:54,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:15:54,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:15:54,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:15:54,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:15:54,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:15:54,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:15:54,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:15:54,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:15:54,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:15:54,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:15:54,381 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:15:54,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:15:54,381 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:15:54,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:15:54,383 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:15:54,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:15:54,384 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:15:54,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:15:54,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:15:54,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:15:54,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:15:54,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:15:54,387 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:15:54,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:15:54,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:15:54,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:15:54,389 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:15:54,403 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:15:54,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:15:54,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:15:54,404 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:15:54,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:15:54,405 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:15:54,405 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:15:54,405 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:15:54,405 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:15:54,405 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:15:54,406 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:15:54,406 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:15:54,406 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:15:54,406 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:15:54,406 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:15:54,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:15:54,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:15:54,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:15:54,407 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:15:54,407 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:15:54,407 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:15:54,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:15:54,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:15:54,408 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:15:54,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:15:54,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:15:54,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:15:54,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:15:54,408 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:15:54,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:15:54,446 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:15:54,450 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:15:54,451 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:15:54,451 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:15:54,452 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:15:54,520 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/9801d42686e8440a985c83a3b3e5d0dd/FLAG8252441f3 [2020-06-22 09:15:54,868 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:15:54,869 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:15:54,869 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:15:54,876 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/9801d42686e8440a985c83a3b3e5d0dd/FLAG8252441f3 [2020-06-22 09:15:55,276 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/9801d42686e8440a985c83a3b3e5d0dd [2020-06-22 09:15:55,288 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:15:55,289 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:15:55,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:15:55,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:15:55,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:15:55,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9879c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55, skipping insertion in model container [2020-06-22 09:15:55,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:15:55,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:15:55,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:15:55,563 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:15:55,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:15:55,599 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:15:55,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55 WrapperNode [2020-06-22 09:15:55,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:15:55,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:15:55,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:15:55,601 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:15:55,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:15:55,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:15:55,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:15:55,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:15:55,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... [2020-06-22 09:15:55,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:15:55,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:15:55,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:15:55,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:15:55,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:15:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:15:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:15:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:15:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:15:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:15:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:15:56,001 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:15:56,002 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:15:56,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:15:56 BoogieIcfgContainer [2020-06-22 09:15:56,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:15:56,004 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:15:56,004 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:15:56,006 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:15:56,007 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:15:56" (1/1) ... [2020-06-22 09:15:56,026 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 47 edges [2020-06-22 09:15:56,030 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:15:56,030 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:15:56,031 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:15:56,031 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:15:56,033 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:15:56,034 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:15:56,034 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:15:56,061 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:15:56,093 INFO L200 BlockEncoder]: SBE split 21 edges [2020-06-22 09:15:56,098 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:15:56,099 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:15:56,122 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 09:15:56,125 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states [2020-06-22 09:15:56,127 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:15:56,127 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:15:56,127 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:15:56,128 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:15:56,128 INFO L313 BlockEncoder]: Encoded RCFG 32 locations, 61 edges [2020-06-22 09:15:56,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:15:56 BasicIcfg [2020-06-22 09:15:56,129 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:15:56,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:15:56,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:15:56,134 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:15:56,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:15:55" (1/4) ... [2020-06-22 09:15:56,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47388f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:15:56, skipping insertion in model container [2020-06-22 09:15:56,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (2/4) ... [2020-06-22 09:15:56,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47388f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:15:56, skipping insertion in model container [2020-06-22 09:15:56,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:15:56" (3/4) ... [2020-06-22 09:15:56,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47388f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:15:56, skipping insertion in model container [2020-06-22 09:15:56,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:15:56" (4/4) ... [2020-06-22 09:15:56,139 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:15:56,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:15:56,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-06-22 09:15:56,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-06-22 09:15:56,202 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:15:56,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:15:56,203 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:15:56,203 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:15:56,203 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:15:56,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:15:56,204 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:15:56,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:15:56,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:15:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-06-22 09:15:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:15:56,225 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:56,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:15:56,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash 222869673, now seen corresponding path program 1 times [2020-06-22 09:15:56,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:56,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:56,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:56,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:56,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:15:56,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:15:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:15:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:56,435 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-06-22 09:15:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:56,583 INFO L93 Difference]: Finished difference Result 32 states and 61 transitions. [2020-06-22 09:15:56,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:15:56,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:15:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:56,598 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:15:56,599 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:15:56,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:15:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:15:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:15:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 59 transitions. [2020-06-22 09:15:56,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 59 transitions. Word has length 5 [2020-06-22 09:15:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:56,642 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 59 transitions. [2020-06-22 09:15:56,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:15:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 59 transitions. [2020-06-22 09:15:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:15:56,643 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:56,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:15:56,643 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:56,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash 222869675, now seen corresponding path program 1 times [2020-06-22 09:15:56,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:56,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:56,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:56,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:15:56,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:56,686 INFO L87 Difference]: Start difference. First operand 31 states and 59 transitions. Second operand 4 states. [2020-06-22 09:15:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:56,773 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2020-06-22 09:15:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:56,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:15:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:56,775 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:15:56,775 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:15:56,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:15:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:15:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:15:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2020-06-22 09:15:56,781 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 58 transitions. Word has length 5 [2020-06-22 09:15:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:56,782 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 58 transitions. [2020-06-22 09:15:56,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 58 transitions. [2020-06-22 09:15:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:15:56,782 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:56,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:15:56,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash 222869676, now seen corresponding path program 1 times [2020-06-22 09:15:56,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:56,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:56,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:15:56,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:15:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:15:56,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:56,819 INFO L87 Difference]: Start difference. First operand 31 states and 58 transitions. Second operand 3 states. [2020-06-22 09:15:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:56,935 INFO L93 Difference]: Finished difference Result 31 states and 58 transitions. [2020-06-22 09:15:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:15:56,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:15:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:56,937 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:15:56,937 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:15:56,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:15:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 09:15:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:15:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-06-22 09:15:56,942 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 5 [2020-06-22 09:15:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:56,943 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-06-22 09:15:56,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:15:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-06-22 09:15:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:15:56,943 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:56,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:15:56,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1680976855, now seen corresponding path program 1 times [2020-06-22 09:15:56,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:56,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:56,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:56,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:56,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:15:56,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:15:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:15:56,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:56,973 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 3 states. [2020-06-22 09:15:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:57,038 INFO L93 Difference]: Finished difference Result 30 states and 57 transitions. [2020-06-22 09:15:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:15:57,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:15:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:57,039 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:15:57,039 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:15:57,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:15:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 09:15:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:15:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2020-06-22 09:15:57,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 6 [2020-06-22 09:15:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:57,044 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2020-06-22 09:15:57,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:15:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2020-06-22 09:15:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:15:57,045 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:57,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:15:57,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1680976853, now seen corresponding path program 1 times [2020-06-22 09:15:57,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:57,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:57,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:57,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:15:57,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:15:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:15:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:57,086 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand 3 states. [2020-06-22 09:15:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:57,185 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2020-06-22 09:15:57,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:15:57,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:15:57,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:57,186 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:15:57,186 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:15:57,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:15:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 09:15:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:15:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2020-06-22 09:15:57,191 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 6 [2020-06-22 09:15:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:57,191 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. [2020-06-22 09:15:57,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:15:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. [2020-06-22 09:15:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:15:57,192 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:57,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:15:57,192 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1680976852, now seen corresponding path program 1 times [2020-06-22 09:15:57,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:57,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:57,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:57,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:15:57,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:57,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:57,227 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand 4 states. [2020-06-22 09:15:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:57,309 INFO L93 Difference]: Finished difference Result 29 states and 54 transitions. [2020-06-22 09:15:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:57,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 09:15:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:57,311 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:15:57,311 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:15:57,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:15:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 09:15:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:15:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. [2020-06-22 09:15:57,315 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 6 [2020-06-22 09:15:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:57,316 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 53 transitions. [2020-06-22 09:15:57,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. [2020-06-22 09:15:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 09:15:57,317 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:57,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:57,317 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1338449498, now seen corresponding path program 1 times [2020-06-22 09:15:57,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:57,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:57,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:57,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:15:57,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:57,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:57,361 INFO L87 Difference]: Start difference. First operand 28 states and 53 transitions. Second operand 4 states. [2020-06-22 09:15:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:57,453 INFO L93 Difference]: Finished difference Result 52 states and 95 transitions. [2020-06-22 09:15:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:57,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-06-22 09:15:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:57,455 INFO L225 Difference]: With dead ends: 52 [2020-06-22 09:15:57,455 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:15:57,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:15:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-06-22 09:15:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:15:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-06-22 09:15:57,460 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 9 [2020-06-22 09:15:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:57,460 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-06-22 09:15:57,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-06-22 09:15:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:15:57,461 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:57,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:57,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1455669111, now seen corresponding path program 1 times [2020-06-22 09:15:57,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:57,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:57,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:15:57,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:15:57,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:15:57,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:57,507 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 5 states. [2020-06-22 09:15:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:57,667 INFO L93 Difference]: Finished difference Result 76 states and 138 transitions. [2020-06-22 09:15:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:15:57,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 09:15:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:57,685 INFO L225 Difference]: With dead ends: 76 [2020-06-22 09:15:57,685 INFO L226 Difference]: Without dead ends: 55 [2020-06-22 09:15:57,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:15:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-06-22 09:15:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2020-06-22 09:15:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 09:15:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 74 transitions. [2020-06-22 09:15:57,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 74 transitions. Word has length 10 [2020-06-22 09:15:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:57,692 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 74 transitions. [2020-06-22 09:15:57,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:15:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 74 transitions. [2020-06-22 09:15:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:15:57,692 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:57,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:57,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1455669080, now seen corresponding path program 1 times [2020-06-22 09:15:57,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:57,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:57,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:15:57,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:57,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:57,729 INFO L87 Difference]: Start difference. First operand 37 states and 74 transitions. Second operand 4 states. [2020-06-22 09:15:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:57,817 INFO L93 Difference]: Finished difference Result 64 states and 122 transitions. [2020-06-22 09:15:57,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:57,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 09:15:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:57,819 INFO L225 Difference]: With dead ends: 64 [2020-06-22 09:15:57,819 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 09:15:57,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 09:15:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-06-22 09:15:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 09:15:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2020-06-22 09:15:57,826 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 63 transitions. Word has length 10 [2020-06-22 09:15:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:57,827 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 63 transitions. [2020-06-22 09:15:57,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2020-06-22 09:15:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:15:57,827 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:57,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:57,828 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:57,828 INFO L82 PathProgramCache]: Analyzing trace with hash 659492473, now seen corresponding path program 1 times [2020-06-22 09:15:57,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:57,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:57,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:57,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:57,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:15:57,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:15:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:15:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:15:57,907 INFO L87 Difference]: Start difference. First operand 36 states and 63 transitions. Second operand 6 states. [2020-06-22 09:15:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:58,104 INFO L93 Difference]: Finished difference Result 51 states and 90 transitions. [2020-06-22 09:15:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:15:58,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 09:15:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:58,106 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:15:58,106 INFO L226 Difference]: Without dead ends: 50 [2020-06-22 09:15:58,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:15:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-06-22 09:15:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2020-06-22 09:15:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 09:15:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2020-06-22 09:15:58,111 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 10 [2020-06-22 09:15:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:58,112 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-06-22 09:15:58,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:15:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2020-06-22 09:15:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:15:58,112 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:58,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:58,113 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash 659492471, now seen corresponding path program 1 times [2020-06-22 09:15:58,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:58,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:58,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:58,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:58,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:15:58,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:58,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:58,147 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand 4 states. [2020-06-22 09:15:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:58,223 INFO L93 Difference]: Finished difference Result 37 states and 66 transitions. [2020-06-22 09:15:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:58,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 09:15:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:58,225 INFO L225 Difference]: With dead ends: 37 [2020-06-22 09:15:58,225 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 09:15:58,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 09:15:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 09:15:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 09:15:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2020-06-22 09:15:58,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2020-06-22 09:15:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:58,230 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2020-06-22 09:15:58,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2020-06-22 09:15:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:15:58,231 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:58,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:58,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2118847463, now seen corresponding path program 1 times [2020-06-22 09:15:58,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:58,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:58,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:58,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:15:58,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:58,263 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 4 states. [2020-06-22 09:15:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:58,340 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-06-22 09:15:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:58,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 09:15:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:58,341 INFO L225 Difference]: With dead ends: 48 [2020-06-22 09:15:58,341 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 09:15:58,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 09:15:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-06-22 09:15:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 09:15:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 72 transitions. [2020-06-22 09:15:58,346 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 72 transitions. Word has length 11 [2020-06-22 09:15:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:58,346 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 72 transitions. [2020-06-22 09:15:58,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2020-06-22 09:15:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:15:58,347 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:58,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:58,347 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2118847494, now seen corresponding path program 1 times [2020-06-22 09:15:58,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:58,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:58,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:58,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:15:58,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:58,375 INFO L87 Difference]: Start difference. First operand 39 states and 72 transitions. Second operand 4 states. [2020-06-22 09:15:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:58,486 INFO L93 Difference]: Finished difference Result 53 states and 96 transitions. [2020-06-22 09:15:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:15:58,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 09:15:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:58,487 INFO L225 Difference]: With dead ends: 53 [2020-06-22 09:15:58,487 INFO L226 Difference]: Without dead ends: 51 [2020-06-22 09:15:58,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-06-22 09:15:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2020-06-22 09:15:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:15:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-06-22 09:15:58,493 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 11 [2020-06-22 09:15:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:58,493 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-06-22 09:15:58,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-06-22 09:15:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:15:58,494 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:58,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:58,494 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1030572099, now seen corresponding path program 1 times [2020-06-22 09:15:58,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:58,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:58,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:15:58,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:15:58,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:15:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:58,531 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 5 states. [2020-06-22 09:15:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:58,624 INFO L93 Difference]: Finished difference Result 46 states and 90 transitions. [2020-06-22 09:15:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:15:58,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 09:15:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:58,625 INFO L225 Difference]: With dead ends: 46 [2020-06-22 09:15:58,625 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 09:15:58,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:15:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 09:15:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-06-22 09:15:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 09:15:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 82 transitions. [2020-06-22 09:15:58,630 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 82 transitions. Word has length 11 [2020-06-22 09:15:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:58,631 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 82 transitions. [2020-06-22 09:15:58,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:15:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 82 transitions. [2020-06-22 09:15:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:15:58,631 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:58,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:58,632 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1030572097, now seen corresponding path program 1 times [2020-06-22 09:15:58,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:58,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:58,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:58,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:15:58,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:15:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:15:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:58,677 INFO L87 Difference]: Start difference. First operand 44 states and 82 transitions. Second operand 5 states. [2020-06-22 09:15:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:58,793 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2020-06-22 09:15:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:15:58,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 09:15:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:58,794 INFO L225 Difference]: With dead ends: 57 [2020-06-22 09:15:58,794 INFO L226 Difference]: Without dead ends: 55 [2020-06-22 09:15:58,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:15:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-06-22 09:15:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2020-06-22 09:15:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:15:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 86 transitions. [2020-06-22 09:15:58,800 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 86 transitions. Word has length 11 [2020-06-22 09:15:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:58,800 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 86 transitions. [2020-06-22 09:15:58,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:15:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2020-06-22 09:15:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:15:58,801 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:58,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:58,801 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1030572096, now seen corresponding path program 1 times [2020-06-22 09:15:58,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:58,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:15:58,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:15:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:15:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:15:58,875 INFO L87 Difference]: Start difference. First operand 46 states and 86 transitions. Second operand 7 states. [2020-06-22 09:15:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,064 INFO L93 Difference]: Finished difference Result 55 states and 97 transitions. [2020-06-22 09:15:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:15:59,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 09:15:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,065 INFO L225 Difference]: With dead ends: 55 [2020-06-22 09:15:59,066 INFO L226 Difference]: Without dead ends: 54 [2020-06-22 09:15:59,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-06-22 09:15:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-06-22 09:15:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2020-06-22 09:15:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:15:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2020-06-22 09:15:59,071 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 11 [2020-06-22 09:15:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,071 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2020-06-22 09:15:59,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:15:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2020-06-22 09:15:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:15:59,072 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,072 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1259688043, now seen corresponding path program 1 times [2020-06-22 09:15:59,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:15:59,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:15:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:15:59,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:59,110 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 5 states. [2020-06-22 09:15:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,171 INFO L93 Difference]: Finished difference Result 56 states and 101 transitions. [2020-06-22 09:15:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:15:59,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 09:15:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,172 INFO L225 Difference]: With dead ends: 56 [2020-06-22 09:15:59,172 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 09:15:59,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 09:15:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-06-22 09:15:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:15:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2020-06-22 09:15:59,177 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 12 [2020-06-22 09:15:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,178 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2020-06-22 09:15:59,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:15:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2020-06-22 09:15:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:15:59,178 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,179 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1259688074, now seen corresponding path program 1 times [2020-06-22 09:15:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:15:59,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:15:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:15:59,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:15:59,233 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 6 states. [2020-06-22 09:15:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,340 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2020-06-22 09:15:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:15:59,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-06-22 09:15:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,342 INFO L225 Difference]: With dead ends: 54 [2020-06-22 09:15:59,342 INFO L226 Difference]: Without dead ends: 53 [2020-06-22 09:15:59,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:15:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-06-22 09:15:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2020-06-22 09:15:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:15:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 80 transitions. [2020-06-22 09:15:59,346 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 80 transitions. Word has length 12 [2020-06-22 09:15:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,347 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 80 transitions. [2020-06-22 09:15:59,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:15:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2020-06-22 09:15:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:15:59,348 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,348 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,348 INFO L82 PathProgramCache]: Analyzing trace with hash -620594832, now seen corresponding path program 1 times [2020-06-22 09:15:59,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:15:59,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:15:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:15:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:15:59,375 INFO L87 Difference]: Start difference. First operand 46 states and 80 transitions. Second operand 4 states. [2020-06-22 09:15:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,450 INFO L93 Difference]: Finished difference Result 46 states and 80 transitions. [2020-06-22 09:15:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:15:59,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-06-22 09:15:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,451 INFO L225 Difference]: With dead ends: 46 [2020-06-22 09:15:59,451 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 09:15:59,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:15:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 09:15:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 09:15:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 09:15:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 78 transitions. [2020-06-22 09:15:59,456 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 78 transitions. Word has length 14 [2020-06-22 09:15:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,456 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 78 transitions. [2020-06-22 09:15:59,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:15:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2020-06-22 09:15:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:15:59,457 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,457 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,457 INFO L82 PathProgramCache]: Analyzing trace with hash -620594830, now seen corresponding path program 1 times [2020-06-22 09:15:59,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:15:59,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:15:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:15:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:15:59,512 INFO L87 Difference]: Start difference. First operand 45 states and 78 transitions. Second operand 6 states. [2020-06-22 09:15:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,661 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2020-06-22 09:15:59,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:15:59,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-06-22 09:15:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,662 INFO L225 Difference]: With dead ends: 49 [2020-06-22 09:15:59,662 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 09:15:59,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:15:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 09:15:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-06-22 09:15:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 09:15:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-06-22 09:15:59,666 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 14 [2020-06-22 09:15:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,666 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-06-22 09:15:59,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:15:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-06-22 09:15:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:15:59,667 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,667 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1349746105, now seen corresponding path program 1 times [2020-06-22 09:15:59,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:15:59,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:15:59,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:15:59,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:59,694 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 3 states. [2020-06-22 09:15:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,739 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-06-22 09:15:59,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:15:59,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-06-22 09:15:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,740 INFO L225 Difference]: With dead ends: 48 [2020-06-22 09:15:59,741 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 09:15:59,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 09:15:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 09:15:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 09:15:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2020-06-22 09:15:59,745 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 14 [2020-06-22 09:15:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,745 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2020-06-22 09:15:59,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:15:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2020-06-22 09:15:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:15:59,746 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,746 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1349746104, now seen corresponding path program 1 times [2020-06-22 09:15:59,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:15:59,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:15:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:15:59,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:59,774 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand 3 states. [2020-06-22 09:15:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:15:59,820 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2020-06-22 09:15:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:15:59,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-06-22 09:15:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:15:59,822 INFO L225 Difference]: With dead ends: 47 [2020-06-22 09:15:59,822 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 09:15:59,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:15:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 09:15:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2020-06-22 09:15:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 09:15:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-06-22 09:15:59,825 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 14 [2020-06-22 09:15:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:15:59,825 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-06-22 09:15:59,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:15:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-06-22 09:15:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:15:59,826 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:15:59,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:15:59,827 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:15:59,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:15:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1107468904, now seen corresponding path program 1 times [2020-06-22 09:15:59,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:15:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:15:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:15:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:15:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:15:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:15:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:15:59,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:15:59,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:15:59,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:15:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:15:59,881 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 6 states. [2020-06-22 09:16:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:00,029 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2020-06-22 09:16:00,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:16:00,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-06-22 09:16:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:00,030 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:16:00,030 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 09:16:00,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:16:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 09:16:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2020-06-22 09:16:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 09:16:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-06-22 09:16:00,034 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 15 [2020-06-22 09:16:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:00,034 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-06-22 09:16:00,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:16:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-06-22 09:16:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:16:00,035 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:00,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:00,035 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:00,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1107468905, now seen corresponding path program 1 times [2020-06-22 09:16:00,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:00,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:00,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:00,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:00,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:00,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:16:00,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:16:00,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:16:00,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:16:00,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:16:00,069 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 4 states. [2020-06-22 09:16:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:00,134 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2020-06-22 09:16:00,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:16:00,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-06-22 09:16:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:00,136 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:16:00,136 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 09:16:00,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:16:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 09:16:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-06-22 09:16:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 09:16:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. [2020-06-22 09:16:00,139 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 62 transitions. Word has length 15 [2020-06-22 09:16:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:00,140 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 62 transitions. [2020-06-22 09:16:00,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:16:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 62 transitions. [2020-06-22 09:16:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:16:00,140 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:00,140 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:00,141 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1110505885, now seen corresponding path program 1 times [2020-06-22 09:16:00,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:00,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:00,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:00,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:00,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:00,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:16:00,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:16:00,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:16:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:16:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:16:00,241 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. Second operand 7 states. [2020-06-22 09:16:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:00,409 INFO L93 Difference]: Finished difference Result 83 states and 129 transitions. [2020-06-22 09:16:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:16:00,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-06-22 09:16:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:00,410 INFO L225 Difference]: With dead ends: 83 [2020-06-22 09:16:00,411 INFO L226 Difference]: Without dead ends: 62 [2020-06-22 09:16:00,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-06-22 09:16:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-06-22 09:16:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2020-06-22 09:16:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 09:16:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-06-22 09:16:00,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 15 [2020-06-22 09:16:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:00,415 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-06-22 09:16:00,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:16:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-06-22 09:16:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:16:00,416 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:00,416 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:00,416 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1866562806, now seen corresponding path program 1 times [2020-06-22 09:16:00,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:00,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:00,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:00,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:00,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:00,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:00,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:16:00,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:00,688 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:00,689 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 09:16:00,690 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:00,713 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-06-22 09:16:00,714 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:00,714 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-06-22 09:16:00,745 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:16:00,745 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:00,754 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:00,755 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:16:00,756 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 09:16:00,849 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:00,850 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 09:16:00,854 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:16:00,868 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:00,873 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:00,874 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 [2020-06-22 09:16:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:01,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:01,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 09:16:01,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:16:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:16:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:16:01,008 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 15 states. [2020-06-22 09:16:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:01,688 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2020-06-22 09:16:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:16:01,688 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2020-06-22 09:16:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:01,689 INFO L225 Difference]: With dead ends: 58 [2020-06-22 09:16:01,689 INFO L226 Difference]: Without dead ends: 57 [2020-06-22 09:16:01,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2020-06-22 09:16:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-06-22 09:16:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2020-06-22 09:16:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:16:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2020-06-22 09:16:01,694 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 15 [2020-06-22 09:16:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:01,694 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2020-06-22 09:16:01,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:16:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2020-06-22 09:16:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:16:01,695 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:01,695 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:01,696 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:01,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1866562807, now seen corresponding path program 1 times [2020-06-22 09:16:01,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:01,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:01,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:01,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:01,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:01,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:01,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:01,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:01,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:16:01,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:01,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:01,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:16:01,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:16:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:16:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:16:01,837 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. Second operand 8 states. [2020-06-22 09:16:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:01,992 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2020-06-22 09:16:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:16:01,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-06-22 09:16:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:01,993 INFO L225 Difference]: With dead ends: 47 [2020-06-22 09:16:01,993 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 09:16:01,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:16:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 09:16:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-06-22 09:16:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:16:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2020-06-22 09:16:01,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 15 [2020-06-22 09:16:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:01,998 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2020-06-22 09:16:01,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:16:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2020-06-22 09:16:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 09:16:01,999 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:01,999 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:01,999 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2028869858, now seen corresponding path program 1 times [2020-06-22 09:16:01,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:02,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:02,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:02,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:02,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:02,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:02,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:16:02,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:02,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:02,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:16:02,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:16:02,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:16:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:16:02,135 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand 8 states. [2020-06-22 09:16:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:02,292 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2020-06-22 09:16:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:16:02,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-06-22 09:16:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:02,293 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:16:02,293 INFO L226 Difference]: Without dead ends: 50 [2020-06-22 09:16:02,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:16:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-06-22 09:16:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2020-06-22 09:16:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:16:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2020-06-22 09:16:02,297 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 16 [2020-06-22 09:16:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:02,298 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2020-06-22 09:16:02,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:16:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2020-06-22 09:16:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 09:16:02,298 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:02,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:02,299 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2028869859, now seen corresponding path program 1 times [2020-06-22 09:16:02,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:02,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:02,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:02,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:02,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:02,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:16:02,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:16:02,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:02,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2020-06-22 09:16:02,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 09:16:02,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 09:16:02,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:16:02,518 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 12 states. [2020-06-22 09:16:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:02,821 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2020-06-22 09:16:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:16:02,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-06-22 09:16:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:02,840 INFO L225 Difference]: With dead ends: 60 [2020-06-22 09:16:02,841 INFO L226 Difference]: Without dead ends: 59 [2020-06-22 09:16:02,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2020-06-22 09:16:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-06-22 09:16:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2020-06-22 09:16:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:16:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2020-06-22 09:16:02,845 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 16 [2020-06-22 09:16:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:02,845 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2020-06-22 09:16:02,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 09:16:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2020-06-22 09:16:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 09:16:02,846 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:02,846 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:02,846 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2028870820, now seen corresponding path program 1 times [2020-06-22 09:16:02,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:02,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:02,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:02,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:02,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:02,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:02,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:02,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:02,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 09:16:02,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:02,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 09:16:02,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:16:02,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:16:02,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:16:02,962 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2020-06-22 09:16:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:03,045 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2020-06-22 09:16:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:16:03,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-06-22 09:16:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:03,046 INFO L225 Difference]: With dead ends: 60 [2020-06-22 09:16:03,047 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 09:16:03,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:16:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 09:16:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-06-22 09:16:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 09:16:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2020-06-22 09:16:03,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 16 [2020-06-22 09:16:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:03,051 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2020-06-22 09:16:03,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:16:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2020-06-22 09:16:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 09:16:03,051 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:03,052 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:03,052 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1691115001, now seen corresponding path program 1 times [2020-06-22 09:16:03,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:03,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:03,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:03,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:16:03,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 09:16:03,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:16:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:16:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:16:03,147 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand 8 states. [2020-06-22 09:16:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:03,284 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2020-06-22 09:16:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:16:03,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-06-22 09:16:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:03,285 INFO L225 Difference]: With dead ends: 57 [2020-06-22 09:16:03,285 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 09:16:03,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-06-22 09:16:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 09:16:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 09:16:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 09:16:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2020-06-22 09:16:03,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 17 [2020-06-22 09:16:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:03,289 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2020-06-22 09:16:03,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:16:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2020-06-22 09:16:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 09:16:03,290 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:03,290 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:03,290 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1882624238, now seen corresponding path program 1 times [2020-06-22 09:16:03,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:03,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:03,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:03,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:03,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:03,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:03,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 37 conjunts are in the unsatisfiable core [2020-06-22 09:16:03,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:03,489 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:16:03,489 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:03,495 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:03,499 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:16:03,499 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:03,506 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:03,506 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:03,507 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 09:16:03,526 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:16:03,526 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:03,530 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:03,530 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:03,530 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 09:16:03,551 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 09:16:03,552 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:03,557 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:03,558 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:16:03,558 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-06-22 09:16:03,618 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:03,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-06-22 09:16:03,620 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:16:03,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:03,631 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:16:03,631 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2020-06-22 09:16:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-06-22 09:16:03,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:16:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:16:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:16:03,691 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand 15 states. [2020-06-22 09:16:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:04,502 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2020-06-22 09:16:04,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 09:16:04,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-06-22 09:16:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:04,503 INFO L225 Difference]: With dead ends: 46 [2020-06-22 09:16:04,503 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 09:16:04,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:16:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 09:16:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2020-06-22 09:16:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 09:16:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2020-06-22 09:16:04,508 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 17 [2020-06-22 09:16:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:04,508 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2020-06-22 09:16:04,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:16:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2020-06-22 09:16:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 09:16:04,509 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:04,509 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:04,509 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:04,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1882624237, now seen corresponding path program 1 times [2020-06-22 09:16:04,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:04,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:04,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:04,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:04,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:04,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:16:04,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:04,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:04,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:16:04,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:16:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:16:04,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:16:04,633 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 8 states. [2020-06-22 09:16:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:04,742 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2020-06-22 09:16:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:16:04,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-06-22 09:16:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:04,743 INFO L225 Difference]: With dead ends: 45 [2020-06-22 09:16:04,743 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:16:04,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:16:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:16:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 09:16:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:16:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-06-22 09:16:04,746 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2020-06-22 09:16:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:04,746 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-06-22 09:16:04,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:16:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-06-22 09:16:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 09:16:04,747 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:04,747 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:04,747 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1531107913, now seen corresponding path program 1 times [2020-06-22 09:16:04,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:04,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:04,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:04,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:04,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:04,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:04,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 09:16:04,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:04,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:04,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2020-06-22 09:16:04,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 09:16:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 09:16:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-06-22 09:16:04,932 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 11 states. [2020-06-22 09:16:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:05,153 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-06-22 09:16:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:16:05,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-06-22 09:16:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:05,154 INFO L225 Difference]: With dead ends: 37 [2020-06-22 09:16:05,154 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 09:16:05,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:16:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 09:16:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2020-06-22 09:16:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 09:16:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-06-22 09:16:05,157 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2020-06-22 09:16:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:05,158 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-06-22 09:16:05,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 09:16:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-06-22 09:16:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 09:16:05,158 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:05,158 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:05,158 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1779021663, now seen corresponding path program 1 times [2020-06-22 09:16:05,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:05,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:05,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:05,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:05,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:05,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:05,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:05,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:16:05,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:05,324 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:05,324 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 09:16:05,324 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:05,341 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-06-22 09:16:05,342 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:05,342 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-06-22 09:16:05,362 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:16:05,362 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:05,369 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:05,370 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:16:05,370 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 09:16:05,425 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:05,425 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 09:16:05,426 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:16:05,437 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:05,439 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:05,439 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 [2020-06-22 09:16:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:05,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 09:16:05,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:16:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:16:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:16:05,543 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 15 states. [2020-06-22 09:16:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:06,031 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-06-22 09:16:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:16:06,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2020-06-22 09:16:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:06,032 INFO L225 Difference]: With dead ends: 36 [2020-06-22 09:16:06,032 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 09:16:06,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2020-06-22 09:16:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 09:16:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-06-22 09:16:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 09:16:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-06-22 09:16:06,035 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 19 [2020-06-22 09:16:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:06,035 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-06-22 09:16:06,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:16:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-06-22 09:16:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 09:16:06,036 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:06,036 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:06,036 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1411313344, now seen corresponding path program 2 times [2020-06-22 09:16:06,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:06,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:06,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:06,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:16:06,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:16:06,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:16:06,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 43 conjunts are in the unsatisfiable core [2020-06-22 09:16:06,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:06,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:16:06,284 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:16:06,285 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,292 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:06,295 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:16:06,296 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,302 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:06,302 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,303 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 09:16:06,323 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:16:06,323 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:06,328 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,328 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 09:16:06,367 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 09:16:06,368 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,374 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:06,374 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:06,374 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-06-22 09:16:06,420 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:06,421 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 09:16:06,422 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:16:06,429 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:06,431 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:16:06,431 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-06-22 09:16:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:06,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:06,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 09:16:06,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:16:06,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:16:06,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:16:06,493 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 17 states. [2020-06-22 09:16:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:07,313 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-06-22 09:16:07,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 09:16:07,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2020-06-22 09:16:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:07,314 INFO L225 Difference]: With dead ends: 37 [2020-06-22 09:16:07,314 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 09:16:07,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2020-06-22 09:16:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 09:16:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2020-06-22 09:16:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 09:16:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-06-22 09:16:07,317 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 20 [2020-06-22 09:16:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-06-22 09:16:07,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:16:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-06-22 09:16:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 09:16:07,318 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:07,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:07,318 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1064583956, now seen corresponding path program 1 times [2020-06-22 09:16:07,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:07,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:07,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:16:07,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:07,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:07,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 50 conjunts are in the unsatisfiable core [2020-06-22 09:16:07,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:07,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:16:07,601 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:16:07,601 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,608 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,612 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:16:07,613 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,621 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,621 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,621 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 09:16:07,643 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:16:07,644 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,648 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,648 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,648 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 09:16:07,693 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 09:16:07,694 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,700 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,701 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,701 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 09:16:07,707 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 09:16:07,708 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:07,713 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,714 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:16:07,714 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-06-22 09:16:07,781 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,781 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-06-22 09:16:07,782 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:16:07,794 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:07,795 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:16:07,796 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2020-06-22 09:16:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 09:16:07,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:07,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-06-22 09:16:07,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 09:16:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 09:16:07,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:16:07,861 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 18 states. [2020-06-22 09:16:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:08,720 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-06-22 09:16:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-06-22 09:16:08,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2020-06-22 09:16:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:08,721 INFO L225 Difference]: With dead ends: 36 [2020-06-22 09:16:08,721 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 09:16:08,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2020-06-22 09:16:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 09:16:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 09:16:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 09:16:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-06-22 09:16:08,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2020-06-22 09:16:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:08,725 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-06-22 09:16:08,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 09:16:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-06-22 09:16:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 09:16:08,725 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:08,725 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:08,726 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 935907201, now seen corresponding path program 2 times [2020-06-22 09:16:08,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:08,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:08,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:08,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:08,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:08,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:16:08,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:16:08,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:16:08,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 36 conjunts are in the unsatisfiable core [2020-06-22 09:16:08,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:08,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:16:08,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:16:08,875 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:08,885 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:08,892 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:16:08,892 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:08,900 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:08,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:08,901 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-06-22 09:16:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:09,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:09,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-06-22 09:16:09,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 09:16:09,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 09:16:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:16:09,055 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 18 states. [2020-06-22 09:16:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:09,611 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-06-22 09:16:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-06-22 09:16:09,611 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2020-06-22 09:16:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:09,612 INFO L225 Difference]: With dead ends: 55 [2020-06-22 09:16:09,612 INFO L226 Difference]: Without dead ends: 54 [2020-06-22 09:16:09,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2020-06-22 09:16:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-06-22 09:16:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2020-06-22 09:16:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 09:16:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2020-06-22 09:16:09,616 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 22 [2020-06-22 09:16:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:09,616 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-06-22 09:16:09,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 09:16:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2020-06-22 09:16:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-06-22 09:16:09,617 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:09,617 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:09,617 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1758598825, now seen corresponding path program 2 times [2020-06-22 09:16:09,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:09,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:09,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:09,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:16:09,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:09,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:09,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:09,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:16:09,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:16:09,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:16:09,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 43 conjunts are in the unsatisfiable core [2020-06-22 09:16:09,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:09,903 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:16:09,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,909 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:09,912 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:16:09,912 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,918 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:09,918 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,918 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 09:16:09,939 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:16:09,939 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,943 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:09,943 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,943 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 09:16:09,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 09:16:09,983 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,988 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:09,989 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:09,989 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-06-22 09:16:10,038 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:10,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 09:16:10,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:16:10,054 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:10,056 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:16:10,056 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-06-22 09:16:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:10,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 09:16:10,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:16:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:16:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:16:10,127 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 17 states. [2020-06-22 09:16:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:10,848 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-06-22 09:16:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 09:16:10,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2020-06-22 09:16:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:10,849 INFO L225 Difference]: With dead ends: 44 [2020-06-22 09:16:10,849 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 09:16:10,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2020-06-22 09:16:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 09:16:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-06-22 09:16:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 09:16:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-06-22 09:16:10,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 24 [2020-06-22 09:16:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:10,854 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-06-22 09:16:10,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:16:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-06-22 09:16:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-06-22 09:16:10,854 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:16:10,854 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:10,855 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 09:16:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1698263607, now seen corresponding path program 3 times [2020-06-22 09:16:10,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:10,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:10,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:16:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-06-22 09:16:10,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:16:10,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:16:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 09:16:11,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-06-22 09:16:11,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:16:11,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 57 conjunts are in the unsatisfiable core [2020-06-22 09:16:11,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:11,095 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:16:11,095 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:11,112 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:11,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:16:11,120 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:16:11,129 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:16:11,129 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:16:11,129 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-06-22 09:16:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:11,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:16:11,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2020-06-22 09:16:11,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-06-22 09:16:11,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-06-22 09:16:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:16:11,408 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 25 states. [2020-06-22 09:16:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:12,346 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-06-22 09:16:12,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-06-22 09:16:12,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2020-06-22 09:16:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:16:12,347 INFO L225 Difference]: With dead ends: 46 [2020-06-22 09:16:12,347 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:16:12,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-06-22 09:16:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:16:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:16:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:16:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:16:12,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-06-22 09:16:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:16:12,349 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:16:12,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-06-22 09:16:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:16:12,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:16:12,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:16:12,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:12,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:16:13,210 WARN L188 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-06-22 09:16:13,214 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2020-06-22 09:16:13,214 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2020-06-22 09:16:13,214 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 28) no Hoare annotation was computed. [2020-06-22 09:16:13,215 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 31) no Hoare annotation was computed. [2020-06-22 09:16:13,215 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 22) no Hoare annotation was computed. [2020-06-22 09:16:13,215 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse17 (select |#length| ULTIMATE.start_cstrlcpy_~d~0.base)) (.cse10 (select |#length| ULTIMATE.start_cstrlcpy_~s~0.base)) (.cse19 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse11 (select |#memory_int| ULTIMATE.start_cstrlcpy_~s~0.base)) (.cse0 (<= ULTIMATE.start_cstrlcpy_~s~0.base ULTIMATE.start_cstrlcpy_~src.base)) (.cse1 (<= 1 ULTIMATE.start_main_~length~0)) (.cse2 (= .cse19 ULTIMATE.start_main_~n~1)) (.cse20 (= 0 ULTIMATE.start_cstrlcpy_~d~0.offset)) (.cse3 (<= ULTIMATE.start_cstrlcpy_~src.base ULTIMATE.start_cstrlcpy_~s~0.base)) (.cse4 (= (select |#valid| ULTIMATE.start_cstrlcpy_~d~0.base) 1)) (.cse18 (= ULTIMATE.start_cstrlcpy_~n~0 ULTIMATE.start_cstrlcpy_~siz)) (.cse5 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse24 (= ULTIMATE.start_cstrlcpy_~s~0.offset 0)) (.cse6 (not (= ULTIMATE.start_cstrlcpy_~d~0.base ULTIMATE.start_cstrlcpy_~s~0.base))) (.cse7 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length~0)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse9 (<= 1 ULTIMATE.start_cstrlcpy_~n~0)) (.cse21 (<= 1 .cse10)) (.cse12 (<= 1 ULTIMATE.start_main_~n~1)) (.cse13 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse22 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrlcpy_~s~0.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrlcpy_~s~0.base) (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= ULTIMATE.start_cstrlcpy_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrlcpy_~s~0.base))) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse16 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse23 (<= ULTIMATE.start_cstrlcpy_~n~0 .cse17))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_cstrlcpy_~siz) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ULTIMATE.start_cstrlcpy_~s~0.offset 1) .cse10) (= (select .cse11 (+ .cse10 (- 1))) 0) .cse12 .cse13 (<= 1 ULTIMATE.start_cstrlcpy_~d~0.offset) .cse14 .cse15 .cse16 (<= (+ ULTIMATE.start_cstrlcpy_~d~0.offset ULTIMATE.start_cstrlcpy_~n~0) .cse17) (<= 1 ULTIMATE.start_cstrlcpy_~s~0.offset)) (and (= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~length~0) 1) (and .cse0 .cse2 .cse3 .cse14 .cse4 .cse15 .cse18 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset 1) .cse19) .cse8) .cse20 .cse21 .cse13 .cse22 .cse5 (= (select .cse11 ULTIMATE.start_cstrlcpy_~s~0.offset) 0) .cse16 .cse23 .cse24 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse18 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse21 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse23)))) [2020-06-22 09:16:13,215 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 42 44) no Hoare annotation was computed. [2020-06-22 09:16:13,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 48) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 48) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 47) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 47) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 31) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:16:13,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 23) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 33) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 21) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 12 34) no Hoare annotation was computed. [2020-06-22 09:16:13,217 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2020-06-22 09:16:13,218 INFO L448 ceAbstractionStarter]: For program point L47-1(line 47) no Hoare annotation was computed. [2020-06-22 09:16:13,218 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2020-06-22 09:16:13,218 INFO L448 ceAbstractionStarter]: For program point L39-2(lines 36 51) no Hoare annotation was computed. [2020-06-22 09:16:13,218 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:16:13,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:13,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:13,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:13,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:16:13 BasicIcfg [2020-06-22 09:16:13,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:16:13,259 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:16:13,259 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:16:13,262 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:16:13,263 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:16:13,263 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:15:55" (1/5) ... [2020-06-22 09:16:13,264 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@674e6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:16:13, skipping insertion in model container [2020-06-22 09:16:13,264 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:16:13,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:15:55" (2/5) ... [2020-06-22 09:16:13,264 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@674e6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:16:13, skipping insertion in model container [2020-06-22 09:16:13,264 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:16:13,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:15:56" (3/5) ... [2020-06-22 09:16:13,264 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@674e6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:16:13, skipping insertion in model container [2020-06-22 09:16:13,265 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:16:13,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:15:56" (4/5) ... [2020-06-22 09:16:13,265 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@674e6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:16:13, skipping insertion in model container [2020-06-22 09:16:13,265 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:16:13,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:16:13" (5/5) ... [2020-06-22 09:16:13,266 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:16:13,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:16:13,287 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:16:13,288 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:16:13,288 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:16:13,288 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:16:13,288 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:16:13,288 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:16:13,288 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:16:13,288 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:16:13,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-06-22 09:16:13,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 09:16:13,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:16:13,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:16:13,301 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:13,301 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:16:13,301 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:16:13,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-06-22 09:16:13,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 09:16:13,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:16:13,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:16:13,303 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:13,303 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:16:13,308 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [206] ULTIMATE.startENTRY-->L39: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_11, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_21|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~n~1, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret10, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0] 26#L39true [137] L39-->L39-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 22#L39-2true [138] L39-2-->L42-1: Formula: (>= v_ULTIMATE.start_main_~n~1_6 1) InVars {ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} OutVars{ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} AuxVars[] AssignedVars[] 13#L42-1true [163] L42-1-->L47: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~1_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_3|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~nondetString2~0.offset] 3#L47true [90] L47-->L47-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0)) |v_#memory_int_2|) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 19#L47-1true [207] L47-1-->L18: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrlcpy_~dst.offset_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (<= .cse0 (select |v_#length_16| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_11|) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_7 v_ULTIMATE.start_cstrlcpy_~dst.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_9 v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.base_8 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 v_ULTIMATE.start_cstrlcpy_~s~0.offset_8) (= (select |v_#valid_23| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_main_~n~1_12) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 v_ULTIMATE.start_cstrlcpy_~d~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_cstrlcpy_~siz_5) (= v_ULTIMATE.start_cstrlcpy_~n~0_9 v_ULTIMATE.start_cstrlcpy_~siz_5))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_16|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_8|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_7|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_7|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_8|, ULTIMATE.start_cstrlcpy_~src.offset=v_ULTIMATE.start_cstrlcpy_~src.offset_4, ULTIMATE.start_cstrlcpy_~src.base=v_ULTIMATE.start_cstrlcpy_~src.base_5, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_8, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_16|, ULTIMATE.start_cstrlcpy_#in~dst.offset=|v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|, ULTIMATE.start_cstrlcpy_#in~dst.base=|v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_7|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_9, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_7|, ULTIMATE.start_cstrlcpy_#res=|v_ULTIMATE.start_cstrlcpy_#res_4|, ULTIMATE.start_cstrlcpy_~dst.offset=v_ULTIMATE.start_cstrlcpy_~dst.offset_3, ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_5, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_9, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrlcpy_#in~src.base=|v_ULTIMATE.start_cstrlcpy_#in~src.base_2|, ULTIMATE.start_cstrlcpy_#in~siz=|v_ULTIMATE.start_cstrlcpy_#in~siz_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_8, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_7|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_cstrlcpy_~dst.base=v_ULTIMATE.start_cstrlcpy_~dst.base_3, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrlcpy_#in~src.offset=|v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post4.base, ULTIMATE.start_cstrlcpy_~src.offset, ULTIMATE.start_cstrlcpy_~src.base, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#in~dst.offset, ULTIMATE.start_cstrlcpy_#in~dst.base, ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset, ULTIMATE.start_cstrlcpy_#res, ULTIMATE.start_cstrlcpy_~dst.offset, ULTIMATE.start_cstrlcpy_~siz, ULTIMATE.start_cstrlcpy_~n~0, ULTIMATE.start_cstrlcpy_#in~src.base, ULTIMATE.start_cstrlcpy_#in~siz, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post4.offset, #memory_int, ULTIMATE.start_cstrlcpy_~dst.base, ULTIMATE.start_cstrlcpy_#in~src.offset] 9#L18true [173] L18-->L19-3: Formula: (< 0 v_ULTIMATE.start_cstrlcpy_~n~0_4) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} AuxVars[] AssignedVars[] 23#L19-3true [2020-06-22 09:16:13,309 INFO L796 eck$LassoCheckResult]: Loop: 23#L19-3true [126] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrlcpy_~n~0_6 (- 1)))) (and (= v_ULTIMATE.start_cstrlcpy_~n~0_5 .cse0) (= |v_ULTIMATE.start_cstrlcpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_6} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_5, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~n~0] 27#L19-1true [184] L19-1-->L20: Formula: (and (= v_ULTIMATE.start_cstrlcpy_~d~0.base_3 |v_ULTIMATE.start_cstrlcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2| v_ULTIMATE.start_cstrlcpy_~s~0.offset_7) (= |v_ULTIMATE.start_cstrlcpy_#t~post1.base_2| v_ULTIMATE.start_cstrlcpy_~d~0.base_4) (= v_ULTIMATE.start_cstrlcpy_~s~0.offset_6 (+ |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2| 1)) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cstrlcpy_#t~post2.base_2| v_ULTIMATE.start_cstrlcpy_~s~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_7 |v_ULTIMATE.start_cstrlcpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrlcpy_~d~0.offset_4) (< 0 |v_ULTIMATE.start_cstrlcpy_#t~pre0_6|)) InVars {ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_8, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_6|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_4, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_7, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_5|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_3, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_6, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_3, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_2|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2|, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_7, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset] 14#L20true [112] L20-->L20-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|)) (= (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|) |v_ULTIMATE.start_cstrlcpy_#t~mem3_2|) (= 1 (select |v_#valid_15| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_2|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3] 12#L20-1true [108] L20-1-->L20-2: Formula: (and (= 1 (select |v_#valid_17| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|)) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3| 1) (select |v_#length_12| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrlcpy_#t~mem3_3|)))) InVars {ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_3|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|, #length=|v_#length_12|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_3|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 10#L20-2true [204] L20-2-->L19-3: Formula: (> 0 |v_ULTIMATE.start_cstrlcpy_#t~mem3_7|) InVars {ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_6|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_6|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_7|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_7|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post1.offset] 23#L19-3true [2020-06-22 09:16:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash -355403805, now seen corresponding path program 1 times [2020-06-22 09:16:13,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:13,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash 150585525, now seen corresponding path program 1 times [2020-06-22 09:16:13,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:13,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:13,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:13,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:13,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1590846995, now seen corresponding path program 1 times [2020-06-22 09:16:13,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:13,761 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2020-06-22 09:16:13,878 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-06-22 09:16:13,890 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:16:13,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:16:13,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:16:13,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:16:13,891 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:16:13,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:16:13,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:16:13,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:16:13,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:16:13,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:16:13,892 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:16:13,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:13,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:14,245 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2020-06-22 09:16:14,382 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-06-22 09:16:14,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:14,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:14,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:14,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:14,630 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-06-22 09:16:14,954 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-06-22 09:16:15,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:16:15,020 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:16:15,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:16:15,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:16:15,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:16:15,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:16:15,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:15,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:15,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:15,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:15,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:15,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:15,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:15,184 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:16:15,215 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:16:15,215 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:16:15,218 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:16:15,219 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:16:15,219 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:16:15,220 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 Supporting invariants [] [2020-06-22 09:16:15,277 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 09:16:15,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:15,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:16:15,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:15,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:16:15,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:15,516 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:16:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:15,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:16:15,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:15,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:16:15,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:15,543 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 09:16:15,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 09:16:15,548 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states. Second operand 7 states. [2020-06-22 09:16:16,105 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states.. Second operand 7 states. Result 81 states and 149 transitions. Complement of second has 13 states. [2020-06-22 09:16:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 3 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 09:16:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 09:16:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-06-22 09:16:16,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 105 transitions. Stem has 7 letters. Loop has 5 letters. [2020-06-22 09:16:16,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:16:16,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 105 transitions. Stem has 12 letters. Loop has 5 letters. [2020-06-22 09:16:16,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:16:16,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 105 transitions. Stem has 7 letters. Loop has 10 letters. [2020-06-22 09:16:16,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:16:16,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 149 transitions. [2020-06-22 09:16:16,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-06-22 09:16:16,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 35 states and 58 transitions. [2020-06-22 09:16:16,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 09:16:16,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-22 09:16:16,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 58 transitions. [2020-06-22 09:16:16,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:16:16,124 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-06-22 09:16:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 58 transitions. [2020-06-22 09:16:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-06-22 09:16:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:16:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-06-22 09:16:16,126 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 09:16:16,126 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 09:16:16,126 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:16:16,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 47 transitions. [2020-06-22 09:16:16,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 09:16:16,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:16:16,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:16:16,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:16,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:16:16,129 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY [206] ULTIMATE.startENTRY-->L39: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_11, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_21|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~n~1, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret10, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0] 311#L39 [137] L39-->L39-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 301#L39-2 [138] L39-2-->L42-1: Formula: (>= v_ULTIMATE.start_main_~n~1_6 1) InVars {ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} OutVars{ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} AuxVars[] AssignedVars[] 302#L42-1 [163] L42-1-->L47: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~1_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_3|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~nondetString2~0.offset] 297#L47 [90] L47-->L47-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0)) |v_#memory_int_2|) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 298#L47-1 [207] L47-1-->L18: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrlcpy_~dst.offset_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (<= .cse0 (select |v_#length_16| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_11|) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_7 v_ULTIMATE.start_cstrlcpy_~dst.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_9 v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.base_8 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 v_ULTIMATE.start_cstrlcpy_~s~0.offset_8) (= (select |v_#valid_23| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_main_~n~1_12) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 v_ULTIMATE.start_cstrlcpy_~d~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_cstrlcpy_~siz_5) (= v_ULTIMATE.start_cstrlcpy_~n~0_9 v_ULTIMATE.start_cstrlcpy_~siz_5))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_16|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_8|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_7|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_7|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_8|, ULTIMATE.start_cstrlcpy_~src.offset=v_ULTIMATE.start_cstrlcpy_~src.offset_4, ULTIMATE.start_cstrlcpy_~src.base=v_ULTIMATE.start_cstrlcpy_~src.base_5, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_8, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_16|, ULTIMATE.start_cstrlcpy_#in~dst.offset=|v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|, ULTIMATE.start_cstrlcpy_#in~dst.base=|v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_7|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_9, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_7|, ULTIMATE.start_cstrlcpy_#res=|v_ULTIMATE.start_cstrlcpy_#res_4|, ULTIMATE.start_cstrlcpy_~dst.offset=v_ULTIMATE.start_cstrlcpy_~dst.offset_3, ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_5, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_9, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrlcpy_#in~src.base=|v_ULTIMATE.start_cstrlcpy_#in~src.base_2|, ULTIMATE.start_cstrlcpy_#in~siz=|v_ULTIMATE.start_cstrlcpy_#in~siz_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_8, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_7|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_cstrlcpy_~dst.base=v_ULTIMATE.start_cstrlcpy_~dst.base_3, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrlcpy_#in~src.offset=|v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post4.base, ULTIMATE.start_cstrlcpy_~src.offset, ULTIMATE.start_cstrlcpy_~src.base, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#in~dst.offset, ULTIMATE.start_cstrlcpy_#in~dst.base, ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset, ULTIMATE.start_cstrlcpy_#res, ULTIMATE.start_cstrlcpy_~dst.offset, ULTIMATE.start_cstrlcpy_~siz, ULTIMATE.start_cstrlcpy_~n~0, ULTIMATE.start_cstrlcpy_#in~src.base, ULTIMATE.start_cstrlcpy_#in~siz, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post4.offset, #memory_int, ULTIMATE.start_cstrlcpy_~dst.base, ULTIMATE.start_cstrlcpy_#in~src.offset] 314#L18 [172] L18-->L19-3: Formula: (> 0 v_ULTIMATE.start_cstrlcpy_~n~0_4) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} AuxVars[] AssignedVars[] 315#L19-3 [2020-06-22 09:16:16,129 INFO L796 eck$LassoCheckResult]: Loop: 315#L19-3 [126] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrlcpy_~n~0_6 (- 1)))) (and (= v_ULTIMATE.start_cstrlcpy_~n~0_5 .cse0) (= |v_ULTIMATE.start_cstrlcpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_6} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_5, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~n~0] 323#L19-1 [184] L19-1-->L20: Formula: (and (= v_ULTIMATE.start_cstrlcpy_~d~0.base_3 |v_ULTIMATE.start_cstrlcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2| v_ULTIMATE.start_cstrlcpy_~s~0.offset_7) (= |v_ULTIMATE.start_cstrlcpy_#t~post1.base_2| v_ULTIMATE.start_cstrlcpy_~d~0.base_4) (= v_ULTIMATE.start_cstrlcpy_~s~0.offset_6 (+ |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2| 1)) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cstrlcpy_#t~post2.base_2| v_ULTIMATE.start_cstrlcpy_~s~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_7 |v_ULTIMATE.start_cstrlcpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrlcpy_~d~0.offset_4) (< 0 |v_ULTIMATE.start_cstrlcpy_#t~pre0_6|)) InVars {ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_8, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_6|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_4, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_7, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_5|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_3, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_6, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_3, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_2|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2|, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_7, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset] 321#L20 [112] L20-->L20-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|)) (= (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|) |v_ULTIMATE.start_cstrlcpy_#t~mem3_2|) (= 1 (select |v_#valid_15| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_2|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3] 318#L20-1 [108] L20-1-->L20-2: Formula: (and (= 1 (select |v_#valid_17| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|)) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3| 1) (select |v_#length_12| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrlcpy_#t~mem3_3|)))) InVars {ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_3|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|, #length=|v_#length_12|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_3|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 319#L20-2 [204] L20-2-->L19-3: Formula: (> 0 |v_ULTIMATE.start_cstrlcpy_#t~mem3_7|) InVars {ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_6|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_6|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_7|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_7|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post1.offset] 315#L19-3 [2020-06-22 09:16:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash -355403806, now seen corresponding path program 1 times [2020-06-22 09:16:16,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:16,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:16:16,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:16:16,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 09:16:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash 150585525, now seen corresponding path program 2 times [2020-06-22 09:16:16,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:16:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:16:16,260 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-06-22 09:16:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:16,308 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-06-22 09:16:16,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:16:16,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 36 transitions. [2020-06-22 09:16:16,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:16:16,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 36 transitions. [2020-06-22 09:16:16,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 09:16:16,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 09:16:16,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 36 transitions. [2020-06-22 09:16:16,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:16:16,314 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-06-22 09:16:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 36 transitions. [2020-06-22 09:16:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 09:16:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:16:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2020-06-22 09:16:16,315 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-06-22 09:16:16,315 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-06-22 09:16:16,315 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:16:16,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 36 transitions. [2020-06-22 09:16:16,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:16:16,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:16:16,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:16:16,316 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:16,317 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:16:16,317 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY [206] ULTIMATE.startENTRY-->L39: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_11, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_21|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~n~1, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret10, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0] 369#L39 [137] L39-->L39-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 359#L39-2 [138] L39-2-->L42-1: Formula: (>= v_ULTIMATE.start_main_~n~1_6 1) InVars {ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} OutVars{ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} AuxVars[] AssignedVars[] 360#L42-1 [163] L42-1-->L47: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~1_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_3|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~nondetString2~0.offset] 355#L47 [90] L47-->L47-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0)) |v_#memory_int_2|) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 356#L47-1 [207] L47-1-->L18: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrlcpy_~dst.offset_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (<= .cse0 (select |v_#length_16| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_11|) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_7 v_ULTIMATE.start_cstrlcpy_~dst.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_9 v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.base_8 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 v_ULTIMATE.start_cstrlcpy_~s~0.offset_8) (= (select |v_#valid_23| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_main_~n~1_12) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 v_ULTIMATE.start_cstrlcpy_~d~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_cstrlcpy_~siz_5) (= v_ULTIMATE.start_cstrlcpy_~n~0_9 v_ULTIMATE.start_cstrlcpy_~siz_5))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_16|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_8|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_7|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_7|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_8|, ULTIMATE.start_cstrlcpy_~src.offset=v_ULTIMATE.start_cstrlcpy_~src.offset_4, ULTIMATE.start_cstrlcpy_~src.base=v_ULTIMATE.start_cstrlcpy_~src.base_5, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_8, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_16|, ULTIMATE.start_cstrlcpy_#in~dst.offset=|v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|, ULTIMATE.start_cstrlcpy_#in~dst.base=|v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_7|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_9, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_7|, ULTIMATE.start_cstrlcpy_#res=|v_ULTIMATE.start_cstrlcpy_#res_4|, ULTIMATE.start_cstrlcpy_~dst.offset=v_ULTIMATE.start_cstrlcpy_~dst.offset_3, ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_5, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_9, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrlcpy_#in~src.base=|v_ULTIMATE.start_cstrlcpy_#in~src.base_2|, ULTIMATE.start_cstrlcpy_#in~siz=|v_ULTIMATE.start_cstrlcpy_#in~siz_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_8, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_7|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_cstrlcpy_~dst.base=v_ULTIMATE.start_cstrlcpy_~dst.base_3, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrlcpy_#in~src.offset=|v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post4.base, ULTIMATE.start_cstrlcpy_~src.offset, ULTIMATE.start_cstrlcpy_~src.base, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#in~dst.offset, ULTIMATE.start_cstrlcpy_#in~dst.base, ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset, ULTIMATE.start_cstrlcpy_#res, ULTIMATE.start_cstrlcpy_~dst.offset, ULTIMATE.start_cstrlcpy_~siz, ULTIMATE.start_cstrlcpy_~n~0, ULTIMATE.start_cstrlcpy_#in~src.base, ULTIMATE.start_cstrlcpy_#in~siz, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post4.offset, #memory_int, ULTIMATE.start_cstrlcpy_~dst.base, ULTIMATE.start_cstrlcpy_#in~src.offset] 370#L18 [173] L18-->L19-3: Formula: (< 0 v_ULTIMATE.start_cstrlcpy_~n~0_4) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} AuxVars[] AssignedVars[] 371#L19-3 [126] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrlcpy_~n~0_6 (- 1)))) (and (= v_ULTIMATE.start_cstrlcpy_~n~0_5 .cse0) (= |v_ULTIMATE.start_cstrlcpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_6} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_5, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~n~0] 362#L19-1 [132] L19-1-->L18-1: Formula: (= 0 |v_ULTIMATE.start_cstrlcpy_#t~pre0_4|) InVars {ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_4|} OutVars{ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0] 367#L18-1 [97] L18-1-->L27: Formula: (= 0 v_ULTIMATE.start_cstrlcpy_~n~0_8) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_8} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_8} AuxVars[] AssignedVars[] 365#L27 [96] L27-->L29-3: Formula: (= 0 v_ULTIMATE.start_cstrlcpy_~siz_4) InVars {ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_4} OutVars{ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_4} AuxVars[] AssignedVars[] 357#L29-3 [2020-06-22 09:16:16,318 INFO L796 eck$LassoCheckResult]: Loop: 357#L29-3 [94] L29-3-->L29: Formula: (and (= |v_ULTIMATE.start_cstrlcpy_#t~post4.base_1| v_ULTIMATE.start_cstrlcpy_~s~0.base_2) (= |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_1| v_ULTIMATE.start_cstrlcpy_~s~0.offset_2) (= v_ULTIMATE.start_cstrlcpy_~s~0.offset_1 (+ |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_1| 1)) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_1 |v_ULTIMATE.start_cstrlcpy_#t~post4.base_1|)) InVars {ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_2, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_2} OutVars{ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_1, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_1|, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_1, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#t~post4.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post4.base] 358#L29 [105] L29-->L29-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|) |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|) |v_ULTIMATE.start_cstrlcpy_#t~mem5_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|) 1) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2| 1) (select |v_#length_1| |v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|))) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|, #length=|v_#length_1|, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_1|, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|, #length=|v_#length_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem5] 368#L29-1 [202] L29-1-->L29-3: Formula: (< 0 |v_ULTIMATE.start_cstrlcpy_#t~mem5_5|) InVars {ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_5|} OutVars{ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_6|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_4|, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post4.offset, ULTIMATE.start_cstrlcpy_#t~post4.base] 357#L29-3 [2020-06-22 09:16:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1472753464, now seen corresponding path program 1 times [2020-06-22 09:16:16,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:16:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:16,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:16:16,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:16:16,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 09:16:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash 123582, now seen corresponding path program 1 times [2020-06-22 09:16:16,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:16:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:16:16,394 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-06-22 09:16:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:16:16,443 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2020-06-22 09:16:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:16:16,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 35 transitions. [2020-06-22 09:16:16,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:16:16,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 35 transitions. [2020-06-22 09:16:16,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 09:16:16,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 09:16:16,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 35 transitions. [2020-06-22 09:16:16,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:16:16,449 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. [2020-06-22 09:16:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 35 transitions. [2020-06-22 09:16:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 09:16:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:16:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2020-06-22 09:16:16,450 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. [2020-06-22 09:16:16,450 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. [2020-06-22 09:16:16,450 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:16:16,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 35 transitions. [2020-06-22 09:16:16,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:16:16,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:16:16,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:16:16,452 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:16:16,452 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:16:16,452 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY [206] ULTIMATE.startENTRY-->L39: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_11, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_21|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~n~1, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret10, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0] 423#L39 [137] L39-->L39-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 413#L39-2 [138] L39-2-->L42-1: Formula: (>= v_ULTIMATE.start_main_~n~1_6 1) InVars {ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} OutVars{ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} AuxVars[] AssignedVars[] 414#L42-1 [163] L42-1-->L47: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~1_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_3|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~nondetString2~0.offset] 409#L47 [90] L47-->L47-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0)) |v_#memory_int_2|) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 410#L47-1 [207] L47-1-->L18: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrlcpy_~dst.offset_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (<= .cse0 (select |v_#length_16| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_11|) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_7 v_ULTIMATE.start_cstrlcpy_~dst.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_9 v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.base_8 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 v_ULTIMATE.start_cstrlcpy_~s~0.offset_8) (= (select |v_#valid_23| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_main_~n~1_12) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 v_ULTIMATE.start_cstrlcpy_~d~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_cstrlcpy_~siz_5) (= v_ULTIMATE.start_cstrlcpy_~n~0_9 v_ULTIMATE.start_cstrlcpy_~siz_5))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_16|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_8|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_7|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_7|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_8|, ULTIMATE.start_cstrlcpy_~src.offset=v_ULTIMATE.start_cstrlcpy_~src.offset_4, ULTIMATE.start_cstrlcpy_~src.base=v_ULTIMATE.start_cstrlcpy_~src.base_5, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_8, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_16|, ULTIMATE.start_cstrlcpy_#in~dst.offset=|v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|, ULTIMATE.start_cstrlcpy_#in~dst.base=|v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_7|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_9, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_7|, ULTIMATE.start_cstrlcpy_#res=|v_ULTIMATE.start_cstrlcpy_#res_4|, ULTIMATE.start_cstrlcpy_~dst.offset=v_ULTIMATE.start_cstrlcpy_~dst.offset_3, ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_5, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_9, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrlcpy_#in~src.base=|v_ULTIMATE.start_cstrlcpy_#in~src.base_2|, ULTIMATE.start_cstrlcpy_#in~siz=|v_ULTIMATE.start_cstrlcpy_#in~siz_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_8, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_7|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_cstrlcpy_~dst.base=v_ULTIMATE.start_cstrlcpy_~dst.base_3, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrlcpy_#in~src.offset=|v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post4.base, ULTIMATE.start_cstrlcpy_~src.offset, ULTIMATE.start_cstrlcpy_~src.base, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#in~dst.offset, ULTIMATE.start_cstrlcpy_#in~dst.base, ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset, ULTIMATE.start_cstrlcpy_#res, ULTIMATE.start_cstrlcpy_~dst.offset, ULTIMATE.start_cstrlcpy_~siz, ULTIMATE.start_cstrlcpy_~n~0, ULTIMATE.start_cstrlcpy_#in~src.base, ULTIMATE.start_cstrlcpy_#in~siz, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post4.offset, #memory_int, ULTIMATE.start_cstrlcpy_~dst.base, ULTIMATE.start_cstrlcpy_#in~src.offset] 424#L18 [173] L18-->L19-3: Formula: (< 0 v_ULTIMATE.start_cstrlcpy_~n~0_4) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} AuxVars[] AssignedVars[] 425#L19-3 [126] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrlcpy_~n~0_6 (- 1)))) (and (= v_ULTIMATE.start_cstrlcpy_~n~0_5 .cse0) (= |v_ULTIMATE.start_cstrlcpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_6} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_5, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~n~0] 416#L19-1 [132] L19-1-->L18-1: Formula: (= 0 |v_ULTIMATE.start_cstrlcpy_#t~pre0_4|) InVars {ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_4|} OutVars{ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0] 421#L18-1 [97] L18-1-->L27: Formula: (= 0 v_ULTIMATE.start_cstrlcpy_~n~0_8) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_8} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_8} AuxVars[] AssignedVars[] 419#L27 [177] L27-->L28: Formula: (< 0 v_ULTIMATE.start_cstrlcpy_~siz_3) InVars {ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_3} OutVars{ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_3} AuxVars[] AssignedVars[] 420#L28 [127] L28-->L29-3: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_cstrlcpy_~d~0.base_5 (store (select |v_#memory_int_10| v_ULTIMATE.start_cstrlcpy_~d~0.base_5) v_ULTIMATE.start_cstrlcpy_~d~0.offset_5 0))) (= (select |v_#valid_19| v_ULTIMATE.start_cstrlcpy_~d~0.base_5) 1) (<= 0 v_ULTIMATE.start_cstrlcpy_~d~0.offset_5) (<= (+ v_ULTIMATE.start_cstrlcpy_~d~0.offset_5 1) (select |v_#length_14| v_ULTIMATE.start_cstrlcpy_~d~0.base_5))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_5, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_5, #valid=|v_#valid_19|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_5, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_5, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 411#L29-3 [2020-06-22 09:16:16,453 INFO L796 eck$LassoCheckResult]: Loop: 411#L29-3 [94] L29-3-->L29: Formula: (and (= |v_ULTIMATE.start_cstrlcpy_#t~post4.base_1| v_ULTIMATE.start_cstrlcpy_~s~0.base_2) (= |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_1| v_ULTIMATE.start_cstrlcpy_~s~0.offset_2) (= v_ULTIMATE.start_cstrlcpy_~s~0.offset_1 (+ |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_1| 1)) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_1 |v_ULTIMATE.start_cstrlcpy_#t~post4.base_1|)) InVars {ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_2, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_2} OutVars{ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_1, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_1|, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_1, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#t~post4.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post4.base] 412#L29 [105] L29-->L29-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|) |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|) |v_ULTIMATE.start_cstrlcpy_#t~mem5_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|) 1) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2| 1) (select |v_#length_1| |v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|))) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|, #length=|v_#length_1|, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_1|, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_2|, #length=|v_#length_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem5] 422#L29-1 [202] L29-1-->L29-3: Formula: (< 0 |v_ULTIMATE.start_cstrlcpy_#t~mem5_5|) InVars {ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_5|} OutVars{ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_6|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_4|, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post4.offset, ULTIMATE.start_cstrlcpy_#t~post4.base] 411#L29-3 [2020-06-22 09:16:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1589285510, now seen corresponding path program 1 times [2020-06-22 09:16:16,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,470 INFO L82 PathProgramCache]: Analyzing trace with hash 123582, now seen corresponding path program 2 times [2020-06-22 09:16:16,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:16:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1314748903, now seen corresponding path program 1 times [2020-06-22 09:16:16,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:16:16,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:16:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:16:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:16:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:16:17,026 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2020-06-22 09:16:17,174 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-06-22 09:16:17,176 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:16:17,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:16:17,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:16:17,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:16:17,176 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:16:17,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:16:17,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:16:17,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:16:17,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:16:17,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:16:17,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:16:17,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,502 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-06-22 09:16:17,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:17,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:16:18,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:16:18,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:16:18,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:16:18,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:16:18,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:16:18,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:16:18,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:16:18,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:16:18,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:16:18,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:16:18,066 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 09:16:18,066 INFO L444 ModelExtractionUtils]: 41 out of 52 variables were initially zero. Simplification set additionally 8 variables to zero. [2020-06-22 09:16:18,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:16:18,068 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:16:18,068 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:16:18,068 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrlcpy_~s~0.base)_2, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrlcpy_~s~0.base)_2 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2020-06-22 09:16:18,108 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 09:16:18,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:16:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:18,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:16:18,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:18,150 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 09:16:18,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:16:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:16:18,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 09:16:18,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:16:18,239 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 09:16:18,239 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 09:16:18,239 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 35 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-06-22 09:16:18,365 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 35 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 26 states and 40 transitions. Complement of second has 7 states. [2020-06-22 09:16:18,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 09:16:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 09:16:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-06-22 09:16:18,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 12 letters. Loop has 3 letters. [2020-06-22 09:16:18,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:16:18,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 15 letters. Loop has 3 letters. [2020-06-22 09:16:18,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:16:18,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 12 letters. Loop has 6 letters. [2020-06-22 09:16:18,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:16:18,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 40 transitions. [2020-06-22 09:16:18,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:16:18,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2020-06-22 09:16:18,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:16:18,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:16:18,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:16:18,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:16:18,372 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:16:18,372 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:16:18,372 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:16:18,372 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:16:18,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:16:18,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:16:18,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:16:18,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:16:18 BasicIcfg [2020-06-22 09:16:18,378 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:16:18,379 INFO L168 Benchmark]: Toolchain (without parser) took 23090.43 ms. Allocated memory was 649.6 MB in the beginning and 975.2 MB in the end (delta: 325.6 MB). Free memory was 565.2 MB in the beginning and 602.7 MB in the end (delta: -37.4 MB). Peak memory consumption was 288.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,379 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:16:18,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.55 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 565.2 MB in the beginning and 654.5 MB in the end (delta: -89.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.31 ms. Allocated memory is still 691.5 MB. Free memory was 654.5 MB in the beginning and 652.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,380 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 ms. Allocated memory is still 691.5 MB. Free memory was 652.3 MB in the beginning and 650.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,381 INFO L168 Benchmark]: RCFGBuilder took 333.29 ms. Allocated memory is still 691.5 MB. Free memory was 650.1 MB in the beginning and 624.7 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,381 INFO L168 Benchmark]: BlockEncodingV2 took 125.33 ms. Allocated memory is still 691.5 MB. Free memory was 624.7 MB in the beginning and 616.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,381 INFO L168 Benchmark]: TraceAbstraction took 17128.24 ms. Allocated memory was 691.5 MB in the beginning and 934.8 MB in the end (delta: 243.3 MB). Free memory was 615.0 MB in the beginning and 559.2 MB in the end (delta: 55.8 MB). Peak memory consumption was 299.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:16:18,382 INFO L168 Benchmark]: BuchiAutomizer took 5119.28 ms. Allocated memory was 934.8 MB in the beginning and 975.2 MB in the end (delta: 40.4 MB). Free memory was 559.2 MB in the beginning and 602.7 MB in the end (delta: -43.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:16:18,385 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 38 locations, 47 edges - StatisticsResult: Encoded RCFG 32 locations, 61 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 309.55 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 565.2 MB in the beginning and 654.5 MB in the end (delta: -89.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.31 ms. Allocated memory is still 691.5 MB. Free memory was 654.5 MB in the beginning and 652.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.06 ms. Allocated memory is still 691.5 MB. Free memory was 652.3 MB in the beginning and 650.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 333.29 ms. Allocated memory is still 691.5 MB. Free memory was 650.1 MB in the beginning and 624.7 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 125.33 ms. Allocated memory is still 691.5 MB. Free memory was 624.7 MB in the beginning and 616.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 17128.24 ms. Allocated memory was 691.5 MB in the beginning and 934.8 MB in the end (delta: 243.3 MB). Free memory was 615.0 MB in the beginning and 559.2 MB in the end (delta: 55.8 MB). Peak memory consumption was 299.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5119.28 ms. Allocated memory was 934.8 MB in the beginning and 975.2 MB in the end (delta: 40.4 MB). Free memory was 559.2 MB in the beginning and 602.7 MB in the end (delta: -43.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2020-06-22 09:16:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:16:18,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:16:18,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:16:18,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((s <= src && 1 <= length) && unknown-#length-unknown[nondetString1] == n) && src <= s) && 1 <= siz) && \valid[d] == 1) && nondetString1 == 0) && !(d == s)) && unknown-#length-unknown[nondetString2] == length) && 1 == \valid[nondetString2]) && 1 <= n) && s + 1 <= unknown-#length-unknown[s]) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && 1 <= n) && !(nondetString1 == nondetString2)) && 1 <= d) && 1 == \valid[s]) && 1 == \valid[nondetString1]) && nondetString2 == 0) && d + n <= unknown-#length-unknown[d]) && 1 <= s) || ((((((((((((nondetString2 + length == 1 && (((((((s <= src && unknown-#length-unknown[nondetString1] == n) && src <= s) && 1 == \valid[s]) && \valid[d] == 1) && 1 == \valid[nondetString1]) && n == siz) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && 1 == \valid[nondetString2]) && 0 == d) && 1 <= unknown-#length-unknown[s]) && !(nondetString1 == nondetString2)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && s <= ULTIMATE.start_main_~nondetString2~0.offset)) && nondetString1 == 0) && unknown-#memory_int-unknown[s][s] == 0) && nondetString2 == 0) && n <= unknown-#length-unknown[d]) && s == 0) && unknown-#length-unknown[nondetString2] == length) && 1 <= n)) || ((((((((((((((((((((s <= src && 1 <= length) && unknown-#length-unknown[nondetString1] == n) && 0 == d) && src <= s) && \valid[d] == 1) && n == siz) && nondetString1 == 0) && s == 0) && !(d == s)) && unknown-#length-unknown[nondetString2] == length) && 1 == \valid[nondetString2]) && 1 <= n) && 1 <= unknown-#length-unknown[s]) && 1 <= n) && !(nondetString1 == nondetString2)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && s <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[s]) && 1 == \valid[nondetString1]) && nondetString2 == 0) && n <= unknown-#length-unknown[d]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 13 error locations. SAFE Result, 17.0s OverallTime, 40 OverallIterations, 6 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 405 SDtfs, 2894 SDslu, 2349 SDs, 0 SdLazy, 4940 SolverSat, 765 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 159 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 303 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6934 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 388 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 771 ConstructedInterpolants, 12 QuantifiedInterpolants, 116073 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1979 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 54 InterpolantComputations, 26 PerfectInterpolantSequences, 40/243 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[alloca(length * sizeof(char))] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 361 SDslu, 210 SDs, 0 SdLazy, 400 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf100 lsp96 ukn80 mio100 lsp49 div100 bol100 ite100 ukn100 eq201 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:15:52.020 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:16:18.636 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check