./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c721a987debd4748cfed075333b7fa46c2d0f9ef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:47,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:47,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:47,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:47,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:47,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:47,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:47,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:47,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:47,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:47,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:47,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:47,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:47,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:47,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:47,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:47,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:47,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:47,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:47,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:47,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:47,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:47,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:47,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:47,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:47,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:47,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:47,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:47,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:47,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:47,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:47,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:47,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:47,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:47,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:47,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:47,723 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:12:47,736 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:47,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:47,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:47,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:47,739 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:47,739 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:47,739 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:47,739 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:47,739 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:47,739 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:47,740 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:47,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:47,740 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:12:47,740 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:47,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:47,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:12:47,740 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:47,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:47,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:47,741 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:47,741 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:12:47,741 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:47,741 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:47,744 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:47,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:47,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:47,744 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:47,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:47,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:47,745 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:47,746 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:47,746 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_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2018-10-27 06:12:47,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:47,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:47,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:47,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:47,791 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:47,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i [2018-10-27 06:12:47,844 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/data/763675de2/3b65ea759d8e403d83467cac38d30679/FLAG378fdbd5d [2018-10-27 06:12:48,229 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:48,229 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i [2018-10-27 06:12:48,234 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/data/763675de2/3b65ea759d8e403d83467cac38d30679/FLAG378fdbd5d [2018-10-27 06:12:48,246 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/bin-2019/uautomizer/data/763675de2/3b65ea759d8e403d83467cac38d30679 [2018-10-27 06:12:48,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:48,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:48,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:48,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:48,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:48,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0c1537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48, skipping insertion in model container [2018-10-27 06:12:48,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:48,288 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:48,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:48,433 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:48,451 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:48,466 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:48,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48 WrapperNode [2018-10-27 06:12:48,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:48,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:48,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:48,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:48,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:48,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:48,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:48,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:48,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... [2018-10-27 06:12:48,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:48,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:48,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:48,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:48,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/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-10-27 06:12:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:12:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:48,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:12:49,269 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:49,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:49 BoogieIcfgContainer [2018-10-27 06:12:49,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:49,271 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:49,271 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:49,275 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:49,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:49,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:48" (1/3) ... [2018-10-27 06:12:49,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25985872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:49, skipping insertion in model container [2018-10-27 06:12:49,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:49,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:48" (2/3) ... [2018-10-27 06:12:49,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25985872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:49, skipping insertion in model container [2018-10-27 06:12:49,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:49,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:49" (3/3) ... [2018-10-27 06:12:49,279 INFO L375 chiAutomizerObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2018-10-27 06:12:49,332 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:49,332 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:49,333 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:49,333 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:49,333 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:49,333 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:49,333 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:49,333 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:49,333 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:49,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states. [2018-10-27 06:12:49,381 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:12:49,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:49,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:49,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:12:49,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:49,390 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:49,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states. [2018-10-27 06:12:49,393 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:12:49,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:49,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:49,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:12:49,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:49,403 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 44#L20true assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 8#L11-4true [2018-10-27 06:12:49,403 INFO L795 eck$LassoCheckResult]: Loop: 8#L11-4true assume true; 33#L11-1true assume !!(max_~i~0 < ~N~0); 47#L12true SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 46#L12-1true assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 29#L12-5true max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 11#L11-3true max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8#L11-4true [2018-10-27 06:12:49,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-10-27 06:12:49,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:49,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:49,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1158564111, now seen corresponding path program 1 times [2018-10-27 06:12:49,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:49,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:49,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:49,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash -592248592, now seen corresponding path program 1 times [2018-10-27 06:12:49,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:49,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:49,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,704 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:12:49,903 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 06:12:50,051 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 06:12:50,062 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:50,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:50,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:50,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:50,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:50,064 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:50,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:50,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:50,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:12:50,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:50,064 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:50,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,674 WARN L179 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-10-27 06:12:50,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:50,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-10-27 06:12:50,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-10-27 06:12:50,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-10-27 06:12:51,309 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:51,313 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:51,315 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-10-27 06:12:51,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:51,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:51,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:51,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:51,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:51,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:51,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:51,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:51,324 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-10-27 06:12:51,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:51,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:51,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:51,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:51,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:51,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:51,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:51,335 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-10-27 06:12:51,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:51,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:51,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:51,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:51,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:51,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:51,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:51,350 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-10-27 06:12:51,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:51,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:51,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:51,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:51,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:51,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:51,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:51,362 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-10-27 06:12:51,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:51,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:51,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:51,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:51,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:51,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:51,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:51,491 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:12:51,491 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:12:51,493 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:51,500 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:51,501 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:51,502 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_max_~x.base)_1, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_max_~x.base)_1 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-10-27 06:12:51,514 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:12:51,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:51,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:51,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:51,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:51,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:12:51,638 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states. Second operand 4 states. [2018-10-27 06:12:51,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states.. Second operand 4 states. Result 122 states and 144 transitions. Complement of second has 8 states. [2018-10-27 06:12:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-10-27 06:12:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 3 letters. Loop has 6 letters. [2018-10-27 06:12:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 9 letters. Loop has 6 letters. [2018-10-27 06:12:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 3 letters. Loop has 12 letters. [2018-10-27 06:12:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:51,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 144 transitions. [2018-10-27 06:12:51,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:12:51,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 50 states and 59 transitions. [2018-10-27 06:12:51,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:12:51,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-10-27 06:12:51,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 59 transitions. [2018-10-27 06:12:51,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:51,744 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-10-27 06:12:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 59 transitions. [2018-10-27 06:12:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-27 06:12:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 06:12:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-10-27 06:12:51,773 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-10-27 06:12:51,773 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-10-27 06:12:51,773 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:51,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2018-10-27 06:12:51,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:12:51,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:51,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:51,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:51,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:51,776 INFO L793 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 267#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 263#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 253#L11-4 assume true; 255#L11-1 assume !(max_~i~0 < ~N~0); 250#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 251#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 257#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 252#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 247#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 245#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 246#L29-4 havoc main_#t~mem7; 280#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 277#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 274#L11-10 [2018-10-27 06:12:51,776 INFO L795 eck$LassoCheckResult]: Loop: 274#L11-10 assume true; 275#L11-7 assume !!(max_~i~0 < ~N~0); 281#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 282#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 284#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 278#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 274#L11-10 [2018-10-27 06:12:51,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1991275133, now seen corresponding path program 1 times [2018-10-27 06:12:51,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:51,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:51,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:51,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:51,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:51,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:51,878 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:51,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2130565681, now seen corresponding path program 1 times [2018-10-27 06:12:51,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:51,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:51,971 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-10-27 06:12:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:52,190 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-10-27 06:12:52,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:52,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 65 transitions. [2018-10-27 06:12:52,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:12:52,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 64 transitions. [2018-10-27 06:12:52,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-10-27 06:12:52,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-10-27 06:12:52,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 64 transitions. [2018-10-27 06:12:52,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:52,194 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-10-27 06:12:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 64 transitions. [2018-10-27 06:12:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-10-27 06:12:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 06:12:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-10-27 06:12:52,197 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-10-27 06:12:52,200 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-10-27 06:12:52,200 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:52,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 56 transitions. [2018-10-27 06:12:52,201 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:12:52,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:52,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:52,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,203 INFO L793 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 377#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 367#L11-4 assume true; 368#L11-1 assume !!(max_~i~0 < ~N~0); 390#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 386#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 387#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 373#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 369#L11-4 assume true; 370#L11-1 assume !(max_~i~0 < ~N~0); 364#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 365#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 371#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 366#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 361#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 359#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 360#L29-4 havoc main_#t~mem7; 394#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 391#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 388#L11-10 [2018-10-27 06:12:52,203 INFO L795 eck$LassoCheckResult]: Loop: 388#L11-10 assume true; 389#L11-7 assume !!(max_~i~0 < ~N~0); 395#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 396#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 398#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 392#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 388#L11-10 [2018-10-27 06:12:52,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1789998737, now seen corresponding path program 1 times [2018-10-27 06:12:52,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:52,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:52,327 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/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-10-27 06:12:52,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:52,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:52,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:52,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-27 06:12:52,471 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:52,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2130565681, now seen corresponding path program 2 times [2018-10-27 06:12:52,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:52,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:12:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:12:52,563 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-10-27 06:12:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:52,876 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-10-27 06:12:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:12:52,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2018-10-27 06:12:52,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:12:52,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 73 transitions. [2018-10-27 06:12:52,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-10-27 06:12:52,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-10-27 06:12:52,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 73 transitions. [2018-10-27 06:12:52,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:52,880 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-10-27 06:12:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 73 transitions. [2018-10-27 06:12:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-10-27 06:12:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 06:12:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-10-27 06:12:52,887 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-10-27 06:12:52,887 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-10-27 06:12:52,887 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:52,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 65 transitions. [2018-10-27 06:12:52,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:12:52,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:52,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:52,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,889 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,889 INFO L793 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 559#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 549#L11-4 assume true; 550#L11-1 assume !!(max_~i~0 < ~N~0); 598#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 596#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 594#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 555#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 551#L11-4 assume true; 552#L11-1 assume !!(max_~i~0 < ~N~0); 572#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 568#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 569#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 584#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 593#L11-4 assume true; 589#L11-1 assume !(max_~i~0 < ~N~0); 546#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 547#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 554#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 548#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 545#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 541#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 542#L29-4 havoc main_#t~mem7; 576#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 573#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 570#L11-10 [2018-10-27 06:12:52,889 INFO L795 eck$LassoCheckResult]: Loop: 570#L11-10 assume true; 571#L11-7 assume !!(max_~i~0 < ~N~0); 577#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 578#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 580#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 574#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 570#L11-10 [2018-10-27 06:12:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,894 INFO L82 PathProgramCache]: Analyzing trace with hash 519611105, now seen corresponding path program 2 times [2018-10-27 06:12:52,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:52,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2130565681, now seen corresponding path program 3 times [2018-10-27 06:12:52,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2131943249, now seen corresponding path program 1 times [2018-10-27 06:12:52,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:53,086 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:12:53,644 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 129 [2018-10-27 06:12:53,862 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 06:12:53,863 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:53,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:53,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:53,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:53,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:53,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:53,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:53,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:53,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-10-27 06:12:53,864 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:53,864 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:53,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,146 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2018-10-27 06:12:54,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-10-27 06:12:54,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-10-27 06:12:54,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,368 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-27 06:12:54,529 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:54,529 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:54,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-10-27 06:12:54,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:54,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,539 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-10-27 06:12:54,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,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-10-27 06:12:54,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,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-10-27 06:12:54,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,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-10-27 06:12:54,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,562 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-10-27 06:12:54,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,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-10-27 06:12:54,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,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-10-27 06:12:54,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,573 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-10-27 06:12:54,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,580 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-10-27 06:12:54,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,587 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-10-27 06:12:54,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,598 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-10-27 06:12:54,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,608 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-10-27 06:12:54,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,616 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-10-27 06:12:54,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,623 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-10-27 06:12:54,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,632 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-10-27 06:12:54,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,637 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-10-27 06:12:54,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,663 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:54,718 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:12:54,720 INFO L444 ModelExtractionUtils]: 23 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:12:54,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:54,723 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:54,729 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:54,729 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_2, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_2 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-10-27 06:12:54,826 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-10-27 06:12:54,827 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:54,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:54,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:54,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:55,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:12:55,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 65 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-10-27 06:12:55,110 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 65 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 78 states and 88 transitions. Complement of second has 7 states. [2018-10-27 06:12:55,113 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-10-27 06:12:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-10-27 06:12:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 26 letters. Loop has 6 letters. [2018-10-27 06:12:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 6 letters. [2018-10-27 06:12:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 26 letters. Loop has 12 letters. [2018-10-27 06:12:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:55,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 88 transitions. [2018-10-27 06:12:55,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:12:55,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 60 states and 68 transitions. [2018-10-27 06:12:55,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-10-27 06:12:55,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:12:55,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2018-10-27 06:12:55,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:55,120 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-27 06:12:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2018-10-27 06:12:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-27 06:12:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:12:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-10-27 06:12:55,122 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-27 06:12:55,122 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-27 06:12:55,122 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:55,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-10-27 06:12:55,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:12:55,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:55,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:55,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:55,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:55,124 INFO L793 eck$LassoCheckResult]: Stem: 872#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 839#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 829#L11-4 assume true; 830#L11-1 assume !!(max_~i~0 < ~N~0); 854#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 848#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 849#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 835#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 831#L11-4 assume true; 832#L11-1 assume !!(max_~i~0 < ~N~0); 880#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 878#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 876#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 875#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 874#L11-4 assume true; 870#L11-1 assume !(max_~i~0 < ~N~0); 826#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 827#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 834#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 828#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 825#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 821#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 822#L29-4 havoc main_#t~mem7; 858#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 855#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 850#L11-10 assume true; 852#L11-7 assume !(max_~i~0 < ~N~0); 846#L11-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 847#L14-1 main_#t~ret8 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 857#L31 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 836#L31-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 837#L32-4 [2018-10-27 06:12:55,124 INFO L795 eck$LassoCheckResult]: Loop: 837#L32-4 assume true; 840#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 842#L33 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 871#L33-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 868#L33-2 havoc main_#t~mem11; 866#L32-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 837#L32-4 [2018-10-27 06:12:55,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2133333529, now seen corresponding path program 1 times [2018-10-27 06:12:55,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:12:55,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:55,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:12:55,344 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:55,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1272651447, now seen corresponding path program 1 times [2018-10-27 06:12:55,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:55,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:55,467 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-27 06:12:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:12:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:12:55,476 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-10-27 06:12:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:55,514 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-10-27 06:12:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:55,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2018-10-27 06:12:55,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:12:55,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 84 transitions. [2018-10-27 06:12:55,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-10-27 06:12:55,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-10-27 06:12:55,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 84 transitions. [2018-10-27 06:12:55,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:55,517 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-10-27 06:12:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 84 transitions. [2018-10-27 06:12:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-10-27 06:12:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:12:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-10-27 06:12:55,522 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-10-27 06:12:55,522 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-10-27 06:12:55,522 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:55,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 67 transitions. [2018-10-27 06:12:55,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:12:55,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:55,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:55,524 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:55,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:55,524 INFO L793 eck$LassoCheckResult]: Stem: 1017#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 982#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 972#L11-4 assume true; 973#L11-1 assume !!(max_~i~0 < ~N~0); 998#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 991#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 993#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 978#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 974#L11-4 assume true; 975#L11-1 assume !!(max_~i~0 < ~N~0); 1023#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1022#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1021#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1020#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1019#L11-4 assume true; 1015#L11-1 assume !(max_~i~0 < ~N~0); 969#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 970#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 976#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 971#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 966#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 964#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 965#L29-4 havoc main_#t~mem7; 1002#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 999#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 994#L11-10 assume true; 995#L11-7 assume !!(max_~i~0 < ~N~0); 1003#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1004#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1006#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1000#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 996#L11-10 assume true; 997#L11-7 assume !(max_~i~0 < ~N~0); 989#L11-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 990#L14-1 main_#t~ret8 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1001#L31 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 979#L31-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 980#L32-4 [2018-10-27 06:12:55,524 INFO L795 eck$LassoCheckResult]: Loop: 980#L32-4 assume true; 983#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 985#L33 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 1016#L33-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 1013#L33-2 havoc main_#t~mem11; 1010#L32-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 980#L32-4 [2018-10-27 06:12:55,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1744939723, now seen corresponding path program 1 times [2018-10-27 06:12:55,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:55,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:12:55,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:55,625 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4aa6095a-02ee-4c21-b1c8-1dfa1805463a/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-10-27 06:12:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:55,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:12:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-27 06:12:55,890 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:55,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1272651447, now seen corresponding path program 2 times [2018-10-27 06:12:55,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:55,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:12:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:12:56,027 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:12:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:56,184 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-10-27 06:12:56,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:12:56,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 111 transitions. [2018-10-27 06:12:56,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:12:56,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 98 states and 110 transitions. [2018-10-27 06:12:56,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-10-27 06:12:56,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-10-27 06:12:56,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 110 transitions. [2018-10-27 06:12:56,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:56,186 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-10-27 06:12:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 110 transitions. [2018-10-27 06:12:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2018-10-27 06:12:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 06:12:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-10-27 06:12:56,189 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-10-27 06:12:56,189 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-10-27 06:12:56,189 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:12:56,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 76 transitions. [2018-10-27 06:12:56,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:12:56,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:56,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:56,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:56,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:56,195 INFO L793 eck$LassoCheckResult]: Stem: 1299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1264#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1254#L11-4 assume true; 1255#L11-1 assume !!(max_~i~0 < ~N~0); 1313#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1311#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1309#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1260#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1256#L11-4 assume true; 1257#L11-1 assume !!(max_~i~0 < ~N~0); 1279#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1273#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1274#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1293#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1302#L11-4 assume true; 1298#L11-1 assume !(max_~i~0 < ~N~0); 1251#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1252#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1258#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1253#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1248#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1246#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1247#L29-4 havoc main_#t~mem7; 1284#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1280#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1275#L11-10 assume true; 1276#L11-7 assume !!(max_~i~0 < ~N~0); 1308#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1306#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1304#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1303#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1277#L11-10 assume true; 1278#L11-7 assume !!(max_~i~0 < ~N~0); 1286#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1287#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1289#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1281#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1282#L11-10 assume true; 1285#L11-7 assume !(max_~i~0 < ~N~0); 1271#L11-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1272#L14-1 main_#t~ret8 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1283#L31 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 1261#L31-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1262#L32-4 [2018-10-27 06:12:56,195 INFO L795 eck$LassoCheckResult]: Loop: 1262#L32-4 assume true; 1266#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 1268#L33 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 1300#L33-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 1296#L33-2 havoc main_#t~mem11; 1294#L32-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 1262#L32-4 [2018-10-27 06:12:56,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1819374077, now seen corresponding path program 2 times [2018-10-27 06:12:56,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:56,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:56,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:56,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:56,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:56,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1272651447, now seen corresponding path program 3 times [2018-10-27 06:12:56,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:56,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:56,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash 64841163, now seen corresponding path program 1 times [2018-10-27 06:12:56,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:56,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:56,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:56,928 WARN L179 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 174 [2018-10-27 06:12:57,131 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-10-27 06:12:57,137 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:57,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:57,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:57,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:57,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:57,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:57,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:57,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:57,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-10-27 06:12:57,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:57,137 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:57,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,372 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-10-27 06:12:57,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:57,818 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:57,818 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:57,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-10-27 06:12:57,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,821 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-10-27 06:12:57,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,829 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-10-27 06:12:57,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:57,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,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-10-27 06:12:57,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,833 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-10-27 06:12:57,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,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-10-27 06:12:57,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,847 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-10-27 06:12:57,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,848 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-10-27 06:12:57,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:57,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,851 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-10-27 06:12:57,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,853 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-10-27 06:12:57,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:57,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:57,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:57,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,865 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-10-27 06:12:57,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:57,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,873 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-10-27 06:12:57,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:57,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,890 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-10-27 06:12:57,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,891 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:57,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,892 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:57,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,897 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-10-27 06:12:57,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:57,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:57,914 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-10-27 06:12:57,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:57,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:57,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:57,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:57,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:57,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:57,943 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:57,955 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:57,955 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:12:57,956 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:57,956 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:57,956 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:57,957 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#x~0.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2, ULTIMATE.start_main_~i~1) = -1*ULTIMATE.start_main_~#x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-10-27 06:12:58,190 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:12:58,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:58,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:58,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:58,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:58,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:12:58,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 76 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-10-27 06:12:58,671 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 76 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 84 states and 95 transitions. Complement of second has 6 states. [2018-10-27 06:12:58,673 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-10-27 06:12:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-10-27 06:12:58,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 44 letters. Loop has 6 letters. [2018-10-27 06:12:58,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:58,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 50 letters. Loop has 6 letters. [2018-10-27 06:12:58,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:58,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 44 letters. Loop has 12 letters. [2018-10-27 06:12:58,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:58,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 95 transitions. [2018-10-27 06:12:58,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:12:58,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 70 states and 79 transitions. [2018-10-27 06:12:58,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-10-27 06:12:58,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:12:58,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 79 transitions. [2018-10-27 06:12:58,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:58,678 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-10-27 06:12:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 79 transitions. [2018-10-27 06:12:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-27 06:12:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 06:12:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-10-27 06:12:58,680 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-10-27 06:12:58,680 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-10-27 06:12:58,680 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:12:58,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 79 transitions. [2018-10-27 06:12:58,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:12:58,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:58,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:58,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:58,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:58,687 INFO L793 eck$LassoCheckResult]: Stem: 1661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1630#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1625#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1615#L11-4 assume true; 1616#L11-1 assume !!(max_~i~0 < ~N~0); 1641#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1635#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1636#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1621#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1617#L11-4 assume true; 1618#L11-1 assume !!(max_~i~0 < ~N~0); 1669#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1667#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1665#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1664#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1663#L11-4 assume true; 1659#L11-1 assume !(max_~i~0 < ~N~0); 1612#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1613#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1619#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1614#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1609#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1607#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1608#L29-4 havoc main_#t~mem7; 1645#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1642#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1637#L11-10 assume true; 1638#L11-7 assume !!(max_~i~0 < ~N~0); 1647#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1648#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1650#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1643#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1639#L11-10 assume true; 1640#L11-7 assume !!(max_~i~0 < ~N~0); 1676#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1674#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1672#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1671#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1670#L11-10 assume true; 1646#L11-7 assume !(max_~i~0 < ~N~0); 1633#L11-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1634#L14-1 main_#t~ret8 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1644#L31 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 1622#L31-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1623#L32-4 assume true; 1626#L32-1 assume !(main_~i~1 < ~N~0 - 1); 1627#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L32-5 1651#L35 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1652#L11-16 [2018-10-27 06:12:58,687 INFO L795 eck$LassoCheckResult]: Loop: 1652#L11-16 assume true; 1653#L11-13 assume !!(max_~i~0 < ~N~0); 1656#L12-12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-12 1658#L12-13 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1610#L12-17 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1611#L11-15 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1652#L11-16 [2018-10-27 06:12:58,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash -303844473, now seen corresponding path program 1 times [2018-10-27 06:12:58,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:58,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 06:12:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:58,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:12:58,923 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:58,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -710559793, now seen corresponding path program 1 times [2018-10-27 06:12:58,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,185 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:12:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:12:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:12:59,217 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-10-27 06:12:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:59,240 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-10-27 06:12:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:59,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 84 transitions. [2018-10-27 06:12:59,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:12:59,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 83 transitions. [2018-10-27 06:12:59,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:12:59,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:12:59,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 83 transitions. [2018-10-27 06:12:59,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:59,245 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-10-27 06:12:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 83 transitions. [2018-10-27 06:12:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-10-27 06:12:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 06:12:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-10-27 06:12:59,248 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-27 06:12:59,248 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-27 06:12:59,248 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:12:59,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 78 transitions. [2018-10-27 06:12:59,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:12:59,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:59,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:59,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:59,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:12:59,254 INFO L793 eck$LassoCheckResult]: Stem: 1813#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1778#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1768#L11-4 assume true; 1769#L11-1 assume !!(max_~i~0 < ~N~0); 1794#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1788#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1789#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1774#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1770#L11-4 assume true; 1771#L11-1 assume !!(max_~i~0 < ~N~0); 1822#L12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12 1820#L12-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1818#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1817#L11-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1816#L11-4 assume true; 1812#L11-1 assume !(max_~i~0 < ~N~0); 1765#L11-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1766#L14 main_#t~ret5 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1772#L29 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1767#L29-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1762#L29-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1760#L29-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1761#L29-4 havoc main_#t~mem7; 1798#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1795#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1790#L11-10 assume true; 1791#L11-7 assume !!(max_~i~0 < ~N~0); 1800#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1801#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1803#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1796#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1792#L11-10 assume true; 1793#L11-7 assume !!(max_~i~0 < ~N~0); 1829#L12-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-6 1827#L12-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1825#L12-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1824#L11-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1823#L11-10 assume true; 1799#L11-7 assume !(max_~i~0 < ~N~0); 1786#L11-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1787#L14-1 main_#t~ret8 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1797#L31 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 1775#L31-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1776#L32-4 assume true; 1782#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 1783#L33 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 1814#L33-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 1810#L33-2 havoc main_#t~mem11; 1808#L32-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 1807#L32-4 assume true; 1780#L32-1 assume !(main_~i~1 < ~N~0 - 1); 1781#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L32-5 1804#L35 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1805#L11-16 [2018-10-27 06:12:59,254 INFO L795 eck$LassoCheckResult]: Loop: 1805#L11-16 assume true; 1806#L11-13 assume !!(max_~i~0 < ~N~0); 1809#L12-12 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L12-12 1811#L12-13 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1763#L12-17 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1764#L11-15 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1805#L11-16 [2018-10-27 06:12:59,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1743873871, now seen corresponding path program 1 times [2018-10-27 06:12:59,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:59,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:59,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:59,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:59,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -710559793, now seen corresponding path program 2 times [2018-10-27 06:12:59,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:59,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2066486115, now seen corresponding path program 1 times [2018-10-27 06:12:59,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:59,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:59,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:00,595 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 249 DAG size of output: 210 [2018-10-27 06:13:00,896 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:13:00,898 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:00,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:00,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:00,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:00,898 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:00,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:00,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:00,899 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:00,899 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-10-27 06:13:00,899 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:00,899 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:00,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:00,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:01,167 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2018-10-27 06:13:01,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:01,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-10-27 06:13:01,594 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:01,594 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:01,594 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-10-27 06:13:01,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,597 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-10-27 06:13:01,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,608 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-10-27 06:13:01,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,616 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-10-27 06:13:01,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,619 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-10-27 06:13:01,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,621 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-10-27 06:13:01,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,623 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-10-27 06:13:01,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,627 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-10-27 06:13:01,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,630 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-10-27 06:13:01,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,633 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-10-27 06:13:01,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,637 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-10-27 06:13:01,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:01,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:01,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:01,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,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-10-27 06:13:01,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,643 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-10-27 06:13:01,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,646 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-10-27 06:13:01,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,650 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-10-27 06:13:01,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,653 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-10-27 06:13:01,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:01,658 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-10-27 06:13:01,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:01,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:01,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:01,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:01,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:01,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:01,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:01,692 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:13:01,692 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:13:01,693 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:01,693 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:01,694 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:01,694 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, ~N~0) = -1*ULTIMATE.start_max_~i~0 + 1*~N~0 Supporting invariants [] [2018-10-27 06:13:01,987 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-10-27 06:13:02,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:02,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:02,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,187 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:13:02,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 78 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-10-27 06:13:02,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 78 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 78 states and 88 transitions. Complement of second has 6 states. [2018-10-27 06:13:02,209 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-10-27 06:13:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:13:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-10-27 06:13:02,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 54 letters. Loop has 6 letters. [2018-10-27 06:13:02,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:02,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 60 letters. Loop has 6 letters. [2018-10-27 06:13:02,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:02,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 54 letters. Loop has 12 letters. [2018-10-27 06:13:02,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:02,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 88 transitions. [2018-10-27 06:13:02,212 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:02,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2018-10-27 06:13:02,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:13:02,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:13:02,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:13:02,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:02,213 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:02,213 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:02,213 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:02,213 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:13:02,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:13:02,213 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:02,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:13:02,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:13:02 BoogieIcfgContainer [2018-10-27 06:13:02,224 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:13:02,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:13:02,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:13:02,225 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:13:02,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:49" (3/4) ... [2018-10-27 06:13:02,229 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:13:02,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:13:02,230 INFO L168 Benchmark]: Toolchain (without parser) took 13981.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 958.5 MB in the beginning and 1.0 GB in the end (delta: -45.4 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:02,231 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:02,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.98 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:02,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:02,232 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:02,233 INFO L168 Benchmark]: RCFGBuilder took 732.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:02,234 INFO L168 Benchmark]: BuchiAutomizer took 12953.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 136.2 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:02,234 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:02,240 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.98 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.06 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 732.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12953.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 136.2 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 4 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 10.7s. Construction of modules took 0.7s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 64 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 359 SDtfs, 501 SDslu, 342 SDs, 0 SdLazy, 302 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax100 hnf99 lsp95 ukn87 mio100 lsp52 div100 bol100 ite100 ukn100 eq174 hnf86 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 4 VariablesLoop: 3 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...