./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/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 64bit --witnessprinter.graph.data.programhash 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:47:59,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:47:59,533 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:47:59,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:47:59,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:47:59,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:47:59,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:47:59,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:47:59,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:47:59,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:47:59,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:47:59,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:47:59,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:47:59,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:47:59,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:47:59,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:47:59,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:47:59,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:47:59,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:47:59,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:47:59,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:47:59,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:47:59,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:47:59,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:47:59,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:47:59,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:47:59,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:47:59,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:47:59,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:47:59,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:47:59,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:47:59,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:47:59,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:47:59,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:47:59,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:47:59,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:47:59,559 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 10:47:59,566 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:47:59,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:47:59,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:47:59,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:47:59,568 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:47:59,568 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:47:59,568 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:47:59,568 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:47:59,568 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:47:59,568 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:47:59,569 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:47:59,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:47:59,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:47:59,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:47:59,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:47:59,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:47:59,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:47:59,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:47:59,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:47:59,570 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:47:59,570 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:47:59,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:47:59,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:47:59,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:47:59,571 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:47:59,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:47:59,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:47:59,571 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:47:59,572 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:47:59,572 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_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be [2018-11-18 10:47:59,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:47:59,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:47:59,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:47:59,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:47:59,603 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:47:59,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-11-18 10:47:59,640 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/data/72f80e7b0/5272e0df94ed4a1a86d38bb6e6b10bd2/FLAGe9150c30e [2018-11-18 10:48:00,068 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:48:00,069 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-11-18 10:48:00,076 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/data/72f80e7b0/5272e0df94ed4a1a86d38bb6e6b10bd2/FLAGe9150c30e [2018-11-18 10:48:00,084 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/bin-2019/uautomizer/data/72f80e7b0/5272e0df94ed4a1a86d38bb6e6b10bd2 [2018-11-18 10:48:00,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:48:00,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:48:00,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:48:00,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:48:00,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:48:00,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c938308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00, skipping insertion in model container [2018-11-18 10:48:00,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:48:00,127 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:48:00,306 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:48:00,315 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:48:00,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:48:00,406 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:48:00,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00 WrapperNode [2018-11-18 10:48:00,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:48:00,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:48:00,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:48:00,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:48:00,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:48:00,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:48:00,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:48:00,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:48:00,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... [2018-11-18 10:48:00,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:48:00,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:48:00,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:48:00,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:48:00,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/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-18 10:48:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:48:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:48:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:48:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:48:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:48:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:48:00,695 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:48:00,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:00 BoogieIcfgContainer [2018-11-18 10:48:00,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:48:00,695 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:48:00,696 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:48:00,698 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:48:00,699 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:48:00,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:48:00" (1/3) ... [2018-11-18 10:48:00,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@452ac69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:48:00, skipping insertion in model container [2018-11-18 10:48:00,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:48:00,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:00" (2/3) ... [2018-11-18 10:48:00,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@452ac69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:48:00, skipping insertion in model container [2018-11-18 10:48:00,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:48:00,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:00" (3/3) ... [2018-11-18 10:48:00,702 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-alloca_true-termination.c.i [2018-11-18 10:48:00,749 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:48:00,749 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:48:00,750 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:48:00,750 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:48:00,750 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:48:00,750 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:48:00,750 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:48:00,750 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:48:00,750 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:48:00,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 10:48:00,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 10:48:00,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:00,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:00,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:48:00,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:00,789 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:48:00,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 10:48:00,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 10:48:00,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:00,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:00,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:48:00,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:00,796 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 5#L559-2true [2018-11-18 10:48:00,797 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true assume true; 14#L550-1true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3#L550-2true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-4true assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551true assume main_#t~mem7 > 0;havoc main_#t~mem7; 10#L552true assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 5#L559-2true [2018-11-18 10:48:00,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:48:00,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:00,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:00,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:00,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:00,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1067013422, now seen corresponding path program 1 times [2018-11-18 10:48:00,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:00,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:00,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:00,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:00,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:00,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash 147062640, now seen corresponding path program 1 times [2018-11-18 10:48:00,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:00,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:00,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:01,081 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-11-18 10:48:01,233 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:01,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:01,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:01,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:01,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:01,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:01,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:01,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:01,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 10:48:01,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:01,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:01,254 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-18 10:48:01,259 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-18 10:48:01,262 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-18 10:48:01,265 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-18 10:48:01,268 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-18 10:48:01,270 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-18 10:48:01,272 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-18 10:48:01,423 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-18 10:48:01,428 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-18 10:48:01,429 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-18 10:48:01,431 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-18 10:48:01,432 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-18 10:48:01,433 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-18 10:48:01,439 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-18 10:48:01,441 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-18 10:48:01,447 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-18 10:48:01,448 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-18 10:48:01,451 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-18 10:48:01,712 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:01,718 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:01,720 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-18 10:48:01,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:01,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:01,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:01,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,725 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-18 10:48:01,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:01,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,730 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-18 10:48:01,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:01,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:01,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:01,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,733 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-18 10:48:01,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:01,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,738 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-18 10:48:01,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:01,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:01,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:01,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,741 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-18 10:48:01,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:01,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,747 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-18 10:48:01,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,747 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:01,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,750 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:01,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,760 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-18 10:48:01,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:01,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:01,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:01,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,766 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-18 10:48:01,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,766 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:01,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:01,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,778 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-18 10:48:01,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:01,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,804 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-18 10:48:01,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:01,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:01,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:01,814 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-18 10:48:01,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:01,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:01,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:01,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:01,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:01,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:01,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:01,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:01,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:48:01,822 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:48:01,824 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:01,824 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:48:01,824 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:01,825 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-18 10:48:01,863 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:01,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:01,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:01,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:01,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:01,941 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-18 10:48:01,950 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-18 10:48:01,951 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 5 states. [2018-11-18 10:48:02,050 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 5 states. Result 59 states and 77 transitions. Complement of second has 12 states. [2018-11-18 10:48:02,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 10:48:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:48:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-18 10:48:02,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:48:02,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:02,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 10:48:02,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:02,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-18 10:48:02,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:02,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 77 transitions. [2018-11-18 10:48:02,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:48:02,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 33 states and 48 transitions. [2018-11-18 10:48:02,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 10:48:02,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 10:48:02,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2018-11-18 10:48:02,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:02,063 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2018-11-18 10:48:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2018-11-18 10:48:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-11-18 10:48:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 10:48:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-11-18 10:48:02,082 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 10:48:02,082 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 10:48:02,082 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:48:02,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2018-11-18 10:48:02,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:48:02,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:02,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:02,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 10:48:02,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:02,083 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 186#L559-2 assume true; 193#L550-1 [2018-11-18 10:48:02,084 INFO L796 eck$LassoCheckResult]: Loop: 193#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 181#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 182#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 195#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 188#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 189#L559-2 assume true; 193#L550-1 [2018-11-18 10:48:02,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 10:48:02,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1127283634, now seen corresponding path program 1 times [2018-11-18 10:48:02,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash 263974612, now seen corresponding path program 1 times [2018-11-18 10:48:02,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,276 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:02,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:02,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:02,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:02,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:02,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:02,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:02,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:02,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 10:48:02,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:02,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:02,279 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-18 10:48:02,280 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-18 10:48:02,282 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-18 10:48:02,283 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-18 10:48:02,284 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-18 10:48:02,286 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-18 10:48:02,287 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-18 10:48:02,288 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-18 10:48:02,289 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-18 10:48:02,290 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-18 10:48:02,291 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-18 10:48:02,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-18 10:48:02,402 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-18 10:48:02,403 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-18 10:48:02,405 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-18 10:48:02,407 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-18 10:48:02,408 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-18 10:48:02,410 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-18 10:48:02,412 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-18 10:48:02,619 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:02,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:02,620 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-18 10:48:02,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,622 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-18 10:48:02,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:02,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:02,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,625 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-18 10:48:02,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:02,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:02,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,629 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-18 10:48:02,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,631 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-18 10:48:02,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:02,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:02,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,635 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-18 10:48:02,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,636 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-18 10:48:02,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,638 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-18 10:48:02,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,640 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-18 10:48:02,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,642 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-18 10:48:02,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:02,644 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-18 10:48:02,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:02,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:02,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:02,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:02,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:02,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:02,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:02,647 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:02,648 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:48:02,648 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:48:02,649 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:02,649 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:48:02,649 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:02,649 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-18 10:48:02,678 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:02,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:02,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:02,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:02,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:02,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:02,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-18 10:48:02,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:02,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-18 10:48:02,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:02,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:02,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:02,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-18 10:48:02,790 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-18 10:48:02,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:48:02,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-18 10:48:02,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 70 transitions. Complement of second has 9 states. [2018-11-18 10:48:02,835 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-18 10:48:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:48:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 10:48:02,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 10:48:02,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:02,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-18 10:48:02,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:02,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-18 10:48:02,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:02,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 70 transitions. [2018-11-18 10:48:02,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:48:02,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 68 transitions. [2018-11-18 10:48:02,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 10:48:02,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 10:48:02,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 68 transitions. [2018-11-18 10:48:02,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:02,839 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 68 transitions. [2018-11-18 10:48:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 68 transitions. [2018-11-18 10:48:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 10:48:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 10:48:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2018-11-18 10:48:02,842 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 64 transitions. [2018-11-18 10:48:02,842 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 64 transitions. [2018-11-18 10:48:02,842 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:48:02,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 64 transitions. [2018-11-18 10:48:02,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:48:02,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:02,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:02,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:02,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:02,844 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 359#L559-2 assume true; 365#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 375#L550-2 assume !main_#t~short6; 369#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 370#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 372#L559 [2018-11-18 10:48:02,844 INFO L796 eck$LassoCheckResult]: Loop: 372#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 377#L559-2 assume true; 384#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 354#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 355#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 378#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 372#L559 [2018-11-18 10:48:02,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1805861203, now seen corresponding path program 1 times [2018-11-18 10:48:02,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:02,867 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-18 10:48:02,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:02,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:02,869 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:48:02,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1838056308, now seen corresponding path program 1 times [2018-11-18 10:48:02,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:02,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:02,959 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-18 10:48:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:02,965 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-18 10:48:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:02,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2018-11-18 10:48:02,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:48:02,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 57 transitions. [2018-11-18 10:48:02,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 10:48:02,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 10:48:02,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2018-11-18 10:48:02,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:02,968 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-18 10:48:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2018-11-18 10:48:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-18 10:48:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 10:48:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-11-18 10:48:02,970 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-18 10:48:02,970 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-18 10:48:02,970 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:48:02,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-11-18 10:48:02,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:48:02,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:02,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:02,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:02,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:02,971 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 459#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 460#L559-2 assume true; 487#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 485#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 473#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 474#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 476#L559 [2018-11-18 10:48:02,971 INFO L796 eck$LassoCheckResult]: Loop: 476#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 481#L559-2 assume true; 478#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 479#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 495#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 482#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 476#L559 [2018-11-18 10:48:02,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859281, now seen corresponding path program 1 times [2018-11-18 10:48:02,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1838056308, now seen corresponding path program 2 times [2018-11-18 10:48:02,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1858920124, now seen corresponding path program 1 times [2018-11-18 10:48:02,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,175 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:03,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:03,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:03,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:03,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:03,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:03,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:03,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:03,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 10:48:03,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:03,176 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:03,181 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-18 10:48:03,182 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-18 10:48:03,184 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-18 10:48:03,184 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-18 10:48:03,185 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-18 10:48:03,187 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-18 10:48:03,187 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-18 10:48:03,188 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-18 10:48:03,189 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-18 10:48:03,190 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-18 10:48:03,192 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-18 10:48:03,193 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-18 10:48:03,194 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-18 10:48:03,195 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-18 10:48:03,196 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-18 10:48:03,326 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-18 10:48:03,328 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-18 10:48:03,330 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-18 10:48:03,331 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-18 10:48:03,333 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-18 10:48:03,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:03,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:03,509 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-18 10:48:03,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,514 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-18 10:48:03,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,519 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-18 10:48:03,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,521 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-18 10:48:03,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,522 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-18 10:48:03,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,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-18 10:48:03,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,533 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-18 10:48:03,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,535 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-18 10:48:03,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,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-18 10:48:03,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,541 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-18 10:48:03,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,547 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-18 10:48:03,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,548 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-18 10:48:03,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,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-18 10:48:03,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,555 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:48:03,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,555 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:48:03,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,557 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-18 10:48:03,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:03,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:03,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:03,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,561 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-18 10:48:03,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,565 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-18 10:48:03,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,571 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-18 10:48:03,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,576 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-18 10:48:03,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,577 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:03,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,578 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:03,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,582 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-18 10:48:03,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:03,591 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-18 10:48:03,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:03,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:03,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:03,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:03,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:03,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:03,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:03,607 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:48:03,607 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:48:03,608 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:03,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:03,610 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:03,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-18 10:48:03,651 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:03,656 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:03,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:03,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:03,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:03,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:03,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 10:48:03,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:03,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-18 10:48:03,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:03,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:03,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:03,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-18 10:48:03,707 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-18 10:48:03,707 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-18 10:48:03,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-18 10:48:03,751 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 76 states and 96 transitions. Complement of second has 9 states. [2018-11-18 10:48:03,752 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-18 10:48:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:48:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-18 10:48:03,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 10:48:03,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:03,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:03,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:03,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-18 10:48:03,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:03,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2018-11-18 10:48:03,754 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-18 10:48:03,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 95 transitions. [2018-11-18 10:48:03,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 10:48:03,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-18 10:48:03,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 95 transitions. [2018-11-18 10:48:03,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:03,756 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-11-18 10:48:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 95 transitions. [2018-11-18 10:48:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-18 10:48:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 10:48:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-18 10:48:03,760 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-18 10:48:03,760 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-18 10:48:03,760 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:48:03,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 91 transitions. [2018-11-18 10:48:03,761 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-18 10:48:03,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:03,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:03,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:03,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:48:03,762 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 697#L559-2 assume true; 703#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 739#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 740#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 730#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 727#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 728#L559-2 [2018-11-18 10:48:03,762 INFO L796 eck$LassoCheckResult]: Loop: 728#L559-2 assume true; 738#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 737#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 736#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 710#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 711#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 744#L559-2 assume true; 743#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 692#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 693#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 732#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 733#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 728#L559-2 [2018-11-18 10:48:03,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 147062896, now seen corresponding path program 2 times [2018-11-18 10:48:03,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:03,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:03,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash -798766051, now seen corresponding path program 1 times [2018-11-18 10:48:03,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:03,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:03,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:03,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:48:03,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:48:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:48:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:48:03,898 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-18 10:48:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:03,966 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2018-11-18 10:48:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:48:03,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 118 transitions. [2018-11-18 10:48:03,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 10:48:03,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 81 states and 97 transitions. [2018-11-18 10:48:03,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-18 10:48:03,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-18 10:48:03,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 97 transitions. [2018-11-18 10:48:03,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:03,971 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 97 transitions. [2018-11-18 10:48:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 97 transitions. [2018-11-18 10:48:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2018-11-18 10:48:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 10:48:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-11-18 10:48:03,974 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-18 10:48:03,974 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-18 10:48:03,974 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:48:03,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 68 transitions. [2018-11-18 10:48:03,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 10:48:03,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:03,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:03,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:03,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:03,980 INFO L794 eck$LassoCheckResult]: Stem: 884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 879#L559-2 assume true; 923#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 912#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 913#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 906#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 904#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 889#L559-2 [2018-11-18 10:48:03,980 INFO L796 eck$LassoCheckResult]: Loop: 889#L559-2 assume true; 890#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 880#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 881#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 893#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 895#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 889#L559-2 [2018-11-18 10:48:03,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 147062896, now seen corresponding path program 3 times [2018-11-18 10:48:03,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:03,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:03,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:03,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:03,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1067013424, now seen corresponding path program 2 times [2018-11-18 10:48:03,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:03,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:03,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:03,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1791949217, now seen corresponding path program 1 times [2018-11-18 10:48:03,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:04,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:04,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/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-18 10:48:04,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:04,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:04,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:04,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-18 10:48:04,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:04,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-11-18 10:48:04,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:04,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:04,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:04,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2018-11-18 10:48:04,151 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 23 treesize of output 17 [2018-11-18 10:48:04,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-18 10:48:04,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:04,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:04,159 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-18 10:48:04,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-11-18 10:48:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:04,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:48:04,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-18 10:48:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:48:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:48:04,279 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. cyclomatic complexity: 18 Second operand 10 states. [2018-11-18 10:48:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:04,339 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-18 10:48:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:48:04,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2018-11-18 10:48:04,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-18 10:48:04,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 71 transitions. [2018-11-18 10:48:04,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 10:48:04,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 10:48:04,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 71 transitions. [2018-11-18 10:48:04,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:04,342 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-18 10:48:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 71 transitions. [2018-11-18 10:48:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-18 10:48:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 10:48:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-18 10:48:04,345 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-18 10:48:04,345 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-18 10:48:04,345 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:48:04,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 71 transitions. [2018-11-18 10:48:04,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-18 10:48:04,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:04,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:04,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:04,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:04,346 INFO L794 eck$LassoCheckResult]: Stem: 1062#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1061#L559-2 assume true; 1074#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1075#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1113#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1072#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1073#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1079#L559-2 [2018-11-18 10:48:04,346 INFO L796 eck$LassoCheckResult]: Loop: 1079#L559-2 assume true; 1096#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1093#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1090#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1086#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1077#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1079#L559-2 [2018-11-18 10:48:04,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 147062898, now seen corresponding path program 1 times [2018-11-18 10:48:04,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:04,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:04,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1067013680, now seen corresponding path program 1 times [2018-11-18 10:48:04,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:04,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:04,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash -16941599, now seen corresponding path program 2 times [2018-11-18 10:48:04,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:04,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:04,650 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-11-18 10:48:04,708 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:04,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:04,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:04,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:04,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:04,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:04,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:04,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:04,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 10:48:04,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:04,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:04,711 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-18 10:48:04,839 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-18 10:48:04,840 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-18 10:48:04,841 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-18 10:48:04,843 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-18 10:48:04,844 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-18 10:48:04,844 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-18 10:48:04,846 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-18 10:48:04,848 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-18 10:48:04,850 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-18 10:48:04,851 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-18 10:48:04,852 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-18 10:48:04,853 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-18 10:48:04,855 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-18 10:48:04,856 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-18 10:48:04,857 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-18 10:48:04,858 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-18 10:48:04,859 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-18 10:48:05,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:05,022 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:05,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:48:05,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,027 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-18 10:48:05,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,036 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-18 10:48:05,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:05,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:05,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,041 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-18 10:48:05,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,041 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:05,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,042 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:05,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,046 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-18 10:48:05,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,048 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-18 10:48:05,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:48:05,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:05,062 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:48:05,062 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:48:05,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:05,063 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:05,063 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:05,063 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-18 10:48:05,107 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:05,108 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:05,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:05,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:05,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:05,163 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-18 10:48:05,163 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:48:05,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 71 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-18 10:48:05,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 71 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 94 states and 111 transitions. Complement of second has 11 states. [2018-11-18 10:48:05,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 10:48:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:48:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-18 10:48:05,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 10:48:05,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:05,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-18 10:48:05,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:05,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-18 10:48:05,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:05,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 111 transitions. [2018-11-18 10:48:05,206 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2018-11-18 10:48:05,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 88 states and 104 transitions. [2018-11-18 10:48:05,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-18 10:48:05,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-18 10:48:05,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 104 transitions. [2018-11-18 10:48:05,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:05,207 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 104 transitions. [2018-11-18 10:48:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 104 transitions. [2018-11-18 10:48:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-11-18 10:48:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 10:48:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-11-18 10:48:05,210 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-11-18 10:48:05,210 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-11-18 10:48:05,211 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:48:05,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 93 transitions. [2018-11-18 10:48:05,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:48:05,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:05,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:05,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 10:48:05,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:05,212 INFO L794 eck$LassoCheckResult]: Stem: 1334#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1332#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1333#L559-2 assume true; 1379#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1376#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1373#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1370#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1368#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1365#L559-2 assume true; 1366#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1389#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1396#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1395#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1357#L552 [2018-11-18 10:48:05,212 INFO L796 eck$LassoCheckResult]: Loop: 1357#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 1339#L559-2 assume true; 1340#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1328#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1329#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1343#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1357#L552 [2018-11-18 10:48:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1801661830, now seen corresponding path program 1 times [2018-11-18 10:48:05,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:05,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:05,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:05,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:05,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1666281394, now seen corresponding path program 3 times [2018-11-18 10:48:05,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:05,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:05,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:05,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash -262487189, now seen corresponding path program 1 times [2018-11-18 10:48:05,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:05,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:05,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:05,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:05,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:05,469 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-11-18 10:48:05,504 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:05,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:05,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:05,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:05,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:05,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:05,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:05,505 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:05,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-18 10:48:05,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:05,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:05,507 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-18 10:48:05,511 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-18 10:48:05,513 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-18 10:48:05,515 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-18 10:48:05,518 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-18 10:48:05,519 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-18 10:48:05,521 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-18 10:48:05,522 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-18 10:48:05,523 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-18 10:48:05,636 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-18 10:48:05,638 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-18 10:48:05,640 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-18 10:48:05,641 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-18 10:48:05,642 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-18 10:48:05,644 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-18 10:48:05,645 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-18 10:48:05,647 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-18 10:48:05,647 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-18 10:48:05,649 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-18 10:48:05,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:05,811 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:05,811 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-18 10:48:05,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:05,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:05,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:05,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,816 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-18 10:48:05,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:05,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:05,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:05,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,817 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-18 10:48:05,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,819 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-18 10:48:05,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,822 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-18 10:48:05,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:05,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:05,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:05,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,823 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-18 10:48:05,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:05,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:05,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:05,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,825 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-18 10:48:05,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:05,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:05,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:05,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,826 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-18 10:48:05,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:05,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:05,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:05,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,828 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-18 10:48:05,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,828 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:05,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,829 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:05,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,832 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-18 10:48:05,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,836 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-18 10:48:05,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,841 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-18 10:48:05,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,841 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:05,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,842 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:05,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:05,845 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-18 10:48:05,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:05,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:05,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:05,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:05,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:05,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:05,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:05,854 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:48:05,854 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:48:05,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:05,854 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:05,855 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:05,855 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2018-11-18 10:48:05,897 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:05,898 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:05,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:05,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:05,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:05,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:05,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:48:05,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:05,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 10:48:05,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:05,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:05,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:05,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:48:05,954 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-18 10:48:05,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:48:05,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 93 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-18 10:48:05,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 93 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 134 states and 159 transitions. Complement of second has 9 states. [2018-11-18 10:48:05,985 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-18 10:48:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:48:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-18 10:48:05,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:05,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:05,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 10:48:05,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:05,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-18 10:48:05,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:05,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 159 transitions. [2018-11-18 10:48:05,987 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2018-11-18 10:48:05,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 120 states and 143 transitions. [2018-11-18 10:48:05,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2018-11-18 10:48:05,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-18 10:48:05,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 143 transitions. [2018-11-18 10:48:05,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:05,989 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 143 transitions. [2018-11-18 10:48:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 143 transitions. [2018-11-18 10:48:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-11-18 10:48:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 10:48:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2018-11-18 10:48:06,000 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 128 transitions. [2018-11-18 10:48:06,000 INFO L608 BuchiCegarLoop]: Abstraction has 105 states and 128 transitions. [2018-11-18 10:48:06,000 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:48:06,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 128 transitions. [2018-11-18 10:48:06,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:48:06,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:06,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:06,001 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-11-18 10:48:06,001 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:06,001 INFO L794 eck$LassoCheckResult]: Stem: 1676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1675#L559-2 assume true; 1728#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1672#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1673#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1686#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1688#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1744#L559-2 assume true; 1743#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1742#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1741#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1740#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1677#L552 [2018-11-18 10:48:06,002 INFO L796 eck$LassoCheckResult]: Loop: 1677#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 1678#L559-2 assume true; 1761#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1762#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1770#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1768#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1677#L552 [2018-11-18 10:48:06,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -598048196, now seen corresponding path program 2 times [2018-11-18 10:48:06,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:06,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1666281394, now seen corresponding path program 4 times [2018-11-18 10:48:06,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:06,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 793909677, now seen corresponding path program 1 times [2018-11-18 10:48:06,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:06,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,269 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 89 [2018-11-18 10:48:06,310 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:06,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:06,310 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:06,310 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:06,310 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:06,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:06,310 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:06,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:06,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-18 10:48:06,310 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:06,310 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:06,312 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-18 10:48:06,316 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-18 10:48:06,318 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-18 10:48:06,434 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-18 10:48:06,436 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-18 10:48:06,437 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-18 10:48:06,437 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-18 10:48:06,438 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-18 10:48:06,439 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-18 10:48:06,440 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-18 10:48:06,441 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-18 10:48:06,442 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-18 10:48:06,444 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-18 10:48:06,444 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-18 10:48:06,445 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-18 10:48:06,446 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-18 10:48:06,447 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-18 10:48:06,449 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-18 10:48:06,450 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-18 10:48:06,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:06,610 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:06,610 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-18 10:48:06,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:06,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:06,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:06,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:06,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:06,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:06,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:06,612 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-18 10:48:06,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:06,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:06,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:06,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:06,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:06,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:06,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:06,615 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-18 10:48:06,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:06,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:06,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:06,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:06,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:06,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:06,619 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:06,623 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:48:06,623 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:48:06,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:06,624 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:06,624 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:06,624 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-18 10:48:06,654 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:06,655 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:06,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:06,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:06,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:06,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:06,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:48:06,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:06,682 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 10:48:06,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:48:06,706 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-18 10:48:06,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:48:06,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 128 transitions. cyclomatic complexity: 33 Second operand 5 states. [2018-11-18 10:48:06,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 128 transitions. cyclomatic complexity: 33. Second operand 5 states. Result 136 states and 161 transitions. Complement of second has 9 states. [2018-11-18 10:48:06,726 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-18 10:48:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:48:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-18 10:48:06,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:06,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:06,726 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:48:06,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:06,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:06,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:06,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:06,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:48:06,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:06,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 10:48:06,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:48:06,777 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-18 10:48:06,777 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:48:06,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 128 transitions. cyclomatic complexity: 33 Second operand 5 states. [2018-11-18 10:48:06,798 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 128 transitions. cyclomatic complexity: 33. Second operand 5 states. Result 132 states and 156 transitions. Complement of second has 9 states. [2018-11-18 10:48:06,798 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-18 10:48:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:48:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-18 10:48:06,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:06,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:06,799 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:48:06,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:06,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:06,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:06,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:06,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:48:06,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:06,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 10:48:06,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:06,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:48:06,852 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-18 10:48:06,852 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:48:06,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 128 transitions. cyclomatic complexity: 33 Second operand 5 states. [2018-11-18 10:48:06,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 128 transitions. cyclomatic complexity: 33. Second operand 5 states. Result 154 states and 184 transitions. Complement of second has 8 states. [2018-11-18 10:48:06,870 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-18 10:48:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:48:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 10:48:06,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:06,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:06,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 10:48:06,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:06,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-18 10:48:06,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:06,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 184 transitions. [2018-11-18 10:48:06,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2018-11-18 10:48:06,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 116 states and 140 transitions. [2018-11-18 10:48:06,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-18 10:48:06,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 10:48:06,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 140 transitions. [2018-11-18 10:48:06,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:06,876 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 140 transitions. [2018-11-18 10:48:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 140 transitions. [2018-11-18 10:48:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2018-11-18 10:48:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 10:48:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-18 10:48:06,879 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-18 10:48:06,879 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-18 10:48:06,879 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:48:06,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 91 transitions. [2018-11-18 10:48:06,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 10:48:06,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:06,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:06,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 10:48:06,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:06,883 INFO L794 eck$LassoCheckResult]: Stem: 2474#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2473#L559-2 assume true; 2480#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2488#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2520#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2519#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2518#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 2493#L559-2 assume true; 2507#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2506#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2504#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2505#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 2499#L552 [2018-11-18 10:48:06,884 INFO L796 eck$LassoCheckResult]: Loop: 2499#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 2476#L559-2 assume true; 2510#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2526#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2524#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2498#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 2499#L552 [2018-11-18 10:48:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1801661830, now seen corresponding path program 2 times [2018-11-18 10:48:06,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:06,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:06,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1609023092, now seen corresponding path program 2 times [2018-11-18 10:48:06,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:06,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:06,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:06,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -319745491, now seen corresponding path program 1 times [2018-11-18 10:48:06,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:07,176 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-11-18 10:48:07,212 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:07,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:07,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:07,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:07,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:07,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:07,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:07,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:07,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-18 10:48:07,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:07,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:07,214 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-18 10:48:07,216 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-18 10:48:07,217 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-18 10:48:07,218 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-18 10:48:07,219 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-18 10:48:07,221 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-18 10:48:07,221 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-18 10:48:07,222 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-18 10:48:07,223 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-18 10:48:07,224 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-18 10:48:07,225 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-18 10:48:07,226 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-18 10:48:07,227 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-18 10:48:07,228 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-18 10:48:07,228 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-18 10:48:07,229 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-18 10:48:07,231 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-18 10:48:07,324 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-18 10:48:07,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:07,473 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:07,473 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-18 10:48:07,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,476 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-18 10:48:07,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,477 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-18 10:48:07,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,478 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-18 10:48:07,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,481 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-18 10:48:07,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,483 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-18 10:48:07,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,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-18 10:48:07,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,486 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-18 10:48:07,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,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-18 10:48:07,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,488 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-18 10:48:07,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,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-18 10:48:07,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,492 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-18 10:48:07,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,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-18 10:48:07,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,495 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-18 10:48:07,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,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-18 10:48:07,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:07,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:07,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:07,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,497 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-18 10:48:07,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,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-18 10:48:07,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,507 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-18 10:48:07,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,510 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-18 10:48:07,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,514 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-18 10:48:07,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,517 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-18 10:48:07,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,517 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:07,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,518 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:07,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,521 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-18 10:48:07,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:07,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:07,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:07,524 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-18 10:48:07,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:07,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:07,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:07,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:07,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:07,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:07,528 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:07,530 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:48:07,530 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:48:07,530 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:07,531 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:07,531 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:07,531 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2018-11-18 10:48:07,571 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:07,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:07,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:07,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:07,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-18 10:48:07,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:07,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:07,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-18 10:48:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:07,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:07,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:07,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 10:48:07,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:07,620 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 10:48:07,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:07,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 10:48:07,629 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-18 10:48:07,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:07,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:07,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:07,638 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-18 10:48:07,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-18 10:48:07,652 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-18 10:48:07,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:48:07,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 91 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-18 10:48:07,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 91 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 193 states and 231 transitions. Complement of second has 10 states. [2018-11-18 10:48:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:48:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:48:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-18 10:48:07,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:07,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:07,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 10:48:07,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:07,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-18 10:48:07,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:07,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 231 transitions. [2018-11-18 10:48:07,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2018-11-18 10:48:07,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 171 states and 209 transitions. [2018-11-18 10:48:07,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-18 10:48:07,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 10:48:07,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 209 transitions. [2018-11-18 10:48:07,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:07,706 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 209 transitions. [2018-11-18 10:48:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 209 transitions. [2018-11-18 10:48:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 145. [2018-11-18 10:48:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 10:48:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 180 transitions. [2018-11-18 10:48:07,712 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 180 transitions. [2018-11-18 10:48:07,712 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 180 transitions. [2018-11-18 10:48:07,712 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:48:07,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 180 transitions. [2018-11-18 10:48:07,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 10:48:07,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:07,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:07,714 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-11-18 10:48:07,714 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:07,714 INFO L794 eck$LassoCheckResult]: Stem: 2878#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2877#L559-2 assume true; 2926#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2964#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2961#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2958#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2954#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 2953#L559-2 assume true; 2952#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2950#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2948#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2946#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2891#L559 [2018-11-18 10:48:07,714 INFO L796 eck$LassoCheckResult]: Loop: 2891#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 2892#L559-2 assume true; 3016#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3015#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3011#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3001#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2891#L559 [2018-11-18 10:48:07,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1801661822, now seen corresponding path program 3 times [2018-11-18 10:48:07,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:07,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:07,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:07,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1838056308, now seen corresponding path program 3 times [2018-11-18 10:48:07,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:07,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:07,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:07,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1580617419, now seen corresponding path program 1 times [2018-11-18 10:48:07,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:07,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:07,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:08,147 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2018-11-18 10:48:08,216 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:08,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:08,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:08,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:08,216 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:08,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:08,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:08,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:08,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration11_Lasso [2018-11-18 10:48:08,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:08,217 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:08,219 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-18 10:48:08,224 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-18 10:48:08,227 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-18 10:48:08,229 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-18 10:48:08,230 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-18 10:48:08,231 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-18 10:48:08,234 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-18 10:48:08,235 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-18 10:48:08,236 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-18 10:48:08,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-18 10:48:08,239 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-18 10:48:08,351 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-18 10:48:08,352 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-18 10:48:08,353 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-18 10:48:08,354 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-18 10:48:08,355 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-18 10:48:08,356 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-18 10:48:08,357 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-18 10:48:08,358 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-18 10:48:08,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:08,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:08,547 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-18 10:48:08,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:08,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:08,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:08,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,549 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-18 10:48:08,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,551 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-18 10:48:08,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,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-18 10:48:08,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,555 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-18 10:48:08,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:08,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:08,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:08,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,556 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-18 10:48:08,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:08,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,557 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:48:08,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:48:08,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:08,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,558 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-18 10:48:08,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:08,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:08,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:08,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,560 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-18 10:48:08,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:08,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:08,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:08,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,561 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-18 10:48:08,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,563 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-18 10:48:08,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:08,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:08,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:08,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,564 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-18 10:48:08,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,571 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-18 10:48:08,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,574 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-18 10:48:08,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,576 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-18 10:48:08,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,577 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:08,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:08,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,579 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-18 10:48:08,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,582 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-18 10:48:08,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,583 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:48:08,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,583 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:48:08,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,586 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-18 10:48:08,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:08,589 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-18 10:48:08,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:08,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:08,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:08,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:08,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:08,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:08,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:08,596 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:48:08,596 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:48:08,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:08,597 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:08,597 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:08,597 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 Supporting invariants [] [2018-11-18 10:48:08,648 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 10:48:08,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:48:08,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 10:48:08,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,683 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-18 10:48:08,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-18 10:48:08,698 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-18 10:48:08,698 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-18 10:48:08,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 180 transitions. cyclomatic complexity: 47 Second operand 4 states. [2018-11-18 10:48:08,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 180 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 155 states and 192 transitions. Complement of second has 7 states. [2018-11-18 10:48:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:48:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:48:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 10:48:08,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:08,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:08,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:48:08,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 10:48:08,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,747 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-18 10:48:08,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-18 10:48:08,763 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-18 10:48:08,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:48:08,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 180 transitions. cyclomatic complexity: 47 Second operand 4 states. [2018-11-18 10:48:08,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 180 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 155 states and 192 transitions. Complement of second has 7 states. [2018-11-18 10:48:08,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:48:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:48:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 10:48:08,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:08,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:08,784 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:48:08,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 10:48:08,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-18 10:48:08,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-18 10:48:08,834 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-18 10:48:08,834 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:48:08,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 180 transitions. cyclomatic complexity: 47 Second operand 4 states. [2018-11-18 10:48:08,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 180 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 191 states and 231 transitions. Complement of second has 6 states. [2018-11-18 10:48:08,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:48:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:48:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 10:48:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 10:48:08,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 10:48:08,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-18 10:48:08,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:08,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 231 transitions. [2018-11-18 10:48:08,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-18 10:48:08,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 154 states and 188 transitions. [2018-11-18 10:48:08,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-18 10:48:08,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-18 10:48:08,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2018-11-18 10:48:08,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:08,868 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2018-11-18 10:48:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2018-11-18 10:48:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-11-18 10:48:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 10:48:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2018-11-18 10:48:08,871 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 161 transitions. [2018-11-18 10:48:08,871 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 161 transitions. [2018-11-18 10:48:08,871 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 10:48:08,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 161 transitions. [2018-11-18 10:48:08,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-18 10:48:08,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:08,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:08,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-18 10:48:08,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:48:08,873 INFO L794 eck$LassoCheckResult]: Stem: 3783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3781#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3782#L559-2 assume true; 3873#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3872#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3871#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3870#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3832#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3788#L559-2 assume true; 3789#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3830#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3826#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3827#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 3800#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 3801#L559-2 assume true; 3809#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3777#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3778#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3792#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3794#L552 [2018-11-18 10:48:08,873 INFO L796 eck$LassoCheckResult]: Loop: 3794#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3785#L559-2 assume true; 3798#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3799#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3805#L550-4 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3806#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3794#L552 [2018-11-18 10:48:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash -466962259, now seen corresponding path program 2 times [2018-11-18 10:48:08,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:08,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:08,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:08,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:08,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fc0dc76-0303-4b60-ab11-5ea5f082bc39/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-18 10:48:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:48:08,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:48:08,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:48:08,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:08,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-18 10:48:08,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-18 10:48:08,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 10:48:08,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:48:08,983 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 10:48:08,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 10:48:08,993 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-18 10:48:08,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:08,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:09,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:09,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2018-11-18 10:48:09,022 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 23 treesize of output 17 [2018-11-18 10:48:09,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-18 10:48:09,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:48:09,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:48:09,032 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-18 10:48:09,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-11-18 10:48:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:09,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:48:09,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-18 10:48:09,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:48:09,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1609023092, now seen corresponding path program 3 times [2018-11-18 10:48:09,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:09,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:09,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:09,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:48:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:48:09,125 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. cyclomatic complexity: 39 Second operand 11 states. [2018-11-18 10:48:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:09,193 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2018-11-18 10:48:09,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:48:09,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 119 transitions. [2018-11-18 10:48:09,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:48:09,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-11-18 10:48:09,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:48:09,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:48:09,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:48:09,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:48:09,194 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:48:09,194 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:48:09,194 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:48:09,194 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 10:48:09,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:48:09,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:48:09,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:48:09,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:48:09 BoogieIcfgContainer [2018-11-18 10:48:09,200 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:48:09,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:48:09,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:48:09,200 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:48:09,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:00" (3/4) ... [2018-11-18 10:48:09,204 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:48:09,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:48:09,204 INFO L168 Benchmark]: Toolchain (without parser) took 9117.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 158.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:09,205 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:48:09,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:09,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:09,206 INFO L168 Benchmark]: Boogie Preprocessor took 15.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:48:09,206 INFO L168 Benchmark]: RCFGBuilder took 242.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:09,210 INFO L168 Benchmark]: BuchiAutomizer took 8504.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.3 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:09,210 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:48:09,212 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 242.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8504.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.3 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (4 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 6.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 156 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 145 states and ocurred in iteration 10. Nontrivial modules had stage [6, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 171 SDtfs, 211 SDslu, 120 SDs, 0 SdLazy, 456 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital200 mio100 ax109 hnf100 lsp86 ukn65 mio100 lsp41 div100 bol100 ite100 ukn100 eq183 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 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...