./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:15:07,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:15:07,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:15:07,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:15:07,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:15:07,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:15:07,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:15:07,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:15:07,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:15:07,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:15:07,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:15:07,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:15:07,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:15:07,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:15:07,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:15:07,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:15:07,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:15:07,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:15:07,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:15:07,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:15:07,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:15:07,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:15:07,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:15:07,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:15:07,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:15:07,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:15:07,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:15:07,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:15:07,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:15:07,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:15:07,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:15:07,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:15:07,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:15:07,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:15:07,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:15:07,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:15:07,647 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:15:07,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:15:07,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:15:07,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:15:07,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:15:07,658 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:15:07,659 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:15:07,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:15:07,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:15:07,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:15:07,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:15:07,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:15:07,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:15:07,661 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:15:07,661 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:15:07,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:15:07,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:15:07,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:15:07,662 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:15:07,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:15:07,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:15:07,662 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:15:07,662 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:15:07,662 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_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2018-11-22 22:15:07,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:15:07,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:15:07,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:15:07,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:15:07,698 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:15:07,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-22 22:15:07,738 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/data/1b7f8c698/499965ae50bd4493bbce9b15fe956adc/FLAG1323e22f2 [2018-11-22 22:15:08,100 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:15:08,100 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-22 22:15:08,108 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/data/1b7f8c698/499965ae50bd4493bbce9b15fe956adc/FLAG1323e22f2 [2018-11-22 22:15:08,497 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/bin-2019/uautomizer/data/1b7f8c698/499965ae50bd4493bbce9b15fe956adc [2018-11-22 22:15:08,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:15:08,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:15:08,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:15:08,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:15:08,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:15:08,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6b7d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08, skipping insertion in model container [2018-11-22 22:15:08,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:15:08,536 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:15:08,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:15:08,721 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:15:08,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:15:08,821 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:15:08,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08 WrapperNode [2018-11-22 22:15:08,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:15:08,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:15:08,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:15:08,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:15:08,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:15:08,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:15:08,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:15:08,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:15:08,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... [2018-11-22 22:15:08,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:15:08,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:15:08,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:15:08,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:15:08,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cb22276-b395-46ec-a831-3995404a5987/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-22 22:15:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:15:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:15:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:15:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:15:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:15:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:15:09,087 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:15:09,087 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 22:15:09,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:15:09 BoogieIcfgContainer [2018-11-22 22:15:09,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:15:09,088 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:15:09,088 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:15:09,090 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:15:09,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:15:09,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:15:08" (1/3) ... [2018-11-22 22:15:09,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fc7d2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:15:09, skipping insertion in model container [2018-11-22 22:15:09,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:15:09,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:08" (2/3) ... [2018-11-22 22:15:09,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fc7d2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:15:09, skipping insertion in model container [2018-11-22 22:15:09,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:15:09,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:15:09" (3/3) ... [2018-11-22 22:15:09,093 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-22 22:15:09,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:15:09,126 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:15:09,126 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:15:09,126 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:15:09,126 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:15:09,126 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:15:09,126 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:15:09,126 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:15:09,126 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:15:09,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:15:09,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:09,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:09,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:09,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 22:15:09,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:09,155 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:15:09,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:15:09,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:09,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:09,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:09,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 22:15:09,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:09,161 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2018-11-22 22:15:09,161 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2018-11-22 22:15:09,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 22:15:09,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:09,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:09,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2018-11-22 22:15:09,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:09,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:09,299 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-22 22:15:09,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:15:09,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:15:09,303 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:15:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:15:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:15:09,313 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2018-11-22 22:15:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:15:09,374 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-22 22:15:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:15:09,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-22 22:15:09,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-22 22:15:09,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2018-11-22 22:15:09,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:15:09,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:15:09,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-22 22:15:09,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:15:09,382 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 22:15:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-22 22:15:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-22 22:15:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-22 22:15:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-22 22:15:09,399 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-22 22:15:09,399 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-22 22:15:09,399 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:15:09,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-22 22:15:09,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 22:15:09,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:09,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:09,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 22:15:09,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:09,401 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2018-11-22 22:15:09,401 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 53#L559-2 [2018-11-22 22:15:09,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-22 22:15:09,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:09,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2018-11-22 22:15:09,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:15:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2018-11-22 22:15:09,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:09,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:09,677 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-11-22 22:15:09,936 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-22 22:15:10,024 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:15:10,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:15:10,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:15:10,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:15:10,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:15:10,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:15:10,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:15:10,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:15:10,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-22 22:15:10,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:15:10,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:15:10,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,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-22 22:15:10,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,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-22 22:15:10,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-22 22:15:10,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-22 22:15:10,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,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-22 22:15:10,264 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-22 22:15:10,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:10,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:15:10,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:15:10,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:10,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:10,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,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-22 22:15:10,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:10,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:10,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:10,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:10,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:10,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:10,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:10,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:10,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:10,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:10,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:10,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:10,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:10,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:10,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:10,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:10,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:10,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:10,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:10,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:10,743 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:15:10,755 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:15:10,756 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:15:10,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:15:10,759 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:15:10,759 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:15:10,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-22 22:15:10,827 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-22 22:15:10,832 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:15:10,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:10,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:10,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:10,937 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-22 22:15:10,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-22 22:15:10,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-22 22:15:11,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 31 states and 45 transitions. Complement of second has 8 states. [2018-11-22 22:15:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 22:15:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:15:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-22 22:15:11,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-22 22:15:11,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:11,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-22 22:15:11,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:11,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-22 22:15:11,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:11,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2018-11-22 22:15:11,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 22:15:11,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2018-11-22 22:15:11,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:15:11,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 22:15:11,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2018-11-22 22:15:11,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:11,020 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-22 22:15:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2018-11-22 22:15:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-22 22:15:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:15:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-11-22 22:15:11,022 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-22 22:15:11,022 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-22 22:15:11,022 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:15:11,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2018-11-22 22:15:11,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 22:15:11,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:11,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:11,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:15:11,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:11,024 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 257#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2018-11-22 22:15:11,024 INFO L796 eck$LassoCheckResult]: Loop: 240#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 254#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 259#L555-4 assume test_fun_#t~short13; 243#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 244#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 251#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 246#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 247#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 239#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2018-11-22 22:15:11,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-22 22:15:11,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:11,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:11,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2018-11-22 22:15:11,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:11,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:11,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:11,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash -198955769, now seen corresponding path program 1 times [2018-11-22 22:15:11,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:11,238 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2018-11-22 22:15:11,536 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-22 22:15:11,726 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-22 22:15:11,728 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:15:11,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:15:11,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:15:11,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:15:11,729 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:15:11,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:15:11,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:15:11,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:15:11,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-22 22:15:11,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:15:11,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:15:11,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:11,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:12,147 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-22 22:15:12,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:12,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:12,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:15:12,713 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:15:12,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:12,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:12,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:12,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,802 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:12,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,804 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:12,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,812 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:12,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:12,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:12,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:12,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:12,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,822 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:12,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:12,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:12,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:12,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:12,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:12,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:12,827 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:12,827 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:15:12,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:12,834 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-22 22:15:12,834 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 22:15:12,886 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:15:12,927 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:15:12,927 INFO L444 ModelExtractionUtils]: 48 out of 56 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 22:15:12,927 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:15:12,929 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-22 22:15:12,929 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:15:12,929 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-22 22:15:13,022 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-22 22:15:13,023 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:15:13,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:13,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:13,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:13,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:15:13,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2018-11-22 22:15:13,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:15:13,162 INFO L478 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 52 treesize of output 39 [2018-11-22 22:15:13,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:15:13,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:15:13,206 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2018-11-22 22:15:13,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-22 22:15:13,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 22:15:13,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:15:13,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-22 22:15:13,261 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-22 22:15:13,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-22 22:15:13,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-22 22:15:13,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 64 states and 97 transitions. Complement of second has 10 states. [2018-11-22 22:15:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-22 22:15:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 22:15:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-22 22:15:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2018-11-22 22:15:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2018-11-22 22:15:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2018-11-22 22:15:13,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:13,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. [2018-11-22 22:15:13,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 22:15:13,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2018-11-22 22:15:13,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-22 22:15:13,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 22:15:13,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2018-11-22 22:15:13,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:13,367 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 97 transitions. [2018-11-22 22:15:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2018-11-22 22:15:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-22 22:15:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-22 22:15:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-11-22 22:15:13,372 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-11-22 22:15:13,372 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-11-22 22:15:13,372 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:15:13,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2018-11-22 22:15:13,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 22:15:13,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:13,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:13,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:15:13,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:13,374 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 513#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 514#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 552#L555-1 assume !test_fun_#t~short8; 516#L555-3 [2018-11-22 22:15:13,375 INFO L796 eck$LassoCheckResult]: Loop: 516#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 517#L555-4 assume test_fun_#t~short13; 519#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 507#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 508#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 502#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 503#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 495#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 496#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 516#L555-3 [2018-11-22 22:15:13,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-22 22:15:13,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:13,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 1 times [2018-11-22 22:15:13,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:13,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:13,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:13,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2029276831, now seen corresponding path program 1 times [2018-11-22 22:15:13,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:13,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:13,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:15:13,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:15:13,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:15:13,559 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2018-11-22 22:15:13,728 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-22 22:15:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:15:13,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:15:13,729 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-22 22:15:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:15:13,749 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2018-11-22 22:15:13,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:15:13,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2018-11-22 22:15:13,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-22 22:15:13,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 130 transitions. [2018-11-22 22:15:13,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-22 22:15:13,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-22 22:15:13,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2018-11-22 22:15:13,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:13,754 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2018-11-22 22:15:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2018-11-22 22:15:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-11-22 22:15:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-22 22:15:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2018-11-22 22:15:13,758 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2018-11-22 22:15:13,759 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2018-11-22 22:15:13,759 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:15:13,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2018-11-22 22:15:13,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-22 22:15:13,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:13,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:13,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:15:13,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:13,760 INFO L794 eck$LassoCheckResult]: Stem: 680#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 678#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 679#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 709#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 690#L555-3 [2018-11-22 22:15:13,760 INFO L796 eck$LassoCheckResult]: Loop: 690#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 719#L555-4 assume test_fun_#t~short13; 718#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 669#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 670#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 665#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 666#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 658#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 659#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 690#L555-3 [2018-11-22 22:15:13,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-11-22 22:15:13,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:13,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:13,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 2 times [2018-11-22 22:15:13,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:13,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:13,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:13,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:13,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1872663455, now seen corresponding path program 1 times [2018-11-22 22:15:13,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:13,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:15:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:13,935 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2018-11-22 22:15:14,054 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-22 22:15:14,335 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-11-22 22:15:14,633 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-22 22:15:14,635 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:15:14,635 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:15:14,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:15:14,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:15:14,635 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:15:14,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:15:14,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:15:14,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:15:14,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-22 22:15:14,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:15:14,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:15:14,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:14,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,070 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-22 22:15:15,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:15,535 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-22 22:15:15,689 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:15:15,689 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:15:15,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:15,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:15,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:15,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:15,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:15,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:15,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:15,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:15,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:15,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:15,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:15:15,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:15,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:15,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:15,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:15,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:15,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:15,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:15,733 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:15,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:15:15,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:15,742 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-22 22:15:15,742 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 22:15:15,902 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:15:15,965 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:15:15,965 INFO L444 ModelExtractionUtils]: 53 out of 66 variables were initially zero. Simplification set additionally 11 variables to zero. [2018-11-22 22:15:15,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:15:15,967 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-22 22:15:15,967 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:15:15,968 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-22 22:15:16,063 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-22 22:15:16,064 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:15:16,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:16,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:16,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:16,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:15:16,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2018-11-22 22:15:16,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:15:16,198 INFO L478 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 52 treesize of output 39 [2018-11-22 22:15:16,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:15:16,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:15:16,223 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2018-11-22 22:15:16,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-22 22:15:16,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-22 22:15:16,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:15:16,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-22 22:15:16,263 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-22 22:15:16,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-22 22:15:16,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-22 22:15:16,344 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 204 states and 297 transitions. Complement of second has 10 states. [2018-11-22 22:15:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-22 22:15:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 22:15:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-22 22:15:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-22 22:15:16,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-22 22:15:16,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:16,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-22 22:15:16,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:16,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. [2018-11-22 22:15:16,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:16,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2018-11-22 22:15:16,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:15:16,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:15:16,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2018-11-22 22:15:16,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:16,352 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-11-22 22:15:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2018-11-22 22:15:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-22 22:15:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-22 22:15:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2018-11-22 22:15:16,354 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-11-22 22:15:16,354 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-11-22 22:15:16,354 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:15:16,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2018-11-22 22:15:16,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:16,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:16,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:16,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:15:16,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:16,355 INFO L794 eck$LassoCheckResult]: Stem: 1117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1115#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1116#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1144#L555-1 assume !test_fun_#t~short8; 1118#L555-3 [2018-11-22 22:15:16,355 INFO L796 eck$LassoCheckResult]: Loop: 1118#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1119#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1122#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1092#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1093#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1100#L555-10 assume !test_fun_#t~short16; 1107#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1102#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1103#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1096#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1097#L555-1 assume !test_fun_#t~short8; 1118#L555-3 [2018-11-22 22:15:16,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-22 22:15:16,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:16,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:16,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1675651104, now seen corresponding path program 1 times [2018-11-22 22:15:16,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:16,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:16,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:15:16,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:16,398 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-22 22:15:16,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:15:16,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:15:16,398 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:15:16,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:15:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:15:16,399 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-22 22:15:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:15:16,413 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-22 22:15:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:15:16,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-11-22 22:15:16,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:16,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2018-11-22 22:15:16,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:15:16,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:15:16,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2018-11-22 22:15:16,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:16,416 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-22 22:15:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2018-11-22 22:15:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-22 22:15:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-22 22:15:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-11-22 22:15:16,419 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-22 22:15:16,419 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-22 22:15:16,419 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:15:16,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2018-11-22 22:15:16,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:16,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:16,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:16,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:15:16,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:16,420 INFO L794 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1234#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1214#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1215#L555-1 assume !test_fun_#t~short8; 1236#L555-3 [2018-11-22 22:15:16,420 INFO L796 eck$LassoCheckResult]: Loop: 1236#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1237#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1240#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1210#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1211#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1219#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1226#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1221#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1222#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1243#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1246#L555-1 assume !test_fun_#t~short8; 1236#L555-3 [2018-11-22 22:15:16,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2018-11-22 22:15:16,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:16,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:16,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1732909406, now seen corresponding path program 1 times [2018-11-22 22:15:16,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:16,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:15:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:16,496 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-22 22:15:16,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:15:16,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:15:16,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:15:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:15:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:15:16,497 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand 7 states. [2018-11-22 22:15:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:15:16,581 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-22 22:15:16,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:15:16,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2018-11-22 22:15:16,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:16,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 86 transitions. [2018-11-22 22:15:16,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:15:16,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:15:16,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2018-11-22 22:15:16,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:16,584 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-11-22 22:15:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2018-11-22 22:15:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-22 22:15:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-22 22:15:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2018-11-22 22:15:16,587 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-11-22 22:15:16,587 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-11-22 22:15:16,587 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 22:15:16,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2018-11-22 22:15:16,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-22 22:15:16,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:16,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:16,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:15:16,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:16,588 INFO L794 eck$LassoCheckResult]: Stem: 1378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1376#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1377#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1413#L555-1 assume !test_fun_#t~short8; 1379#L555-3 [2018-11-22 22:15:16,588 INFO L796 eck$LassoCheckResult]: Loop: 1379#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1380#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1382#L555-6 assume !test_fun_#t~short12; 1358#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1359#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1366#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1372#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~mem7;havoc test_fun_#t~short16;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~short8;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1368#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1369#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1362#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1363#L555-1 assume !test_fun_#t~short8; 1379#L555-3 [2018-11-22 22:15:16,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2018-11-22 22:15:16,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:16,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:16,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1052851036, now seen corresponding path program 1 times [2018-11-22 22:15:16,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:15:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:16,630 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-22 22:15:16,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:15:16,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:15:16,630 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:15:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:15:16,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:15:16,631 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-22 22:15:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:15:16,662 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-22 22:15:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:15:16,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2018-11-22 22:15:16,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:15:16,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2018-11-22 22:15:16,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:15:16,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:15:16,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:15:16,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:15:16,664 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:15:16,664 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:15:16,664 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:15:16,664 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 22:15:16,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:15:16,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:15:16,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:15:16,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:15:16 BoogieIcfgContainer [2018-11-22 22:15:16,670 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:15:16,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:15:16,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:15:16,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:15:16,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:15:09" (3/4) ... [2018-11-22 22:15:16,673 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:15:16,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:15:16,674 INFO L168 Benchmark]: Toolchain (without parser) took 8174.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.2 MB). Free memory was 956.4 MB in the beginning and 993.9 MB in the end (delta: -37.4 MB). Peak memory consumption was 366.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:15:16,675 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:15:16,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:15:16,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.47 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:15:16,676 INFO L168 Benchmark]: Boogie Preprocessor took 18.53 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:15:16,676 INFO L168 Benchmark]: RCFGBuilder took 218.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:15:16,677 INFO L168 Benchmark]: BuchiAutomizer took 7581.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 993.9 MB in the end (delta: 153.9 MB). Peak memory consumption was 374.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:15:16,677 INFO L168 Benchmark]: Witness Printer took 3.50 ms. Allocated memory is still 1.4 GB. Free memory is still 993.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:15:16,679 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.47 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.53 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 218.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7581.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 993.9 MB in the end (delta: 153.9 MB). Peak memory consumption was 374.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.50 ms. Allocated memory is still 1.4 GB. Free memory is still 993.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 80 SDslu, 179 SDs, 0 SdLazy, 214 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital501 mio100 ax104 hnf99 lsp73 ukn72 mio100 lsp30 div100 bol107 ite100 ukn100 eq162 hnf90 smp91 dnf263 smp65 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 102ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...