./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f42aa215a16d5e0efb670a585ba0238849a32fc4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:08:25,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:08:25,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:08:25,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:08:25,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:08:25,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:08:25,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:08:25,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:08:25,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:08:25,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:08:25,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:08:25,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:08:25,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:08:25,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:08:25,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:08:25,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:08:25,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:08:25,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:08:25,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:08:25,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:08:25,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:08:25,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:08:25,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:08:25,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:08:25,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:08:25,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:08:25,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:08:25,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:08:25,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:08:25,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:08:25,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:08:25,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:08:25,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:08:25,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:08:25,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:08:25,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:08:25,779 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:08:25,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:08:25,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:08:25,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:08:25,792 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:08:25,792 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:08:25,792 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:08:25,792 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:08:25,792 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:08:25,792 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:08:25,793 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:08:25,793 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:08:25,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:08:25,793 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:08:25,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:08:25,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:08:25,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:08:25,794 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:08:25,795 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:08:25,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:08:25,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:08:25,795 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:08:25,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:08:25,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:08:25,796 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:08:25,796 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:08:25,796 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2018-11-10 04:08:25,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:08:25,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:08:25,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:08:25,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:08:25,833 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:08:25,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:08:25,868 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/data/3957a32b4/63948505864c41409362f7c56dd5a510/FLAGd6f5b1c0c [2018-11-10 04:08:26,295 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:08:26,295 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:08:26,301 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/data/3957a32b4/63948505864c41409362f7c56dd5a510/FLAGd6f5b1c0c [2018-11-10 04:08:26,310 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/data/3957a32b4/63948505864c41409362f7c56dd5a510 [2018-11-10 04:08:26,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:08:26,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:08:26,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:08:26,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:08:26,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:08:26,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2e6dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26, skipping insertion in model container [2018-11-10 04:08:26,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:08:26,356 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:08:26,536 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:08:26,544 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:08:26,568 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:08:26,598 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:08:26,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26 WrapperNode [2018-11-10 04:08:26,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:08:26,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:08:26,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:08:26,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:08:26,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:08:26,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:08:26,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:08:26,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:08:26,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... [2018-11-10 04:08:26,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:08:26,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:08:26,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:08:26,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:08:26,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea44678d-2555-4509-a71a-b441bdfb8c0f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:08:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:08:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:08:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:08:26,863 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:08:26,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:08:26 BoogieIcfgContainer [2018-11-10 04:08:26,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:08:26,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:08:26,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:08:26,867 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:08:26,867 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:08:26,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:08:26" (1/3) ... [2018-11-10 04:08:26,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3638445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:08:26, skipping insertion in model container [2018-11-10 04:08:26,868 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:08:26,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:26" (2/3) ... [2018-11-10 04:08:26,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3638445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:08:26, skipping insertion in model container [2018-11-10 04:08:26,869 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:08:26,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:08:26" (3/3) ... [2018-11-10 04:08:26,871 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:08:26,906 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:08:26,907 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:08:26,907 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:08:26,907 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:08:26,907 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:08:26,907 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:08:26,907 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:08:26,907 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:08:26,907 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:08:26,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 04:08:26,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:08:26,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:26,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:26,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:08:26,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:08:26,935 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:08:26,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 04:08:26,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:08:26,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:26,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:26,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:08:26,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:08:26,944 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 14#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L558-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 8#L545-4true [2018-11-10 04:08:26,945 INFO L795 eck$LassoCheckResult]: Loop: 8#L545-4true assume true; 20#L545-1true assume !!(test_fun_~i~0 < test_fun_~N); 22#L546-4true assume !true; 3#L550-3true assume !true; 7#L545-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 8#L545-4true [2018-11-10 04:08:26,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 04:08:26,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:26,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:26,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 41206463, now seen corresponding path program 1 times [2018-11-10 04:08:27,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:27,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:27,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:08:27,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:08:27,052 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:08:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:08:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:08:27,062 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-10 04:08:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:08:27,066 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-10 04:08:27,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:08:27,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-10 04:08:27,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:08:27,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 24 transitions. [2018-11-10 04:08:27,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 04:08:27,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:08:27,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 04:08:27,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:08:27,073 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:08:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 04:08:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 04:08:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 04:08:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 04:08:27,094 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:08:27,094 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:08:27,094 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:08:27,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-10 04:08:27,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:08:27,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:27,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:27,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:08:27,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:27,096 INFO L793 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 60#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 61#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 66#L545-4 [2018-11-10 04:08:27,096 INFO L795 eck$LassoCheckResult]: Loop: 66#L545-4 assume true; 70#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 71#L546-4 assume true; 67#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 68#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 59#L550-3 assume true; 62#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 77#L550-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 73#L545-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 66#L545-4 [2018-11-10 04:08:27,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:27,096 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 04:08:27,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:27,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2145679071, now seen corresponding path program 1 times [2018-11-10 04:08:27,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:27,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash 632420219, now seen corresponding path program 1 times [2018-11-10 04:08:27,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:27,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:27,381 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:27,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:27,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:27,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:27,383 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:27,383 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:27,383 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:27,383 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:27,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 04:08:27,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:27,383 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:27,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:27,850 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:27,853 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:27,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:27,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:27,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:27,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:27,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:27,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:27,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:27,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:27,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:27,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:27,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:27,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:27,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:27,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:27,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:27,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:27,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:27,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:27,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:27,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:27,971 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:08:27,971 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:08:27,973 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:27,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:08:27,975 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:27,975 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-10 04:08:27,993 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 04:08:27,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:08:28,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:28,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:28,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:28,046 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:08:28,046 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 04:08:28,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-11-10 04:08:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:08:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 04:08:28,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-10 04:08:28,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:28,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-10 04:08:28,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:28,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-10 04:08:28,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:28,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-10 04:08:28,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 04:08:28,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 47 transitions. [2018-11-10 04:08:28,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 04:08:28,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 04:08:28,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-10 04:08:28,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:08:28,089 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 04:08:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-10 04:08:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-10 04:08:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 04:08:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-10 04:08:28,092 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-10 04:08:28,092 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-10 04:08:28,092 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:08:28,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2018-11-10 04:08:28,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 04:08:28,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:28,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:28,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:08:28,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:28,093 INFO L793 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 199#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 200#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 209#L545-4 assume true; 216#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 217#L546-4 [2018-11-10 04:08:28,093 INFO L795 eck$LassoCheckResult]: Loop: 217#L546-4 assume true; 210#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 211#L546-2 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 203#L547 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547 204#L547-1 test_fun_#t~post5 := test_fun_#t~mem4; 207#L547-2 SUMMARY for call write~int(test_fun_#t~post5 + 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547-2 214#L547-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 217#L546-4 [2018-11-10 04:08:28,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 04:08:28,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:28,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-11-10 04:08:28,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:28,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:28,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,114 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-11-10 04:08:28,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:28,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:28,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:28,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,276 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:28,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:28,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:28,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:28,276 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:28,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:28,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:28,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:28,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 04:08:28,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:28,277 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:28,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:28,609 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:28,609 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:28,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,641 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:28,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,643 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:28,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:28,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:28,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:28,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:28,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:28,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:28,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:28,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:28,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:28,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:28,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:28,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:28,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:08:28,675 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:08:28,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:28,676 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:08:28,676 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:28,676 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-10 04:08:28,689 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 04:08:28,690 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:08:28,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:28,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:28,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:28,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:28,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-11-10 04:08:28,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 33 [2018-11-10 04:08:28,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:28,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:28,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:28,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-11-10 04:08:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:28,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:28,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-10 04:08:28,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 94 states and 105 transitions. Complement of second has 13 states. [2018-11-10 04:08:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 04:08:28,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 04:08:28,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:28,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 04:08:28,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:28,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 04:08:28,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:28,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 105 transitions. [2018-11-10 04:08:28,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 04:08:28,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 75 states and 86 transitions. [2018-11-10 04:08:28,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 04:08:28,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 04:08:28,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 86 transitions. [2018-11-10 04:08:28,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:08:28,890 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-10 04:08:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 86 transitions. [2018-11-10 04:08:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2018-11-10 04:08:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 04:08:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-11-10 04:08:28,894 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-11-10 04:08:28,894 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-11-10 04:08:28,894 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:08:28,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 71 transitions. [2018-11-10 04:08:28,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 04:08:28,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:28,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:28,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:28,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:28,895 INFO L793 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 419#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 420#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 429#L545-4 assume true; 436#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 437#L546-4 assume true; 430#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 431#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 416#L550-3 [2018-11-10 04:08:28,896 INFO L795 eck$LassoCheckResult]: Loop: 416#L550-3 assume true; 421#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 456#L550-1 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 452#L551 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 453#L551-1 test_fun_#t~post9 := test_fun_#t~mem8; 458#L551-2 SUMMARY for call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-2 415#L551-3 havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := test_fun_#t~post10 + 1;havoc test_fun_#t~post10; 416#L550-3 [2018-11-10 04:08:28,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924623, now seen corresponding path program 1 times [2018-11-10 04:08:28,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1081526739, now seen corresponding path program 1 times [2018-11-10 04:08:28,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:28,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1589097121, now seen corresponding path program 1 times [2018-11-10 04:08:28,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:28,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,091 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:29,091 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:29,091 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:29,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:29,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:29,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:29,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:29,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:29,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 04:08:29,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:29,092 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:29,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,376 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:29,376 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:29,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:29,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:29,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:29,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:29,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:29,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:29,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:29,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:29,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:29,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:29,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:29,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:29,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:29,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:29,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:29,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:29,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:29,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:29,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:29,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:29,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:29,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:29,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:29,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,401 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:29,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,402 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:29,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:29,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:29,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:29,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:29,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:29,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:29,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:29,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:29,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:29,412 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:29,413 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:08:29,414 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:08:29,414 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:29,414 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:08:29,415 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:29,415 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_3 Supporting invariants [] [2018-11-10 04:08:29,427 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 04:08:29,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:08:29,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:29,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:29,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:29,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:29,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 04:08:29,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-11-10 04:08:29,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:29,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:29,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:29,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 04:08:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:29,548 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:29,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-10 04:08:29,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 92 states and 105 transitions. Complement of second has 13 states. [2018-11-10 04:08:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 04:08:29,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 04:08:29,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:29,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-10 04:08:29,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:29,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 14 letters. [2018-11-10 04:08:29,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:29,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 105 transitions. [2018-11-10 04:08:29,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 04:08:29,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 61 states and 70 transitions. [2018-11-10 04:08:29,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 04:08:29,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 04:08:29,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 70 transitions. [2018-11-10 04:08:29,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:08:29,616 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-10 04:08:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 70 transitions. [2018-11-10 04:08:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-10 04:08:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 04:08:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-10 04:08:29,623 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-10 04:08:29,623 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-10 04:08:29,623 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:08:29,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-11-10 04:08:29,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 04:08:29,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:29,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:29,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:29,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:29,625 INFO L793 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 694#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 671#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 672#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 681#L545-4 assume true; 692#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 693#L546-4 assume true; 719#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 717#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 713#L550-3 assume true; 711#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 708#L550-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 695#L545-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 696#L545-4 assume true; 691#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 688#L546-4 [2018-11-10 04:08:29,629 INFO L795 eck$LassoCheckResult]: Loop: 688#L546-4 assume true; 684#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 685#L546-2 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 675#L547 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547 676#L547-1 test_fun_#t~post5 := test_fun_#t~mem4; 679#L547-2 SUMMARY for call write~int(test_fun_#t~post5 + 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L547-2 682#L547-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 688#L546-4 [2018-11-10 04:08:29,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2129525152, now seen corresponding path program 2 times [2018-11-10 04:08:29,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:29,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:29,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-11-10 04:08:29,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:29,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:29,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2022717757, now seen corresponding path program 1 times [2018-11-10 04:08:29,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:29,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:29,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:29,882 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-11-10 04:08:29,928 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:29,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:29,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:29,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:29,928 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:29,928 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:29,928 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:29,928 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:29,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 04:08:29,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:29,928 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:29,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:29,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:30,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:30,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:30,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:30,335 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:30,335 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:30,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,365 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:30,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,366 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:30,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:30,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:30,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:30,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:30,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:30,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:30,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:30,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:30,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:30,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:30,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:30,391 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:30,392 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:08:30,392 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:08:30,392 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:30,392 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:08:30,393 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:30,393 INFO L519 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 (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-10 04:08:30,424 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 04:08:30,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:08:30,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:30,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:30,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:30,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:30,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-11-10 04:08:30,500 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:08:30,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-11-10 04:08:30,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-11-10 04:08:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:30,521 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:30,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 04:08:30,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 86 states and 97 transitions. Complement of second has 13 states. [2018-11-10 04:08:30,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 04:08:30,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-10 04:08:30,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:30,568 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:08:30,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:30,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:30,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:30,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:30,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-11-10 04:08:30,626 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:08:30,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-11-10 04:08:30,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-11-10 04:08:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:30,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:30,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 04:08:30,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 85 states and 96 transitions. Complement of second has 15 states. [2018-11-10 04:08:30,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-10 04:08:30,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-10 04:08:30,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:30,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:08:30,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:30,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:30,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:30,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:30,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-11-10 04:08:30,754 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:08:30,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-11-10 04:08:30,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:30,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-11-10 04:08:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:30,772 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:30,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 04:08:30,816 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 125 states and 140 transitions. Complement of second has 12 states. [2018-11-10 04:08:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-10 04:08:30,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-10 04:08:30,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:30,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 22 letters. Loop has 7 letters. [2018-11-10 04:08:30,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:30,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-10 04:08:30,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:30,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 140 transitions. [2018-11-10 04:08:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:08:30,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 89 states and 101 transitions. [2018-11-10 04:08:30,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 04:08:30,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 04:08:30,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 101 transitions. [2018-11-10 04:08:30,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:08:30,821 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-11-10 04:08:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 101 transitions. [2018-11-10 04:08:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-11-10 04:08:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 04:08:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-10 04:08:30,825 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 04:08:30,825 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 04:08:30,825 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:08:30,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2018-11-10 04:08:30,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:08:30,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:30,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:30,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:30,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:30,826 INFO L793 eck$LassoCheckResult]: Stem: 1352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1326#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1327#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;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; 1334#L545-4 assume true; 1344#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 1345#L546-4 assume true; 1338#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 1339#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1380#L550-3 assume true; 1330#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 1361#L550-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1350#L545-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 1351#L545-4 assume true; 1342#L545-1 assume !!(test_fun_~i~0 < test_fun_~N); 1343#L546-4 assume true; 1336#L546-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-1 1337#L546-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1323#L550-3 [2018-11-10 04:08:30,826 INFO L795 eck$LassoCheckResult]: Loop: 1323#L550-3 assume true; 1328#L550 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L550 1360#L550-1 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1354#L551 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 1355#L551-1 test_fun_#t~post9 := test_fun_#t~mem8; 1358#L551-2 SUMMARY for call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-2 1322#L551-3 havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := test_fun_#t~post10 + 1;havoc test_fun_#t~post10; 1323#L550-3 [2018-11-10 04:08:30,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 278147897, now seen corresponding path program 3 times [2018-11-10 04:08:30,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:30,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:30,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:30,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:30,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:30,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1081526739, now seen corresponding path program 2 times [2018-11-10 04:08:30,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:30,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:30,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash 900166645, now seen corresponding path program 1 times [2018-11-10 04:08:30,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:30,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:30,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:31,002 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-11-10 04:08:31,043 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:31,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:31,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:31,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:31,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:31,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:31,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:31,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:31,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 04:08:31,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:31,043 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:31,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:31,421 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:31,421 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:31,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:31,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:31,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:31,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:31,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:31,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:31,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:31,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:31,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:31,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:31,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:31,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:31,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:31,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:31,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:31,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:31,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:31,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:31,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:31,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:31,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,446 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:31,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,447 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:31,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:31,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:31,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:31,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:31,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:31,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:31,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:31,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:31,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:31,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:31,460 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:08:31,461 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:08:31,461 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:31,462 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:08:31,462 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:31,462 INFO L519 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 (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-11-10 04:08:31,505 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 04:08:31,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:08:31,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:31,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:31,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:31,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:31,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 04:08:31,562 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:08:31,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 04:08:31,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 04:08:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:31,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:31,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 04:08:31,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 79 states and 92 transitions. Complement of second has 13 states. [2018-11-10 04:08:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 04:08:31,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-10 04:08:31,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:31,613 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:08:31,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:31,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:31,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:31,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:31,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 04:08:31,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:08:31,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 04:08:31,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 04:08:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:31,694 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:31,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 04:08:31,729 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 78 states and 91 transitions. Complement of second has 15 states. [2018-11-10 04:08:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-10 04:08:31,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-10 04:08:31,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:31,730 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:08:31,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:31,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:31,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:31,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:08:31,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 04:08:31,802 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:08:31,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 04:08:31,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:08:31,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 04:08:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:08:31,823 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 04:08:31,823 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 04:08:31,853 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 93 states and 109 transitions. Complement of second has 12 states. [2018-11-10 04:08:31,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 04:08:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-10 04:08:31,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-10 04:08:31,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:31,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 25 letters. Loop has 7 letters. [2018-11-10 04:08:31,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:31,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 18 letters. Loop has 14 letters. [2018-11-10 04:08:31,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:31,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 109 transitions. [2018-11-10 04:08:31,856 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:08:31,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 0 states and 0 transitions. [2018-11-10 04:08:31,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:08:31,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:08:31,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:08:31,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:08:31,856 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:08:31,857 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:08:31,857 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:08:31,857 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:08:31,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:08:31,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:08:31,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:08:31,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:08:31 BoogieIcfgContainer [2018-11-10 04:08:31,862 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:08:31,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:08:31,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:08:31,863 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:08:31,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:08:26" (3/4) ... [2018-11-10 04:08:31,866 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:08:31,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:08:31,866 INFO L168 Benchmark]: Toolchain (without parser) took 5554.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.3 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -279.6 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:31,867 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:08:31,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.33 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 929.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:31,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 929.6 MB in the beginning and 1.2 GB in the end (delta: -254.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:31,868 INFO L168 Benchmark]: Boogie Preprocessor took 14.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:08:31,868 INFO L168 Benchmark]: RCFGBuilder took 182.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:31,869 INFO L168 Benchmark]: BuchiAutomizer took 4998.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -67.7 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:31,869 INFO L168 Benchmark]: Witness Printer took 3.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:08:31,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.33 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 929.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 929.6 MB in the beginning and 1.2 GB in the end (delta: -254.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 182.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4998.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -67.7 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 191 SDtfs, 201 SDslu, 130 SDs, 0 SdLazy, 284 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf99 lsp90 ukn88 mio100 lsp49 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...