./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2a421301cdbe97036a5fec0597ad83df33c3e561 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:40:11,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:40:11,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:40:11,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:40:11,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:40:11,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:40:11,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:40:11,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:40:11,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:40:11,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:40:11,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:40:11,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:40:11,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:40:11,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:40:11,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:40:11,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:40:11,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:40:11,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:40:11,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:40:11,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:40:11,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:40:11,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:40:11,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:40:11,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:40:11,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:40:11,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:40:11,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:40:11,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:40:11,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:40:11,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:40:11,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:40:11,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:40:11,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:40:11,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:40:11,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:40:11,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:40:11,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:40:11,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:40:11,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:40:11,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:40:11,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:40:11,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:40:11,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:40:11,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:40:11,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:40:11,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:40:11,775 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:40:11,776 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:40:11,776 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:40:11,776 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:40:11,776 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:40:11,777 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:40:11,777 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:40:11,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:40:11,777 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:40:11,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:40:11,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:40:11,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:40:11,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:40:11,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:40:11,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:40:11,780 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:40:11,780 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:40:11,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:40:11,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:40:11,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:40:11,781 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:40:11,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:40:11,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:40:11,782 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:40:11,784 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:40:11,784 INFO L138 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/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a421301cdbe97036a5fec0597ad83df33c3e561 [2019-11-16 00:40:11,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:40:11,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:40:11,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:40:11,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:40:11,831 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:40:11,832 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i [2019-11-16 00:40:11,885 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/data/e652756fb/8a4b0ae6944e46a0b031164496086025/FLAGe59c07145 [2019-11-16 00:40:12,312 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:40:12,312 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i [2019-11-16 00:40:12,328 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/data/e652756fb/8a4b0ae6944e46a0b031164496086025/FLAGe59c07145 [2019-11-16 00:40:12,620 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/uautomizer/data/e652756fb/8a4b0ae6944e46a0b031164496086025 [2019-11-16 00:40:12,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:40:12,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:40:12,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:12,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:40:12,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:40:12,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:12" (1/1) ... [2019-11-16 00:40:12,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f56ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:12, skipping insertion in model container [2019-11-16 00:40:12,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:12" (1/1) ... [2019-11-16 00:40:12,652 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:40:12,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:40:13,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:13,082 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:40:13,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:13,205 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:40:13,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13 WrapperNode [2019-11-16 00:40:13,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:13,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:13,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:40:13,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:40:13,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:13,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:40:13,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:40:13,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:40:13,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:40:13,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:40:13,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:40:13,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:40:13,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_717d34f3-2452-4511-ad19-a55c2bf13908/bin/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 [2019-11-16 00:40:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:40:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:40:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:40:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:40:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:40:13,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:40:13,754 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:40:13,754 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:40:13,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:13 BoogieIcfgContainer [2019-11-16 00:40:13,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:40:13,756 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:40:13,756 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:40:13,759 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:40:13,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:40:13,759 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:40:12" (1/3) ... [2019-11-16 00:40:13,760 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@380bf8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:40:13, skipping insertion in model container [2019-11-16 00:40:13,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:40:13,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13" (2/3) ... [2019-11-16 00:40:13,761 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@380bf8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:40:13, skipping insertion in model container [2019-11-16 00:40:13,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:40:13,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:13" (3/3) ... [2019-11-16 00:40:13,762 INFO L371 chiAutomizerObserver]: Analyzing ICFG array02-alloca-1.i [2019-11-16 00:40:13,807 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:40:13,808 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:40:13,808 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:40:13,808 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:40:13,808 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:40:13,808 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:40:13,808 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:40:13,809 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:40:13,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-16 00:40:13,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:40:13,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:13,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:13,843 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:40:13,843 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:40:13,843 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:40:13,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-16 00:40:13,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:40:13,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:13,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:13,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:40:13,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:40:13,851 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L565true assume !(main_~array_size~0 < 1); 9#L565-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 16#L552-3true [2019-11-16 00:40:13,851 INFO L793 eck$LassoCheckResult]: Loop: 16#L552-3true assume !!(test_fun_~i~0 < test_fun_~N); 13#L553-3true assume !true; 5#L557-2true assume !true; 14#L552-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 16#L552-3true [2019-11-16 00:40:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:40:13,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:13,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887469467] [2019-11-16 00:40:13,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:13,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:13,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:13,968 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2019-11-16 00:40:13,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:13,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044657164] [2019-11-16 00:40:13,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:13,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:13,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:13,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044657164] [2019-11-16 00:40:13,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:13,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:40:13,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559339348] [2019-11-16 00:40:14,001 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:40:14,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:14,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:40:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:40:14,015 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-16 00:40:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:14,020 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-16 00:40:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:40:14,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-16 00:40:14,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:40:14,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-11-16 00:40:14,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:40:14,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:40:14,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-16 00:40:14,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:40:14,028 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:40:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-16 00:40:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:40:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:40:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-16 00:40:14,049 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:40:14,049 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:40:14,049 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:40:14,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-16 00:40:14,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:40:14,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:14,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:14,050 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:40:14,050 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:40:14,051 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L565 assume !(main_~array_size~0 < 1); 39#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 40#L552-3 [2019-11-16 00:40:14,051 INFO L793 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 43#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 42#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L552-3 [2019-11-16 00:40:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-16 00:40:14,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:14,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245890513] [2019-11-16 00:40:14,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:14,077 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2019-11-16 00:40:14,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:14,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099496260] [2019-11-16 00:40:14,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:14,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2019-11-16 00:40:14,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:14,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996446091] [2019-11-16 00:40:14,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:14,139 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:14,563 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-16 00:40:14,579 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:40:14,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:40:14,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:40:14,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:40:14,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:40:14,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:40:14,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:40:14,586 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:40:14,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration2_Lasso [2019-11-16 00:40:14,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:40:14,587 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:40:14,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,850 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-16 00:40:14,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:14,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:15,306 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:40:15,312 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:40:15,314 INFO L120 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 [2019-11-16 00:40:15,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,317 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,326 INFO L120 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 [2019-11-16 00:40:15,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,337 INFO L120 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 [2019-11-16 00:40:15,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,340 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,344 INFO L120 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 [2019-11-16 00:40:15,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,350 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,350 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,362 INFO L120 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 [2019-11-16 00:40:15,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,368 INFO L120 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 [2019-11-16 00:40:15,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,372 INFO L120 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 [2019-11-16 00:40:15,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,379 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,391 INFO L120 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 [2019-11-16 00:40:15,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,393 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,393 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,396 INFO L120 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 [2019-11-16 00:40:15,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,403 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,405 INFO L120 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 [2019-11-16 00:40:15,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,407 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,409 INFO L120 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 [2019-11-16 00:40:15,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,427 INFO L120 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 [2019-11-16 00:40:15,428 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,436 INFO L120 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 [2019-11-16 00:40:15,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,437 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,439 INFO L120 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 [2019-11-16 00:40:15,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,441 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,444 INFO L120 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 [2019-11-16 00:40:15,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:15,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:15,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:15,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,451 INFO L120 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 [2019-11-16 00:40:15,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,454 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,454 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:15,485 INFO L120 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 [2019-11-16 00:40:15,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:15,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:15,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:15,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:15,490 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:15,490 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:15,599 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:40:15,675 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-16 00:40:15,675 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:40:15,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:40:15,679 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-16 00:40:15,679 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:40:15,680 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [1*ULTIMATE.start_test_fun_~a.offset >= 0] [2019-11-16 00:40:15,693 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:40:15,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:40:15,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:15,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:40:15,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:15,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:15,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:15,815 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 [2019-11-16 00:40:15,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-16 00:40:15,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2019-11-16 00:40:15,894 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 [2019-11-16 00:40:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:40:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-16 00:40:15,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-16 00:40:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:40:15,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:15,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-16 00:40:15,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:15,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-16 00:40:15,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:40:15,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2019-11-16 00:40:15,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:40:15,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:40:15,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-16 00:40:15,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:40:15,902 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-16 00:40:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-16 00:40:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-16 00:40:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:40:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-16 00:40:15,905 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-16 00:40:15,905 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-16 00:40:15,905 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:40:15,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-11-16 00:40:15,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:40:15,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:15,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:15,907 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:40:15,907 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:40:15,907 INFO L791 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 138#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 139#L565 assume !(main_~array_size~0 < 1); 141#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 142#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 145#L553-3 [2019-11-16 00:40:15,907 INFO L793 eck$LassoCheckResult]: Loop: 145#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 143#L553-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 145#L553-3 [2019-11-16 00:40:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-16 00:40:15,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:15,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072134570] [2019-11-16 00:40:15,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:15,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-11-16 00:40:15,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:15,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099077341] [2019-11-16 00:40:15,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:15,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-11-16 00:40:15,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:15,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739069018] [2019-11-16 00:40:15,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:15,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:16,169 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-16 00:40:16,233 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:40:16,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:40:16,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:40:16,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:40:16,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:40:16,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:40:16,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:40:16,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:40:16,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration3_Lasso [2019-11-16 00:40:16,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:40:16,234 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:40:16,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:16,762 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:40:16,762 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:40:16,763 INFO L120 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 [2019-11-16 00:40:16,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,766 INFO L120 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 [2019-11-16 00:40:16,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,768 INFO L120 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 [2019-11-16 00:40:16,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,775 INFO L120 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 [2019-11-16 00:40:16,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,777 INFO L120 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 [2019-11-16 00:40:16,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:16,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:16,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,782 INFO L120 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 [2019-11-16 00:40:16,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,785 INFO L120 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 [2019-11-16 00:40:16,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,787 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:16,787 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:16,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,790 INFO L120 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 [2019-11-16 00:40:16,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,791 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,793 INFO L120 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 [2019-11-16 00:40:16,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,795 INFO L120 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 [2019-11-16 00:40:16,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,798 INFO L120 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 [2019-11-16 00:40:16,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,800 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:16,800 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:16,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,802 INFO L120 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 [2019-11-16 00:40:16,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,804 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:16,804 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:16,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:16,806 INFO L120 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 [2019-11-16 00:40:16,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:16,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:16,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:16,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:16,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:16,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:16,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:16,810 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:40:16,816 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:40:16,816 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:40:16,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:40:16,817 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:40:16,817 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:40:16,817 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-11-16 00:40:16,831 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:40:16,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:40:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:16,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:16,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:16,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:16,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:16,908 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 [2019-11-16 00:40:16,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:40:16,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2019-11-16 00:40:16,954 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 [2019-11-16 00:40:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:40:16,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:40:16,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:16,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:40:16,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:16,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:40:16,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:16,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-11-16 00:40:16,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:40:16,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2019-11-16 00:40:16,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:40:16,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:40:16,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-11-16 00:40:16,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:40:16,960 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-11-16 00:40:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-11-16 00:40:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-11-16 00:40:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:40:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-11-16 00:40:16,963 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-16 00:40:16,964 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-16 00:40:16,964 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:40:16,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-11-16 00:40:16,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:40:16,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:16,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:16,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:16,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:40:16,966 INFO L791 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 243#L565 assume !(main_~array_size~0 < 1); 245#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 246#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 260#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 247#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 248#L557-2 [2019-11-16 00:40:16,967 INFO L793 eck$LassoCheckResult]: Loop: 248#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 251#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 248#L557-2 [2019-11-16 00:40:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-11-16 00:40:16,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:16,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900441272] [2019-11-16 00:40:16,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:16,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:16,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:16,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2019-11-16 00:40:16,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:16,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057947652] [2019-11-16 00:40:16,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:16,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:16,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:17,015 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2019-11-16 00:40:17,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:17,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843632995] [2019-11-16 00:40:17,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:17,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:17,047 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:17,248 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-16 00:40:17,322 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:40:17,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:40:17,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:40:17,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:40:17,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:40:17,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:40:17,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:40:17,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:40:17,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration4_Lasso [2019-11-16 00:40:17,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:40:17,323 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:40:17,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,493 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-11-16 00:40:17,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:17,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:40:17,882 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:40:17,882 INFO L120 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 [2019-11-16 00:40:17,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,883 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,884 INFO L120 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 [2019-11-16 00:40:17,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,886 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,886 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,888 INFO L120 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 [2019-11-16 00:40:17,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,889 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,889 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,891 INFO L120 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 [2019-11-16 00:40:17,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,891 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,892 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,892 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,893 INFO L120 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 [2019-11-16 00:40:17,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,895 INFO L120 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 [2019-11-16 00:40:17,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,896 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,896 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,899 INFO L120 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 [2019-11-16 00:40:17,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,901 INFO L120 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 [2019-11-16 00:40:17,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,903 INFO L120 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 [2019-11-16 00:40:17,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,904 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,905 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,906 INFO L120 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 [2019-11-16 00:40:17,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,907 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,907 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,908 INFO L120 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 [2019-11-16 00:40:17,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,911 INFO L120 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 [2019-11-16 00:40:17,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,918 INFO L120 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 [2019-11-16 00:40:17,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,920 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,920 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,922 INFO L120 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 [2019-11-16 00:40:17,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,924 INFO L120 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 [2019-11-16 00:40:17,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,926 INFO L120 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 [2019-11-16 00:40:17,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:17,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:17,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:17,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:17,928 INFO L120 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 [2019-11-16 00:40:17,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:17,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:17,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:17,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:17,930 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:17,930 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:17,949 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:40:17,954 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:40:17,954 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:40:17,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:40:17,955 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:40:17,955 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:40:17,956 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-11-16 00:40:17,978 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:40:17,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:40:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:18,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:18,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:18,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:18,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:18,048 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 [2019-11-16 00:40:18,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-16 00:40:18,071 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2019-11-16 00:40:18,073 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 [2019-11-16 00:40:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-16 00:40:18,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:40:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:18,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:40:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:18,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-16 00:40:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:18,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-11-16 00:40:18,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:40:18,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2019-11-16 00:40:18,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:40:18,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:40:18,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-11-16 00:40:18,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:40:18,077 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-16 00:40:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-11-16 00:40:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-16 00:40:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:40:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-16 00:40:18,082 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:40:18,083 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:40:18,083 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:40:18,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-16 00:40:18,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:40:18,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:18,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:18,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:18,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:40:18,085 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 363#L565 assume !(main_~array_size~0 < 1); 365#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 366#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 371#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 382#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 381#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 373#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 374#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 377#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 369#L553-3 [2019-11-16 00:40:18,085 INFO L793 eck$LassoCheckResult]: Loop: 369#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 367#L553-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 369#L553-3 [2019-11-16 00:40:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2019-11-16 00:40:18,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:18,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011971378] [2019-11-16 00:40:18,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:18,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-11-16 00:40:18,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:18,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851688383] [2019-11-16 00:40:18,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:18,131 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2019-11-16 00:40:18,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:18,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462955121] [2019-11-16 00:40:18,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:18,173 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:18,382 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-11-16 00:40:18,458 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:40:18,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:40:18,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:40:18,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:40:18,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:40:18,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:40:18,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:40:18,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:40:18,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration5_Lasso [2019-11-16 00:40:18,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:40:18,459 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:40:18,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:18,933 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:40:18,933 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:40:18,934 INFO L120 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 [2019-11-16 00:40:18,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,935 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,935 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,937 INFO L120 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 [2019-11-16 00:40:18,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,939 INFO L120 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 [2019-11-16 00:40:18,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,940 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,942 INFO L120 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 [2019-11-16 00:40:18,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,945 INFO L120 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 [2019-11-16 00:40:18,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,946 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,947 INFO L120 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 [2019-11-16 00:40:18,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,950 INFO L120 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 [2019-11-16 00:40:18,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,951 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,953 INFO L120 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 [2019-11-16 00:40:18,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,954 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,955 INFO L120 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 [2019-11-16 00:40:18,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,957 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,957 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,959 INFO L120 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 [2019-11-16 00:40:18,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,961 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,961 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,962 INFO L120 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 [2019-11-16 00:40:18,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,964 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,964 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,968 INFO L120 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 [2019-11-16 00:40:18,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,970 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,970 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,971 INFO L120 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 [2019-11-16 00:40:18,972 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,972 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,973 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,974 INFO L120 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 [2019-11-16 00:40:18,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,975 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,976 INFO L120 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 [2019-11-16 00:40:18,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,979 INFO L120 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 [2019-11-16 00:40:18,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,980 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,981 INFO L120 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 [2019-11-16 00:40:18,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,982 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:18,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,983 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:18,983 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:18,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,984 INFO L120 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 [2019-11-16 00:40:18,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,986 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,986 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,988 INFO L120 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 [2019-11-16 00:40:18,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:18,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,990 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:18,990 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:18,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:18,995 INFO L120 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 [2019-11-16 00:40:18,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:18,995 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:40:18,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:18,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:18,997 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:40:18,997 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:19,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:19,003 INFO L120 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 [2019-11-16 00:40:19,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:19,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:19,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:19,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:19,006 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:19,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:19,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:19,018 INFO L120 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 [2019-11-16 00:40:19,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:19,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:19,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:19,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:19,020 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:19,020 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:19,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:19,023 INFO L120 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 [2019-11-16 00:40:19,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:19,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:19,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:19,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:19,025 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:19,025 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:19,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:19,027 INFO L120 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 [2019-11-16 00:40:19,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:19,027 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:40:19,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:19,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:19,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:19,028 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:40:19,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:40:19,030 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:40:19,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:40:19,031 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:40:19,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:40:19,032 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:40:19,032 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:40:19,032 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_2 Supporting invariants [] [2019-11-16 00:40:19,043 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:40:19,044 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:40:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:19,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:19,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:19,085 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 [2019-11-16 00:40:19,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-16 00:40:19,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2019-11-16 00:40:19,110 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 [2019-11-16 00:40:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:40:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:40:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:19,110 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:40:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:19,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:19,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:19,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:40:19,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-16 00:40:19,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2019-11-16 00:40:19,213 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 [2019-11-16 00:40:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:40:19,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:40:19,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:19,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:40:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:19,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:19,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:19,251 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:40:19,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-16 00:40:19,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2019-11-16 00:40:19,282 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 [2019-11-16 00:40:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-16 00:40:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:40:19,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:40:19,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:40:19,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:19,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-11-16 00:40:19,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:40:19,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2019-11-16 00:40:19,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:40:19,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:40:19,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-11-16 00:40:19,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:40:19,288 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-16 00:40:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-11-16 00:40:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-11-16 00:40:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:40:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-11-16 00:40:19,290 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-16 00:40:19,290 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-16 00:40:19,290 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:40:19,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-11-16 00:40:19,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:40:19,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:19,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:19,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:19,297 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:40:19,298 INFO L791 eck$LassoCheckResult]: Stem: 663#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 661#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 662#L565 assume !(main_~array_size~0 < 1); 664#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 665#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 675#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 676#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 672#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 683#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 678#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 679#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 673#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 667#L557-2 [2019-11-16 00:40:19,298 INFO L793 eck$LassoCheckResult]: Loop: 667#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 667#L557-2 [2019-11-16 00:40:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2019-11-16 00:40:19,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:19,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347397952] [2019-11-16 00:40:19,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:19,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2019-11-16 00:40:19,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:19,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339108691] [2019-11-16 00:40:19,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:19,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2019-11-16 00:40:19,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:19,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043538391] [2019-11-16 00:40:19,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:19,373 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:19,599 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-11-16 00:40:19,658 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:40:19,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:40:19,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:40:19,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:40:19,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:40:19,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:40:19,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:40:19,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:40:19,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration6_Lasso [2019-11-16 00:40:19,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:40:19,659 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:40:19,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,797 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-16 00:40:19,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:19,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:40:20,127 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:40:20,127 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:40:20,128 INFO L120 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 [2019-11-16 00:40:20,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:20,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,129 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:20,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:20,131 INFO L120 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 [2019-11-16 00:40:20,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:20,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:20,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:20,143 INFO L120 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 [2019-11-16 00:40:20,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,144 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:40:20,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,146 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:40:20,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:20,151 INFO L120 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 [2019-11-16 00:40:20,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:20,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,153 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:20,153 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:20,155 INFO L120 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 [2019-11-16 00:40:20,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:20,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,156 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:20,156 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:20,158 INFO L120 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 [2019-11-16 00:40:20,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:20,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,159 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:20,160 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:40:20,163 INFO L120 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 [2019-11-16 00:40:20,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:40:20,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:40:20,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:40:20,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:40:20,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:40:20,165 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:40:20,169 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:40:20,171 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:40:20,171 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:40:20,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:40:20,172 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:40:20,173 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:40:20,173 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_3 Supporting invariants [] [2019-11-16 00:40:20,208 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:40:20,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:40:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:20,245 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 [2019-11-16 00:40:20,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-16 00:40:20,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2019-11-16 00:40:20,260 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 [2019-11-16 00:40:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-16 00:40:20,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:40:20,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:20,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:40:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:20,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:40:20,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-16 00:40:20,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2019-11-16 00:40:20,316 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 [2019-11-16 00:40:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-16 00:40:20,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:40:20,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:20,316 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:40:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:20,352 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:40:20,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-16 00:40:20,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2019-11-16 00:40:20,369 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 [2019-11-16 00:40:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:40:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-16 00:40:20,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:40:20,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:20,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-16 00:40:20,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:20,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2019-11-16 00:40:20,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:40:20,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-16 00:40:20,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:40:20,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-11-16 00:40:20,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:40:20,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:40:20,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:40:20,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:40:20,372 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:40:20,372 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:40:20,372 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:40:20,372 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:40:20,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:40:20,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:40:20,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:40:20,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:40:20 BoogieIcfgContainer [2019-11-16 00:40:20,378 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:40:20,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:40:20,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:40:20,379 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:40:20,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:13" (3/4) ... [2019-11-16 00:40:20,383 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:40:20,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:40:20,384 INFO L168 Benchmark]: Toolchain (without parser) took 7760.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 935.7 MB in the beginning and 1.0 GB in the end (delta: -97.5 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:20,385 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:20,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:20,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:20,386 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:20,387 INFO L168 Benchmark]: RCFGBuilder took 442.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:20,388 INFO L168 Benchmark]: BuchiAutomizer took 6622.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.2 MB). Peak memory consumption was 96.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:20,388 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-16 00:40:20,391 INFO L335 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 442.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6622.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.2 MB). Peak memory consumption was 96.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 88 SDslu, 9 SDs, 0 SdLazy, 106 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital154 mio100 ax111 hnf99 lsp80 ukn75 mio100 lsp53 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...