./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:59:39,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:59:39,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:59:39,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:59:39,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:59:39,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:59:39,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:59:39,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:59:39,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:59:39,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:59:39,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:59:39,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:59:39,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:59:39,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:59:39,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:59:39,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:59:39,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:59:39,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:59:39,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:59:39,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:59:39,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:59:39,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:59:39,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:59:39,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:59:39,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:59:39,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:59:39,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:59:39,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:59:39,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:59:39,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:59:39,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:59:39,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:59:39,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:59:39,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:59:39,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:59:39,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:59:39,426 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 00:59:39,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:59:39,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:59:39,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:59:39,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:59:39,438 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:59:39,438 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:59:39,438 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:59:39,438 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:59:39,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:59:39,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:59:39,440 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:59:39,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:59:39,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:59:39,441 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:59:39,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:59:39,441 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:59:39,441 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:59:39,442 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:59:39,442 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-10 00:59:39,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:59:39,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:59:39,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:59:39,474 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:59:39,475 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:59:39,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 00:59:39,514 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/data/a457b1b25/788d1a7067d74e92b597c281f7171a16/FLAG858e7f4f1 [2018-11-10 00:59:39,845 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:59:39,846 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 00:59:39,850 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/data/a457b1b25/788d1a7067d74e92b597c281f7171a16/FLAG858e7f4f1 [2018-11-10 00:59:39,859 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/data/a457b1b25/788d1a7067d74e92b597c281f7171a16 [2018-11-10 00:59:39,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:59:39,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:59:39,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:59:39,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:59:39,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:59:39,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:39" (1/1) ... [2018-11-10 00:59:39,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab27a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:39, skipping insertion in model container [2018-11-10 00:59:39,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:39" (1/1) ... [2018-11-10 00:59:39,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:59:39,893 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:59:40,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:59:40,014 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:59:40,029 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:59:40,044 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:59:40,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40 WrapperNode [2018-11-10 00:59:40,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:59:40,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:59:40,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:59:40,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:59:40,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:59:40,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:59:40,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:59:40,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:59:40,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... [2018-11-10 00:59:40,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:59:40,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:59:40,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:59:40,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:59:40,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:59:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 00:59:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 00:59:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:59:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:59:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:59:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 00:59:40,434 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:59:40,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:40 BoogieIcfgContainer [2018-11-10 00:59:40,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:59:40,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:59:40,436 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:59:40,438 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:59:40,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:59:40,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:59:39" (1/3) ... [2018-11-10 00:59:40,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2763b119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:59:40, skipping insertion in model container [2018-11-10 00:59:40,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:59:40,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:40" (2/3) ... [2018-11-10 00:59:40,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2763b119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:59:40, skipping insertion in model container [2018-11-10 00:59:40,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:59:40,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:40" (3/3) ... [2018-11-10 00:59:40,442 INFO L375 chiAutomizerObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 00:59:40,474 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:59:40,475 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:59:40,475 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:59:40,475 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:59:40,475 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:59:40,475 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:59:40,475 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:59:40,475 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:59:40,475 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:59:40,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states. [2018-11-10 00:59:40,499 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2018-11-10 00:59:40,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:40,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:40,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:40,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:40,504 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:59:40,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states. [2018-11-10 00:59:40,506 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2018-11-10 00:59:40,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:40,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:40,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:40,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:40,511 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 37#L12true SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 34#L12-1true SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 33#L12-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 56#L17-3true [2018-11-10 00:59:40,511 INFO L795 eck$LassoCheckResult]: Loop: 56#L17-3true assume true; 43#L17-1true assume !!(init_~i~0 < 2); 6#L18true SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 5#L18-1true SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 21#L19true init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 56#L17-3true [2018-11-10 00:59:40,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:40,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28660962, now seen corresponding path program 1 times [2018-11-10 00:59:40,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:40,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 37372843, now seen corresponding path program 1 times [2018-11-10 00:59:40,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:40,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:40,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:40,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1599351958, now seen corresponding path program 1 times [2018-11-10 00:59:40,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:40,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:41,255 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2018-11-10 00:59:41,356 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:59:41,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:59:41,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:59:41,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:59:41,357 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:59:41,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:59:41,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:59:41,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:59:41,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration1_Lasso [2018-11-10 00:59:41,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:59:41,358 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:59:41,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,599 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-11-10 00:59:41,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:41,900 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:59:41,903 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:59:41,905 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 [2018-11-10 00:59:41,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,910 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 [2018-11-10 00:59:41,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,913 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 [2018-11-10 00:59:41,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,915 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 [2018-11-10 00:59:41,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,918 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 [2018-11-10 00:59:41,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:41,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:41,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,926 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 [2018-11-10 00:59:41,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:41,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:41,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,935 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 [2018-11-10 00:59:41,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,938 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 [2018-11-10 00:59:41,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,940 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 [2018-11-10 00:59:41,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:41,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:41,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,948 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 [2018-11-10 00:59:41,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,951 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 [2018-11-10 00:59:41,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:41,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:41,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:41,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:41,953 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 [2018-11-10 00:59:41,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:41,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:41,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:41,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:41,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:41,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:42,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:59:42,044 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 00:59:42,044 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 00:59:42,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:59:42,048 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 00:59:42,048 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:59:42,049 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0) = -2*ULTIMATE.start_init_~i~0 + 3 Supporting invariants [] [2018-11-10 00:59:42,095 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-10 00:59:42,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:42,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 00:59:42,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states. Second operand 4 states. [2018-11-10 00:59:42,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states.. Second operand 4 states. Result 152 states and 193 transitions. Complement of second has 7 states. [2018-11-10 00:59:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:59:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 00:59:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2018-11-10 00:59:42,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 132 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-10 00:59:42,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:59:42,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 132 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-10 00:59:42,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:59:42,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 132 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 00:59:42,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:59:42,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 193 transitions. [2018-11-10 00:59:42,220 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-10 00:59:42,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 51 states and 60 transitions. [2018-11-10 00:59:42,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 00:59:42,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 00:59:42,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2018-11-10 00:59:42,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:42,225 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-10 00:59:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2018-11-10 00:59:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-10 00:59:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 00:59:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-10 00:59:42,255 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-10 00:59:42,255 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-10 00:59:42,256 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:59:42,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-10 00:59:42,257 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-10 00:59:42,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:42,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:42,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:42,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:42,258 INFO L793 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 324#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 336#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 335#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 308#L17-3 assume true; 341#L17-1 assume !(init_~i~0 < 2); 319#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 298#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 299#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 318#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 309#L25-4 [2018-11-10 00:59:42,258 INFO L795 eck$LassoCheckResult]: Loop: 309#L25-4 assume true; 310#L25-1 assume !!(f_~i~1 < 2); 315#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 320#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 313#L25-3 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 309#L25-4 [2018-11-10 00:59:42,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1958066316, now seen corresponding path program 1 times [2018-11-10 00:59:42,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:59:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:59:42,299 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:59:42,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash 62184965, now seen corresponding path program 1 times [2018-11-10 00:59:42,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:59:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:59:42,370 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-10 00:59:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:42,390 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-10 00:59:42,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:59:42,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 64 transitions. [2018-11-10 00:59:42,392 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-10 00:59:42,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 63 transitions. [2018-11-10 00:59:42,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 00:59:42,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 00:59:42,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-10 00:59:42,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:42,393 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-10 00:59:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-10 00:59:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-10 00:59:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 00:59:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-10 00:59:42,396 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-10 00:59:42,396 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-10 00:59:42,396 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:59:42,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2018-11-10 00:59:42,397 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-10 00:59:42,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:42,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:42,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:42,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:42,401 INFO L793 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 437#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 449#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 448#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 421#L17-3 assume true; 455#L17-1 assume !!(init_~i~0 < 2); 417#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 415#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 416#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 435#L17-3 assume true; 454#L17-1 assume !(init_~i~0 < 2); 432#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 411#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 412#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 431#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 422#L25-4 [2018-11-10 00:59:42,401 INFO L795 eck$LassoCheckResult]: Loop: 422#L25-4 assume true; 423#L25-1 assume !!(f_~i~1 < 2); 428#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 433#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 426#L25-3 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 422#L25-4 [2018-11-10 00:59:42,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash -291163884, now seen corresponding path program 1 times [2018-11-10 00:59:42,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:42,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:42,428 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:42,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:59:42,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 00:59:42,499 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:59:42,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 62184965, now seen corresponding path program 2 times [2018-11-10 00:59:42,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:59:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:59:42,574 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-10 00:59:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:42,601 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-10 00:59:42,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:59:42,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2018-11-10 00:59:42,603 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-10 00:59:42,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 65 transitions. [2018-11-10 00:59:42,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 00:59:42,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 00:59:42,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-10 00:59:42,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:42,607 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-10 00:59:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-10 00:59:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-10 00:59:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 00:59:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-10 00:59:42,610 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-10 00:59:42,610 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-10 00:59:42,610 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 00:59:42,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-11-10 00:59:42,610 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-10 00:59:42,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:42,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:42,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:42,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:42,611 INFO L793 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 599#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 611#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 610#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 583#L17-3 assume true; 617#L17-1 assume !!(init_~i~0 < 2); 579#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 577#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 578#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 597#L17-3 assume true; 624#L17-1 assume !!(init_~i~0 < 2); 628#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 627#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 626#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 625#L17-3 assume true; 616#L17-1 assume !(init_~i~0 < 2); 594#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 573#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 574#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 593#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 584#L25-4 [2018-11-10 00:59:42,612 INFO L795 eck$LassoCheckResult]: Loop: 584#L25-4 assume true; 585#L25-1 assume !!(f_~i~1 < 2); 590#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 595#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 588#L25-3 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 584#L25-4 [2018-11-10 00:59:42,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash -4993652, now seen corresponding path program 2 times [2018-11-10 00:59:42,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:42,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash 62184965, now seen corresponding path program 3 times [2018-11-10 00:59:42,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:42,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:42,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1702178982, now seen corresponding path program 1 times [2018-11-10 00:59:42,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:42,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:42,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:42,836 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:42,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:42,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:42,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-11-10 00:59:42,902 INFO L477 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 00:59:42,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-11-10 00:59:42,922 INFO L477 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 00:59:42,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-10 00:59:42,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-11-10 00:59:42,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:42,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 27 [2018-11-10 00:59:42,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:42,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-11-10 00:59:43,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:43,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 27 [2018-11-10 00:59:43,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:59:43,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-11-10 00:59:43,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 20 [2018-11-10 00:59:43,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:43,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-10 00:59:43,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 20 [2018-11-10 00:59:43,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:43,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-10 00:59:43,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:43,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:7 [2018-11-10 00:59:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:43,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:59:43,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-10 00:59:43,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 00:59:43,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-10 00:59:43,164 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. cyclomatic complexity: 13 Second operand 15 states. [2018-11-10 00:59:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:43,412 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-10 00:59:43,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 00:59:43,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 84 transitions. [2018-11-10 00:59:43,413 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-10 00:59:43,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 84 transitions. [2018-11-10 00:59:43,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-10 00:59:43,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-10 00:59:43,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 84 transitions. [2018-11-10 00:59:43,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:43,414 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-11-10 00:59:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 84 transitions. [2018-11-10 00:59:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2018-11-10 00:59:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 00:59:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-11-10 00:59:43,416 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-11-10 00:59:43,416 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-11-10 00:59:43,416 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 00:59:43,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2018-11-10 00:59:43,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2018-11-10 00:59:43,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:43,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:43,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:43,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:43,421 INFO L793 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 830#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 828#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 823#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 821#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 822#L17-3 assume true; 843#L17-1 assume !!(init_~i~0 < 2); 818#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 816#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 817#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 850#L17-3 assume true; 859#L17-1 assume !!(init_~i~0 < 2); 863#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 862#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 861#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 860#L17-3 assume true; 842#L17-1 assume !(init_~i~0 < 2); 839#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 809#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 810#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 837#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 824#L25-4 assume true; 825#L25-1 assume !!(f_~i~1 < 2); 835#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 840#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 813#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 811#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 812#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 831#L25-9 [2018-11-10 00:59:43,421 INFO L795 eck$LassoCheckResult]: Loop: 831#L25-9 assume true; 844#L25-6 assume !!(f_~i~1 < 2); 851#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 855#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 848#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 831#L25-9 [2018-11-10 00:59:43,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 588415585, now seen corresponding path program 1 times [2018-11-10 00:59:43,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:43,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:43,452 INFO L82 PathProgramCache]: Analyzing trace with hash 84133980, now seen corresponding path program 1 times [2018-11-10 00:59:43,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:43,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:43,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:43,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:43,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:43,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1996734972, now seen corresponding path program 1 times [2018-11-10 00:59:43,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:43,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:48,552 WARN L179 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 287 DAG size of output: 231 [2018-11-10 00:59:49,064 WARN L179 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 00:59:49,066 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:59:49,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:59:49,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:59:49,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:59:49,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:59:49,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:59:49,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:59:49,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:59:49,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration5_Lasso [2018-11-10 00:59:49,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:59:49,067 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:59:49,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:59:49,484 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:59:49,484 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:59:49,484 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 [2018-11-10 00:59:49,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,485 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 [2018-11-10 00:59:49,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,487 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 [2018-11-10 00:59:49,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,489 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 [2018-11-10 00:59:49,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,490 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 [2018-11-10 00:59:49,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,491 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 [2018-11-10 00:59:49,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,493 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 [2018-11-10 00:59:49,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,494 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 [2018-11-10 00:59:49,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,496 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 [2018-11-10 00:59:49,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,500 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 [2018-11-10 00:59:49,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,502 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 [2018-11-10 00:59:49,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,505 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 [2018-11-10 00:59:49,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,506 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 00:59:49,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:59:49,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,508 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 [2018-11-10 00:59:49,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:59:49,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:59:49,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:59:49,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,511 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 [2018-11-10 00:59:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,526 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 [2018-11-10 00:59:49,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,529 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 [2018-11-10 00:59:49,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,532 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 [2018-11-10 00:59:49,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,537 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 [2018-11-10 00:59:49,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,538 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:59:49,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,539 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:59:49,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,543 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 [2018-11-10 00:59:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,550 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 [2018-11-10 00:59:49,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:59:49,553 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 [2018-11-10 00:59:49,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:59:49,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:59:49,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:59:49,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:59:49,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:59:49,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:59:49,564 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:59:49,572 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 00:59:49,572 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 00:59:49,572 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:59:49,573 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 00:59:49,573 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:59:49,574 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_2, ULTIMATE.start_f_~i~1) = 3*v_rep(select #length ~#pp~0.base)_2 - 8*ULTIMATE.start_f_~i~1 Supporting invariants [] [2018-11-10 00:59:49,614 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 00:59:49,616 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 00:59:49,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:49,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:49,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:49,668 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 00:59:49,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 61 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 00:59:49,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 61 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 122 states and 140 transitions. Complement of second has 8 states. [2018-11-10 00:59:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 00:59:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:59:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-10 00:59:49,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 28 letters. Loop has 5 letters. [2018-11-10 00:59:49,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:59:49,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 33 letters. Loop has 5 letters. [2018-11-10 00:59:49,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:59:49,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 00:59:49,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:59:49,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 140 transitions. [2018-11-10 00:59:49,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2018-11-10 00:59:49,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 79 states and 89 transitions. [2018-11-10 00:59:49,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-10 00:59:49,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-10 00:59:49,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 89 transitions. [2018-11-10 00:59:49,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:49,742 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-11-10 00:59:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 89 transitions. [2018-11-10 00:59:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-11-10 00:59:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 00:59:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-10 00:59:49,745 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-10 00:59:49,745 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-10 00:59:49,745 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 00:59:49,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 66 transitions. [2018-11-10 00:59:49,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 00:59:49,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:49,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:49,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:49,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:49,748 INFO L793 eck$LassoCheckResult]: Stem: 1188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1161#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 1159#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 1154#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 1152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1153#L17-3 assume true; 1177#L17-1 assume !!(init_~i~0 < 2); 1149#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1147#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1148#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1185#L17-3 assume true; 1194#L17-1 assume !!(init_~i~0 < 2); 1198#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1197#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1196#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1195#L17-3 assume true; 1176#L17-1 assume !(init_~i~0 < 2); 1170#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1140#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1141#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1168#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1155#L25-4 assume true; 1156#L25-1 assume !!(f_~i~1 < 2); 1165#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 1171#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 1144#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 1142#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 1143#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1162#L25-9 assume true; 1173#L25-6 assume !(f_~i~1 < 2); 1160#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1157#L36-4 [2018-11-10 00:59:49,748 INFO L795 eck$LassoCheckResult]: Loop: 1157#L36-4 assume true; 1158#L36-1 assume !!(g_~i~2 < 2); 1167#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 1172#L37-1 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1151#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 1157#L36-4 [2018-11-10 00:59:49,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1727215465, now seen corresponding path program 1 times [2018-11-10 00:59:49,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:59:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:59:49,774 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:59:49,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:49,774 INFO L82 PathProgramCache]: Analyzing trace with hash 106083347, now seen corresponding path program 1 times [2018-11-10 00:59:49,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:49,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:49,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:59:49,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:59:49,810 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-10 00:59:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:49,827 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-10 00:59:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:59:49,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 98 transitions. [2018-11-10 00:59:49,829 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2018-11-10 00:59:49,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 88 states and 98 transitions. [2018-11-10 00:59:49,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 00:59:49,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 00:59:49,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2018-11-10 00:59:49,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:49,830 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-10 00:59:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2018-11-10 00:59:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-11-10 00:59:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 00:59:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-10 00:59:49,834 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 00:59:49,834 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 00:59:49,834 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 00:59:49,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 67 transitions. [2018-11-10 00:59:49,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 00:59:49,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:49,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:49,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:49,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:49,836 INFO L793 eck$LassoCheckResult]: Stem: 1342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1314#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 1312#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 1307#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 1305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1306#L17-3 assume true; 1327#L17-1 assume !!(init_~i~0 < 2); 1302#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1300#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1301#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1337#L17-3 assume true; 1348#L17-1 assume !!(init_~i~0 < 2); 1352#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1351#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1350#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1349#L17-3 assume true; 1326#L17-1 assume !(init_~i~0 < 2); 1323#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1293#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1294#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1321#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1308#L25-4 assume true; 1309#L25-1 assume !!(f_~i~1 < 2); 1318#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 1324#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 1297#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 1295#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 1296#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1315#L25-9 assume true; 1328#L25-6 assume !!(f_~i~1 < 2); 1338#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 1343#L26-3 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 1322#L27-2 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27-2 1319#L27-3 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-3 1313#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1310#L36-4 [2018-11-10 00:59:49,836 INFO L795 eck$LassoCheckResult]: Loop: 1310#L36-4 assume true; 1311#L36-1 assume !!(g_~i~2 < 2); 1320#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 1325#L37-1 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1304#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 1310#L36-4 [2018-11-10 00:59:49,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash -988194973, now seen corresponding path program 1 times [2018-11-10 00:59:49,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:49,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:59:49,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 00:59:49,921 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:59:49,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash 106083347, now seen corresponding path program 2 times [2018-11-10 00:59:49,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:49,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 00:59:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:59:49,957 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-10 00:59:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:50,057 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-10 00:59:50,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 00:59:50,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 95 transitions. [2018-11-10 00:59:50,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2018-11-10 00:59:50,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 83 states and 92 transitions. [2018-11-10 00:59:50,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 00:59:50,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-10 00:59:50,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 92 transitions. [2018-11-10 00:59:50,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:50,060 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-11-10 00:59:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 92 transitions. [2018-11-10 00:59:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2018-11-10 00:59:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 00:59:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-10 00:59:50,065 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-10 00:59:50,065 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-10 00:59:50,065 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 00:59:50,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 65 transitions. [2018-11-10 00:59:50,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 00:59:50,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:50,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:50,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:50,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:50,067 INFO L793 eck$LassoCheckResult]: Stem: 1510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1483#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 1481#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 1476#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 1474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1475#L17-3 assume true; 1499#L17-1 assume !!(init_~i~0 < 2); 1471#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1469#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1470#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1507#L17-3 assume true; 1516#L17-1 assume !!(init_~i~0 < 2); 1520#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1519#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1518#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1517#L17-3 assume true; 1498#L17-1 assume !(init_~i~0 < 2); 1492#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1462#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1463#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1490#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1477#L25-4 assume true; 1478#L25-1 assume !!(f_~i~1 < 2); 1488#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 1493#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 1466#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 1464#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 1465#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1484#L25-9 assume true; 1495#L25-6 assume !!(f_~i~1 < 2); 1506#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 1512#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1503#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 1496#L25-9 assume true; 1497#L25-6 assume !(f_~i~1 < 2); 1482#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1479#L36-4 [2018-11-10 00:59:50,067 INFO L795 eck$LassoCheckResult]: Loop: 1479#L36-4 assume true; 1480#L36-1 assume !!(g_~i~2 < 2); 1489#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 1494#L37-1 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1473#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 1479#L36-4 [2018-11-10 00:59:50,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash -565441042, now seen corresponding path program 1 times [2018-11-10 00:59:50,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:50,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:50,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:50,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:50,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:50,116 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:50,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:50,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:50,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:59:50,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 00:59:50,182 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:59:50,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 106083347, now seen corresponding path program 3 times [2018-11-10 00:59:50,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:50,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:59:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:59:50,212 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 00:59:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:50,228 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-10 00:59:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:59:50,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 96 transitions. [2018-11-10 00:59:50,230 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2018-11-10 00:59:50,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 96 transitions. [2018-11-10 00:59:50,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-10 00:59:50,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-10 00:59:50,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 96 transitions. [2018-11-10 00:59:50,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:50,231 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-11-10 00:59:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 96 transitions. [2018-11-10 00:59:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-11-10 00:59:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 00:59:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-10 00:59:50,234 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-10 00:59:50,234 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-10 00:59:50,234 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 00:59:50,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 72 transitions. [2018-11-10 00:59:50,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 00:59:50,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:50,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:50,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:50,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:50,236 INFO L793 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1742#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 1740#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 1735#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 1733#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1734#L17-3 assume true; 1759#L17-1 assume !!(init_~i~0 < 2); 1729#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1730#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1781#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1779#L17-3 assume true; 1780#L17-1 assume !!(init_~i~0 < 2); 1782#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 1727#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 1728#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 1768#L17-3 assume true; 1758#L17-1 assume !(init_~i~0 < 2); 1751#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1720#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1721#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1749#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1736#L25-4 assume true; 1737#L25-1 assume !!(f_~i~1 < 2); 1747#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 1752#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 1724#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 1722#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 1723#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1743#L25-9 assume true; 1754#L25-6 assume !!(f_~i~1 < 2); 1784#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 1773#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1774#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 1755#L25-9 assume true; 1757#L25-6 assume !!(f_~i~1 < 2); 1766#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 1772#L26-3 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 1750#L27-2 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27-2 1746#L27-3 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-3 1741#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1738#L36-4 [2018-11-10 00:59:50,236 INFO L795 eck$LassoCheckResult]: Loop: 1738#L36-4 assume true; 1739#L36-1 assume !!(g_~i~2 < 2); 1748#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 1753#L37-1 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1732#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 1738#L36-4 [2018-11-10 00:59:50,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1620483224, now seen corresponding path program 1 times [2018-11-10 00:59:50,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:50,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:50,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:50,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:50,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash 106083347, now seen corresponding path program 4 times [2018-11-10 00:59:50,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:50,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:50,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:50,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:50,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1074944268, now seen corresponding path program 1 times [2018-11-10 00:59:50,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:50,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:50,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:50,481 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:50,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:50,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:50,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-10 00:59:50,568 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:59:50,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-10 00:59:50,576 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 00:59:50,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 00:59:50,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-11-10 00:59:50,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:50,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 27 [2018-11-10 00:59:50,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-11-10 00:59:50,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:50,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 27 [2018-11-10 00:59:50,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:18 [2018-11-10 00:59:50,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-11-10 00:59:50,673 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:59:50,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-11-10 00:59:50,680 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 00:59:50,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:50,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:32, output treesize:10 [2018-11-10 00:59:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:50,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:59:50,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2018-11-10 00:59:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 00:59:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-11-10 00:59:50,738 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. cyclomatic complexity: 11 Second operand 19 states. [2018-11-10 00:59:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:51,064 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-10 00:59:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 00:59:51,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 81 transitions. [2018-11-10 00:59:51,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 00:59:51,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 81 transitions. [2018-11-10 00:59:51,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-10 00:59:51,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 00:59:51,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 81 transitions. [2018-11-10 00:59:51,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:51,067 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-10 00:59:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 81 transitions. [2018-11-10 00:59:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-10 00:59:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 00:59:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-11-10 00:59:51,069 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-11-10 00:59:51,069 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-11-10 00:59:51,070 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 00:59:51,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 76 transitions. [2018-11-10 00:59:51,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 00:59:51,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:51,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:51,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:51,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:51,071 INFO L793 eck$LassoCheckResult]: Stem: 2084#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2055#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 2052#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 2047#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 2045#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 2046#L17-3 assume true; 2093#L17-1 assume !!(init_~i~0 < 2); 2042#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 2040#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 2041#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 2080#L17-3 assume true; 2069#L17-1 assume !!(init_~i~0 < 2); 2070#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 2100#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 2098#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 2096#L17-3 assume true; 2068#L17-1 assume !(init_~i~0 < 2); 2064#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 2033#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 2034#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 2062#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2048#L25-4 assume true; 2049#L25-1 assume !!(f_~i~1 < 2); 2059#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 2065#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 2037#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 2035#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 2036#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2056#L25-9 assume true; 2071#L25-6 assume !!(f_~i~1 < 2); 2082#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 2101#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 2078#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 2072#L25-9 assume true; 2074#L25-6 assume !!(f_~i~1 < 2); 2081#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 2086#L26-3 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 2063#L27-2 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27-2 2060#L27-3 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-3 2053#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 2050#L36-4 assume true; 2051#L36-1 assume !!(g_~i~2 < 2); 2061#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 2094#L37-1 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset; 2079#L39 [2018-11-10 00:59:51,072 INFO L795 eck$LassoCheckResult]: Loop: 2079#L39 SUMMARY for call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + g_~i~2 * 4, 4); srcloc: L39 2076#L39-1 assume g_#t~mem5 == 1; 2077#L39-3 havoc g_#t~mem5; 2043#L40 SUMMARY for call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + g_~i~2 * 4, 4); srcloc: L40 2044#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 2054#L36-4 assume true; 2095#L36-1 assume !!(g_~i~2 < 2); 2066#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 2067#L37-1 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset; 2079#L39 [2018-11-10 00:59:51,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1004506928, now seen corresponding path program 1 times [2018-11-10 00:59:51,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:51,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:51,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:51,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:51,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1764485394, now seen corresponding path program 1 times [2018-11-10 00:59:51,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:51,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash 629222559, now seen corresponding path program 1 times [2018-11-10 00:59:51,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:51,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:51,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:51,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 00:59:51,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:51,474 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:51,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:51,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-11-10 00:59:51,598 INFO L477 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 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 00:59:51,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:51,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:51,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:51,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 00:59:51,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-11-10 00:59:51,659 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 00:59:51,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:51,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:51,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:51,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-10 00:59:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 00:59:51,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:59:51,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 28 [2018-11-10 00:59:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 00:59:51,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-11-10 00:59:51,735 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. cyclomatic complexity: 11 Second operand 29 states. [2018-11-10 00:59:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:52,535 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-11-10 00:59:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 00:59:52,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 143 transitions. [2018-11-10 00:59:52,536 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 46 [2018-11-10 00:59:52,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 143 transitions. [2018-11-10 00:59:52,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2018-11-10 00:59:52,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2018-11-10 00:59:52,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 143 transitions. [2018-11-10 00:59:52,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:52,537 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-11-10 00:59:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 143 transitions. [2018-11-10 00:59:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2018-11-10 00:59:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 00:59:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-10 00:59:52,541 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-10 00:59:52,541 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-10 00:59:52,541 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 00:59:52,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 107 transitions. [2018-11-10 00:59:52,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2018-11-10 00:59:52,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:52,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:52,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:52,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:52,542 INFO L793 eck$LassoCheckResult]: Stem: 2518#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2484#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 2481#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 2476#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 2474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 2475#L17-3 assume true; 2527#L17-1 assume !!(init_~i~0 < 2); 2471#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 2469#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 2470#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 2528#L17-3 assume true; 2499#L17-1 assume !!(init_~i~0 < 2); 2500#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 2531#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 2511#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 2512#L17-3 assume true; 2498#L17-1 assume !(init_~i~0 < 2); 2495#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 2462#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 2463#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 2492#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2477#L25-4 assume true; 2478#L25-1 assume !!(f_~i~1 < 2); 2488#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 2496#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 2466#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 2464#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 2465#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2485#L25-9 assume true; 2501#L25-6 assume !!(f_~i~1 < 2); 2526#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 2521#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 2508#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 2509#L25-9 assume true; 2504#L25-6 assume !!(f_~i~1 < 2); 2515#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 2536#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 2535#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 2502#L25-9 assume true; 2503#L25-6 assume !(f_~i~1 < 2); 2482#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 2479#L36-4 assume true; 2480#L36-1 assume !!(g_~i~2 < 2); 2491#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 2497#L37-1 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset; 2510#L39 [2018-11-10 00:59:52,543 INFO L795 eck$LassoCheckResult]: Loop: 2510#L39 SUMMARY for call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + g_~i~2 * 4, 4); srcloc: L39 2506#L39-1 assume g_#t~mem5 == 1; 2507#L39-3 havoc g_#t~mem5; 2530#L40 SUMMARY for call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + g_~i~2 * 4, 4); srcloc: L40 2548#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 2546#L36-4 assume true; 2532#L36-1 assume !!(g_~i~2 < 2); 2533#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 2550#L37-1 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset; 2510#L39 [2018-11-10 00:59:52,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 924661201, now seen corresponding path program 1 times [2018-11-10 00:59:52,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:52,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 00:59:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:52,727 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:52,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:52,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:52,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-11-10 00:59:52,774 INFO L477 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 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 00:59:52,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-11-10 00:59:52,781 INFO L477 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 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 00:59:52,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 00:59:52,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 20 [2018-11-10 00:59:52,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:52,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 31 [2018-11-10 00:59:52,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 20 [2018-11-10 00:59:52,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:59:52,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 31 [2018-11-10 00:59:52,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:19 [2018-11-10 00:59:52,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-11-10 00:59:52,850 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 00:59:52,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-11-10 00:59:52,858 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 00:59:52,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 00:59:52,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-11-10 00:59:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:59:52,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-10 00:59:52,889 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:59:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1764485394, now seen corresponding path program 2 times [2018-11-10 00:59:52,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 00:59:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-10 00:59:52,938 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. cyclomatic complexity: 13 Second operand 16 states. [2018-11-10 00:59:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:53,111 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-10 00:59:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 00:59:53,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 76 transitions. [2018-11-10 00:59:53,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 00:59:53,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 73 transitions. [2018-11-10 00:59:53,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 00:59:53,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-10 00:59:53,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 73 transitions. [2018-11-10 00:59:53,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:59:53,113 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-10 00:59:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 73 transitions. [2018-11-10 00:59:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-11-10 00:59:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 00:59:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-10 00:59:53,114 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-10 00:59:53,114 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-10 00:59:53,114 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 00:59:53,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 69 transitions. [2018-11-10 00:59:53,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 00:59:53,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:59:53,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:59:53,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:59:53,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:59:53,115 INFO L793 eck$LassoCheckResult]: Stem: 2847#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2822#L12 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4); srcloc: L12 2819#L12-1 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4); srcloc: L12-1 2814#L12-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value] && #memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]];assume { :end_inline_write~unchecked~int } true;~counter~0 := 1; 2812#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 2813#L17-3 assume true; 2853#L17-1 assume !!(init_~i~0 < 2); 2865#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 2864#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 2843#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 2844#L17-3 assume true; 2835#L17-1 assume !!(init_~i~0 < 2); 2809#L18 SUMMARY for call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + init_~i~0 * 4, 4); srcloc: L18 2807#L18-1 SUMMARY for call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + init_~i~0 * 4, 4); srcloc: L18-1 2808#L19 init_#t~post0 := init_~i~0;init_~i~0 := init_#t~post0 + 1;havoc init_#t~post0; 2863#L17-3 assume true; 2834#L17-1 assume !(init_~i~0 < 2); 2831#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 2800#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_malloc } true;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := malloc_#t~post6 + 1;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 2801#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 2829#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2815#L25-4 assume true; 2816#L25-1 assume !!(f_~i~1 < 2); 2826#L26 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26 2832#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 2804#L27 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27 2802#L27-1 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-1 2803#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2823#L25-9 assume true; 2862#L25-6 assume !!(f_~i~1 < 2); 2861#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 2860#L26-3 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 2841#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := f_#t~post1 + 1;havoc f_#t~post1; 2836#L25-9 assume true; 2837#L25-6 assume !!(f_~i~1 < 2); 2845#L26-2 SUMMARY for call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L26-2 2849#L26-3 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset; 2830#L27-2 SUMMARY for call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + f_~i~1 * 4, 4); srcloc: L27-2 2827#L27-3 SUMMARY for call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + f_~i~1 * 4, 4); srcloc: L27-3 2820#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 2821#L36-4 assume true; 2859#L36-1 assume !!(g_~i~2 < 2); 2857#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 2855#L37-1 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset; 2842#L39 SUMMARY for call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + g_~i~2 * 4, 4); srcloc: L39 2839#L39-1 assume g_#t~mem5 == 1; 2840#L39-3 havoc g_#t~mem5; 2810#L40 SUMMARY for call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + g_~i~2 * 4, 4); srcloc: L40 2811#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 2817#L36-4 assume true; 2818#L36-1 assume !!(g_~i~2 < 2); 2828#L37 [2018-11-10 00:59:53,115 INFO L795 eck$LassoCheckResult]: Loop: 2828#L37 SUMMARY for call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + g_~i~2 * 4, 4); srcloc: L37 2833#L37-1 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 2854#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := g_#t~post3 + 1;havoc g_#t~post3; 2858#L36-4 assume true; 2856#L36-1 assume !!(g_~i~2 < 2); 2828#L37 [2018-11-10 00:59:53,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash 831938748, now seen corresponding path program 2 times [2018-11-10 00:59:53,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:53,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:53,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:53,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash 112208957, now seen corresponding path program 5 times [2018-11-10 00:59:53,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:53,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:53,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:59:53,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:59:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1932527714, now seen corresponding path program 1 times [2018-11-10 00:59:53,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:59:53,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:59:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:53,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:59:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:59:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 00:59:53,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:59:53,204 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe5c586-afb6-4305-ad66-6f20c5a044b6/bin-2019/uautomizer/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 [2018-11-10 00:59:53,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:59:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:53,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:59:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 00:59:53,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:59:53,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 00:59:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 00:59:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:59:53,327 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 00:59:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:59:53,375 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-10 00:59:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:59:53,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2018-11-10 00:59:53,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:59:53,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-11-10 00:59:53,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 00:59:53,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 00:59:53,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 00:59:53,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:59:53,377 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:59:53,377 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:59:53,377 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:59:53,377 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 00:59:53,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:59:53,377 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:59:53,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 00:59:53,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:59:53 BoogieIcfgContainer [2018-11-10 00:59:53,382 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:59:53,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:59:53,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:59:53,383 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:59:53,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:40" (3/4) ... [2018-11-10 00:59:53,386 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:59:53,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:59:53,387 INFO L168 Benchmark]: Toolchain (without parser) took 13525.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.6 MB). Free memory was 953.8 MB in the beginning and 967.5 MB in the end (delta: -13.7 MB). Peak memory consumption was 343.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:59:53,387 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:59:53,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.05 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:59:53,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.50 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:59:53,388 INFO L168 Benchmark]: Boogie Preprocessor took 22.41 ms. Allocated memory is still 1.0 GB. Free memory was 940.3 MB in the beginning and 937.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:59:53,389 INFO L168 Benchmark]: RCFGBuilder took 337.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 00:59:53,389 INFO L168 Benchmark]: BuchiAutomizer took 12947.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 967.5 MB in the end (delta: 170.3 MB). Peak memory consumption was 360.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:59:53,389 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 1.4 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:59:53,392 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.05 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.50 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.41 ms. Allocated memory is still 1.0 GB. Free memory was 940.3 MB in the beginning and 937.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12947.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 967.5 MB in the end (delta: 170.3 MB). Peak memory consumption was 360.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.4 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 3 and consists of 5 locations. One deterministic module has affine ranking function 3 * unknown-#length-unknown[pp] + -8 * i and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 10.7s. Construction of modules took 0.7s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 160 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 551 SDtfs, 1497 SDslu, 1821 SDs, 0 SdLazy, 1483 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax100 hnf99 lsp87 ukn59 mio100 lsp38 div100 bol100 ite100 ukn100 eq157 hnf89 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 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! Received shutdown request...