./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-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_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:25:41,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:25:41,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:25:41,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:25:41,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:25:41,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:25:41,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:25:41,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:25:41,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:25:41,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:25:41,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:25:41,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:25:41,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:25:41,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:25:41,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:25:41,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:25:41,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:25:41,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:25:41,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:25:41,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:25:41,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:25:41,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:25:41,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:25:41,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:25:41,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:25:41,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:25:41,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:25:41,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:25:41,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:25:41,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:25:41,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:25:41,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:25:41,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:25:41,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:25:41,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:25:41,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:25:41,828 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 21:25:41,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:25:41,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:25:41,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:25:41,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:25:41,841 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:25:41,841 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:25:41,842 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:25:41,842 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:25:41,842 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:25:41,842 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:25:41,842 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:25:41,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:25:41,842 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:25:41,843 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:25:41,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:25:41,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:25:41,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:25:41,844 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:25:41,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:25:41,844 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:25:41,844 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:25:41,845 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:25:41,845 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_63efcf62-0066-4082-8857-fc06014859e9/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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2018-11-22 21:25:41,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:25:41,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:25:41,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:25:41,878 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:25:41,878 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:25:41,878 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-22 21:25:41,919 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/data/aef6d208d/8cf2d5f11e9441d59ee00fcc98830bee/FLAG17196ddaf [2018-11-22 21:25:42,268 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:25:42,268 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-22 21:25:42,276 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/data/aef6d208d/8cf2d5f11e9441d59ee00fcc98830bee/FLAG17196ddaf [2018-11-22 21:25:42,287 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/data/aef6d208d/8cf2d5f11e9441d59ee00fcc98830bee [2018-11-22 21:25:42,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:25:42,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:25:42,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:25:42,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:25:42,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:25:42,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7ad327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42, skipping insertion in model container [2018-11-22 21:25:42,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:25:42,335 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:25:42,544 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:25:42,553 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:25:42,637 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:25:42,659 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:25:42,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42 WrapperNode [2018-11-22 21:25:42,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:25:42,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:25:42,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:25:42,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:25:42,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:25:42,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:25:42,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:25:42,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:25:42,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... [2018-11-22 21:25:42,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:25:42,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:25:42,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:25:42,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:25:42,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/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 21:25:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:25:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:25:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:25:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:25:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:25:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:25:42,903 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:25:42,903 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 21:25:42,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:25:42 BoogieIcfgContainer [2018-11-22 21:25:42,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:25:42,904 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:25:42,904 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:25:42,906 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:25:42,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:25:42,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:25:42" (1/3) ... [2018-11-22 21:25:42,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b0ed610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:25:42, skipping insertion in model container [2018-11-22 21:25:42,908 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:25:42,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:25:42" (2/3) ... [2018-11-22 21:25:42,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b0ed610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:25:42, skipping insertion in model container [2018-11-22 21:25:42,909 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:25:42,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:25:42" (3/3) ... [2018-11-22 21:25:42,910 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-22 21:25:42,947 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:25:42,948 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:25:42,948 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:25:42,948 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:25:42,948 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:25:42,948 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:25:42,948 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:25:42,948 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:25:42,948 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:25:42,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 21:25:42,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:25:42,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:42,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:42,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:25:42,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:25:42,976 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:25:42,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 21:25:42,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:25:42,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:42,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:42,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:25:42,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:25:42,984 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 12#L553-3true [2018-11-22 21:25:42,984 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2018-11-22 21:25:42,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 21:25:42,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:42,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:43,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2018-11-22 21:25:43,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:43,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:43,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:43,105 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 21:25:43,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:25:43,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:25:43,109 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:25:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:25:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:25:43,119 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-22 21:25:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:25:43,123 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-22 21:25:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:25:43,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-22 21:25:43,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:25:43,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2018-11-22 21:25:43,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 21:25:43,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 21:25:43,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-22 21:25:43,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:25:43,129 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-22 21:25:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-22 21:25:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-22 21:25:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-22 21:25:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-22 21:25:43,147 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-22 21:25:43,147 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-22 21:25:43,147 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:25:43,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-22 21:25:43,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:25:43,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:43,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:43,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:25:43,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:25:43,149 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 37#L553-3 [2018-11-22 21:25:43,149 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2018-11-22 21:25:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-22 21:25:43,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2018-11-22 21:25:43,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:43,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:43,238 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 21:25:43,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:25:43,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:25:43,238 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:25:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:25:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:25:43,239 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-22 21:25:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:25:43,316 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-22 21:25:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:25:43,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-22 21:25:43,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-22 21:25:43,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-11-22 21:25:43,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 21:25:43,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 21:25:43,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-22 21:25:43,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:25:43,319 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-22 21:25:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-22 21:25:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-11-22 21:25:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-22 21:25:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-22 21:25:43,320 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-22 21:25:43,320 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-22 21:25:43,320 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:25:43,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-22 21:25:43,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-22 21:25:43,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:43,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:43,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:25:43,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:25:43,322 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 73#L553-3 [2018-11-22 21:25:43,322 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2018-11-22 21:25:43,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-22 21:25:43,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2018-11-22 21:25:43,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:43,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2018-11-22 21:25:43,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:43,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:43,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:43,619 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2018-11-22 21:25:43,667 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:25:43,667 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:25:43,668 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:25:43,668 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:25:43,668 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:25:43,668 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:25:43,668 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:25:43,668 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:25:43,668 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-22 21:25:43,668 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:25:43,668 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:25:43,682 INFO 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 21:25:43,685 INFO 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 21:25:43,687 INFO 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 21:25:43,690 INFO 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 21:25:43,692 INFO 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 21:25:43,694 INFO 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 21:25:43,697 INFO 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 21:25:43,699 INFO 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 21:25:43,706 INFO 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 21:25:43,730 INFO 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 21:25:43,733 INFO 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 21:25:43,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 21:25:43,738 INFO 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 21:25:43,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 21:25:43,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 21:25:43,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:43,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:43,921 INFO 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 21:25:43,922 INFO 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 21:25:44,163 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:25:44,167 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:25:44,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:44,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:44,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:44,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,209 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:25:44,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,212 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:25:44,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,258 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:25:44,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,261 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:25:44,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:44,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:44,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:44,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:44,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:44,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:44,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:44,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:44,276 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:25:44,282 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:25:44,282 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 21:25:44,284 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:25:44,286 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:25:44,286 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:25:44,286 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) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-11-22 21:25:44,313 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-22 21:25:44,317 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:25:44,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:44,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:44,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:44,391 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-22 21:25:44,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:25:44,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:44,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-11-22 21:25:44,433 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 21:25:44,436 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 21:25:44,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-22 21:25:44,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2018-11-22 21:25:44,497 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 21:25:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 21:25:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-22 21:25:44,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-22 21:25:44,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:44,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 21:25:44,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:44,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-22 21:25:44,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:44,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-22 21:25:44,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-22 21:25:44,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2018-11-22 21:25:44,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-22 21:25:44,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 21:25:44,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2018-11-22 21:25:44,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:44,504 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-22 21:25:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2018-11-22 21:25:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-22 21:25:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-22 21:25:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-11-22 21:25:44,506 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-22 21:25:44,506 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-22 21:25:44,507 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:25:44,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-11-22 21:25:44,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-22 21:25:44,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:44,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:44,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:25:44,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 21:25:44,508 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-11-22 21:25:44,508 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-11-22 21:25:44,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-22 21:25:44,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:44,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2018-11-22 21:25:44,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:44,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:44,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:44,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:44,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:25:44,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:25:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:44,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:44,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-22 21:25:44,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:25:44,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-22 21:25:44,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:44,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-22 21:25:44,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:44,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-22 21:25:44,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:44,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-22 21:25:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:25:44,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-22 21:25:44,689 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:25:44,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:25:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:25:44,690 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-22 21:25:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:25:44,746 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-22 21:25:44,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:25:44,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2018-11-22 21:25:44,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-22 21:25:44,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2018-11-22 21:25:44,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-22 21:25:44,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-22 21:25:44,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-11-22 21:25:44,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:44,749 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-22 21:25:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-11-22 21:25:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-22 21:25:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-22 21:25:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-11-22 21:25:44,751 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-11-22 21:25:44,752 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-11-22 21:25:44,752 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 21:25:44,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2018-11-22 21:25:44,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-22 21:25:44,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:44,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:44,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:25:44,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:25:44,753 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-11-22 21:25:44,753 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-11-22 21:25:44,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-22 21:25:44,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2018-11-22 21:25:44,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2018-11-22 21:25:44,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:44,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:44,957 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-11-22 21:25:45,114 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-22 21:25:45,155 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:25:45,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:25:45,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:25:45,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:25:45,155 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:25:45,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:25:45,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:25:45,155 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:25:45,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-22 21:25:45,156 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:25:45,156 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:25:45,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 21:25:45,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 21:25:45,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 21:25:45,165 INFO 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 21:25:45,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 21:25:45,169 INFO 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 21:25:45,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:45,183 INFO 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 21:25:45,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:45,186 INFO 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 21:25:45,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:45,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:45,322 INFO 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 21:25:45,323 INFO 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 21:25:45,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 21:25:45,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 21:25:45,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:45,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 21:25:45,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 21:25:45,510 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:25:45,510 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:25:45,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:45,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:45,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:45,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:45,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,564 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:25:45,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,565 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:25:45,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:45,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:45,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:45,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:45,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:45,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:45,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:45,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:45,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:25:45,591 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:25:45,591 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:25:45,592 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:25:45,592 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:25:45,592 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:25:45,592 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-22 21:25:45,626 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-22 21:25:45,627 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:25:45,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:45,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:45,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:45,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-22 21:25:45,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-22 21:25:45,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:45,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-11-22 21:25:45,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-22 21:25:45,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:45,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:45,731 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:30 [2018-11-22 21:25:45,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:45,854 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 52 treesize of output 64 [2018-11-22 21:25:45,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:45,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2018-11-22 21:25:45,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:45,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:45,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:45,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:45,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-22 21:25:45,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:45,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:45,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:45,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:52, output treesize:56 [2018-11-22 21:25:46,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-22 21:25:46,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,099 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 42 treesize of output 29 [2018-11-22 21:25:46,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-11-22 21:25:46,129 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:25:46,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-22 21:25:46,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-22 21:25:46,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:60 [2018-11-22 21:25:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:46,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-22 21:25:46,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2018-11-22 21:25:46,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2018-11-22 21:25:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-22 21:25:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 21:25:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-11-22 21:25:46,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-22 21:25:46,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:46,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-22 21:25:46,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:46,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2018-11-22 21:25:46,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:46,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2018-11-22 21:25:46,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-22 21:25:46,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2018-11-22 21:25:46,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-22 21:25:46,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-22 21:25:46,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2018-11-22 21:25:46,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:46,483 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2018-11-22 21:25:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2018-11-22 21:25:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-11-22 21:25:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-22 21:25:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2018-11-22 21:25:46,489 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-11-22 21:25:46,489 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-11-22 21:25:46,489 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 21:25:46,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2018-11-22 21:25:46,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-22 21:25:46,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:46,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:46,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 21:25:46,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-11-22 21:25:46,490 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-11-22 21:25:46,490 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-11-22 21:25:46,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-22 21:25:46,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:46,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:46,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:46,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2018-11-22 21:25:46,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:46,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:46,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2018-11-22 21:25:46,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:46,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:46,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:25:46,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:25:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:46,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:46,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-22 21:25:46,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:25:46,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-22 21:25:46,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-22 21:25:46,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-22 21:25:46,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-22 21:25:46,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-22 21:25:46,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:46,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-22 21:25:46,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:46,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-22 21:25:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:46,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:25:46,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-22 21:25:46,936 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2018-11-22 21:25:46,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 21:25:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:25:46,961 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2018-11-22 21:25:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:25:47,028 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2018-11-22 21:25:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:25:47,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2018-11-22 21:25:47,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-22 21:25:47,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2018-11-22 21:25:47,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-22 21:25:47,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-22 21:25:47,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2018-11-22 21:25:47,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:47,033 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2018-11-22 21:25:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2018-11-22 21:25:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-22 21:25:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-22 21:25:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-11-22 21:25:47,039 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-11-22 21:25:47,039 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-11-22 21:25:47,039 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 21:25:47,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2018-11-22 21:25:47,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-22 21:25:47,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:47,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:47,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 21:25:47,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:25:47,040 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-11-22 21:25:47,040 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-11-22 21:25:47,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-22 21:25:47,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:47,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:47,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2018-11-22 21:25:47,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:47,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:47,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:47,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:47,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:47,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2018-11-22 21:25:47,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:47,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:47,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:47,344 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2018-11-22 21:25:47,501 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-22 21:25:47,549 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:25:47,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:25:47,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:25:47,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:25:47,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:25:47,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:25:47,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:25:47,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:25:47,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-22 21:25:47,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:25:47,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:25:47,551 INFO 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 21:25:47,553 INFO 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 21:25:47,554 INFO 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 21:25:47,555 INFO 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 21:25:47,558 INFO 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 21:25:47,559 INFO 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 21:25:47,560 INFO 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 21:25:47,696 INFO 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 21:25:47,698 INFO 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 21:25:47,699 INFO 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 21:25:47,700 INFO 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 21:25:47,701 INFO 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 21:25:47,702 INFO 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 21:25:47,704 INFO 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 21:25:47,705 INFO 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 21:25:47,707 INFO 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 21:25:47,709 INFO 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 21:25:47,710 INFO 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 21:25:47,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:47,712 INFO 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 21:25:47,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:25:47,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:25:47,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:47,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:47,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:47,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:47,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:47,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:47,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:47,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:47,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:47,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:47,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:47,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:47,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:47,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:47,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:47,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:47,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:47,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:47,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:47,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:47,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,923 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:25:47,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,924 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:25:47,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:47,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:47,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:47,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:47,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:47,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:47,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:47,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:47,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:47,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:25:47,952 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 21:25:47,952 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 21:25:47,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:25:47,953 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:25:47,953 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:25:47,953 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 21:25:47,996 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-22 21:25:47,997 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:25:48,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:48,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:48,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:48,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,097 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 45 treesize of output 59 [2018-11-22 21:25:48,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-11-22 21:25:48,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:48,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,148 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 40 treesize of output 39 [2018-11-22 21:25:48,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:48,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:25:48,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:25:48,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-11-22 21:25:48,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-22 21:25:48,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-22 21:25:48,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-22 21:25:48,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-22 21:25:48,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-22 21:25:48,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-22 21:25:48,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-22 21:25:48,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-22 21:25:48,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-11-22 21:25:48,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:48,439 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 35 treesize of output 24 [2018-11-22 21:25:48,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:48,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-22 21:25:48,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-22 21:25:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:48,512 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-22 21:25:48,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-11-22 21:25:49,140 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-22 21:25:50,100 WARN L180 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2018-11-22 21:25:51,171 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-11-22 21:25:51,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2018-11-22 21:25:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-22 21:25:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 21:25:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-11-22 21:25:51,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-22 21:25:51,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:51,182 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:25:51,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:51,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:51,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:51,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,249 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 45 treesize of output 59 [2018-11-22 21:25:51,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-22 21:25:51,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:51,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-11-22 21:25:51,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:51,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:25:51,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:25:51,326 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-11-22 21:25:51,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-22 21:25:51,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-22 21:25:51,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-22 21:25:51,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-22 21:25:51,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-22 21:25:51,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-22 21:25:51,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-22 21:25:51,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-22 21:25:51,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-11-22 21:25:51,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:51,524 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 35 treesize of output 24 [2018-11-22 21:25:51,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:51,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-22 21:25:51,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-22 21:25:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:25:51,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-22 21:25:51,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-11-22 21:25:52,254 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-22 21:25:54,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 353 states and 447 transitions. Complement of second has 29 states. [2018-11-22 21:25:54,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-22 21:25:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 21:25:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2018-11-22 21:25:54,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-22 21:25:54,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:54,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 18 letters. Loop has 14 letters. [2018-11-22 21:25:54,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:54,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 28 letters. [2018-11-22 21:25:54,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:54,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 447 transitions. [2018-11-22 21:25:54,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-11-22 21:25:54,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 286 states and 366 transitions. [2018-11-22 21:25:54,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-22 21:25:54,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-22 21:25:54,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 366 transitions. [2018-11-22 21:25:54,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:54,996 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 366 transitions. [2018-11-22 21:25:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 366 transitions. [2018-11-22 21:25:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 233. [2018-11-22 21:25:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-22 21:25:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2018-11-22 21:25:55,008 INFO L728 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-11-22 21:25:55,009 INFO L608 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-11-22 21:25:55,009 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 21:25:55,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2018-11-22 21:25:55,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-22 21:25:55,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:55,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:55,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:25:55,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:25:55,011 INFO L794 eck$LassoCheckResult]: Stem: 1944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1942#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 1943#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1945#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1946#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-11-22 21:25:55,011 INFO L796 eck$LassoCheckResult]: Loop: 1959#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1950#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1951#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1954#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-11-22 21:25:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-22 21:25:55,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:55,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:55,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2018-11-22 21:25:55,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:55,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:55,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:55,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:55,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:55,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2018-11-22 21:25:55,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:55,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:55,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:55,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:55,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:55,335 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-11-22 21:25:55,630 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-11-22 21:25:55,632 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:25:55,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:25:55,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:25:55,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:25:55,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:25:55,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:25:55,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:25:55,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:25:55,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-22 21:25:55,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:25:55,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:25:55,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:25:55,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 21:25:55,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 21:25:55,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 21:25:55,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 21:25:55,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 21:25:55,654 INFO 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 21:25:55,655 INFO 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 21:25:55,656 INFO 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 21:25:55,903 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-22 21:25:55,966 INFO 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 21:25:55,967 INFO 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 21:25:55,968 INFO 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 21:25:55,969 INFO 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 21:25:55,970 INFO 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 21:25:55,971 INFO 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 21:25:55,973 INFO 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 21:25:56,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:25:56,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:25:56,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:56,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:56,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:56,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:56,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:56,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:56,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:56,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:56,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:56,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:56,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:56,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:56,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:56,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:56,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:56,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:56,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:25:56,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:25:56,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:25:56,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:56,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:56,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,350 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:25:56,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,351 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:25:56,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:56,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:56,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:25:56,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:56,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:25:56,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:25:56,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:25:56,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:25:56,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:25:56,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:25:56,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:25:56,377 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:25:56,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:25:56,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:25:56,385 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-22 21:25:56,385 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 21:25:56,491 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:25:56,583 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 21:25:56,584 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-22 21:25:56,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:25:56,585 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-22 21:25:56,585 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:25:56,585 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)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2018-11-22 21:25:56,621 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-22 21:25:56,622 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:25:56,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:56,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:56,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:56,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:56,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-11-22 21:25:56,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:56,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-11-22 21:25:56,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:56,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:56,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:25:56,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-22 21:25:56,704 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 21:25:56,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 21:25:56,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2018-11-22 21:25:56,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2018-11-22 21:25:56,731 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 21:25:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:25:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-22 21:25:56,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 21:25:56,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:56,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-22 21:25:56,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:56,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 21:25:56,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:25:56,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2018-11-22 21:25:56,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-22 21:25:56,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2018-11-22 21:25:56,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-22 21:25:56,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-22 21:25:56,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2018-11-22 21:25:56,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:56,739 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2018-11-22 21:25:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2018-11-22 21:25:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2018-11-22 21:25:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-22 21:25:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2018-11-22 21:25:56,747 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-11-22 21:25:56,747 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-11-22 21:25:56,748 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 21:25:56,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2018-11-22 21:25:56,749 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-22 21:25:56,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:56,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:56,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:25:56,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:25:56,750 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2647#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 2648#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2664#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2835#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2796#L555-1 assume !test_fun_#t~short8; 2725#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 2678#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2675#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-11-22 21:25:56,750 INFO L796 eck$LassoCheckResult]: Loop: 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2724#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2714#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2650#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2651#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2696#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2681#L555-1 assume !test_fun_#t~short8; 2683#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 2667#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2668#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-11-22 21:25:56,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2018-11-22 21:25:56,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:25:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:56,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2018-11-22 21:25:56,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:56,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:56,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2018-11-22 21:25:56,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:56,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:56,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:56,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:56,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:25:56,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:25:56,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:25:56,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:25:56,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 21:25:56,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:25:56,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:56,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-22 21:25:56,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:56,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:56,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-22 21:25:56,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-22 21:25:56,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:25:56,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:56,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:56,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:56,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-22 21:25:57,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-22 21:25:57,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,016 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 32 treesize of output 23 [2018-11-22 21:25:57,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2018-11-22 21:25:57,036 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:25:57,036 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-11-22 21:25:57,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-22 21:25:57,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-22 21:25:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:25:57,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:25:57,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-22 21:25:57,188 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-11-22 21:25:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 21:25:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:25:57,208 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 13 states. [2018-11-22 21:25:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:25:57,280 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2018-11-22 21:25:57,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:25:57,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2018-11-22 21:25:57,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-11-22 21:25:57,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2018-11-22 21:25:57,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-22 21:25:57,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-22 21:25:57,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2018-11-22 21:25:57,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:57,284 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-11-22 21:25:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2018-11-22 21:25:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-11-22 21:25:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-22 21:25:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-11-22 21:25:57,288 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-11-22 21:25:57,288 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-11-22 21:25:57,288 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 21:25:57,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2018-11-22 21:25:57,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-22 21:25:57,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:57,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:57,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:25:57,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:25:57,290 INFO L794 eck$LassoCheckResult]: Stem: 3306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3304#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 3305#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3351#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3350#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3345#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3346#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3341#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3342#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3338#L555-1 assume !test_fun_#t~short8; 3337#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 3336#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3334#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-11-22 21:25:57,290 INFO L796 eck$LassoCheckResult]: Loop: 3322#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3401#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3398#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3396#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3394#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3391#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3389#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3386#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3387#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3380#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3381#L555-1 assume !test_fun_#t~short8; 3332#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 3333#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3321#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-11-22 21:25:57,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:57,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2018-11-22 21:25:57,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:57,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:57,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:57,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2018-11-22 21:25:57,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:57,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:57,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:57,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2018-11-22 21:25:57,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:57,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:25:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:25:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:25:57,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63efcf62-0066-4082-8857-fc06014859e9/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:25:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 21:25:57,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-22 21:25:57,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:25:57,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:25:57,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-22 21:25:57,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:25:57,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-22 21:25:57,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,568 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 38 treesize of output 54 [2018-11-22 21:25:57,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2018-11-22 21:25:57,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-11-22 21:25:57,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:57,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:57,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2018-11-22 21:25:57,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-22 21:25:57,731 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:25:57,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-22 21:25:57,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-22 21:25:57,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,758 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 37 treesize of output 26 [2018-11-22 21:25:57,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:57,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:47 [2018-11-22 21:25:57,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,806 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 39 treesize of output 51 [2018-11-22 21:25:57,808 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-11-22 21:25:57,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:25:57,829 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:25:57,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-11-22 21:25:57,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:25:57,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:57,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:25:57,856 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:49 [2018-11-22 21:25:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 21:25:57,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:25:57,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-22 21:25:58,135 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2018-11-22 21:25:58,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-22 21:25:58,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-22 21:25:58,156 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-11-22 21:25:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:25:58,381 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-22 21:25:58,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:25:58,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2018-11-22 21:25:58,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:25:58,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2018-11-22 21:25:58,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-22 21:25:58,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-22 21:25:58,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2018-11-22 21:25:58,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:25:58,383 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-22 21:25:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2018-11-22 21:25:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-11-22 21:25:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-22 21:25:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-22 21:25:58,384 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-22 21:25:58,385 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-22 21:25:58,385 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 21:25:58,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2018-11-22 21:25:58,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:25:58,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:25:58,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:25:58,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:25:58,388 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:25:58,388 INFO L794 eck$LassoCheckResult]: Stem: 3664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3662#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 3663#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3669#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3670#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3700#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3699#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3698#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3697#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3696#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3695#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3694#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3693#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3682#L555-1 assume !test_fun_#t~short8; 3680#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 3679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3678#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3671#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3672#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-11-22 21:25:58,388 INFO L796 eck$LassoCheckResult]: Loop: 3676#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);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3665#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3666#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3673#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-11-22 21:25:58,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2018-11-22 21:25:58,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:58,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:58,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2018-11-22 21:25:58,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:58,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:58,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:25:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2018-11-22 21:25:58,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:25:58,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:25:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:58,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:25:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:25:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:25:59,634 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 198 DAG size of output: 150 [2018-11-22 21:25:59,710 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:25:59,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:25:59,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:25:59,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:25:59,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:25:59,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:25:59,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:25:59,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:25:59,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-11-22 21:25:59,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:25:59,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:25:59,713 INFO 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 21:25:59,715 INFO 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 21:25:59,718 INFO 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 21:25:59,720 INFO 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 21:25:59,721 INFO 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 21:25:59,722 INFO 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 21:25:59,724 INFO 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 21:25:59,725 INFO 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 21:25:59,730 INFO 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 21:25:59,731 INFO 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 21:25:59,732 INFO 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 21:25:59,734 INFO 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 21:25:59,737 INFO 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 21:25:59,738 INFO 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 21:25:59,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 21:25:59,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 21:25:59,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 21:25:59,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 21:26:00,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:26:00,177 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:26:00,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:26:00,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:26:00,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:26:00,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:26:00,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,205 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:26:00,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:26:00,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,208 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:26:00,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:26:00,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:26:00,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:26:00,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:26:00,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 21:26:00,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:26:00,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:26:00,212 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:26:00,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:26:00,220 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-22 21:26:00,220 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 21:26:00,295 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:26:00,358 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 21:26:00,359 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 21:26:00,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:26:00,360 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-22 21:26:00,360 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:26:00,360 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)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2018-11-22 21:26:00,408 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-22 21:26:00,409 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:26:00,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:26:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:26:00,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:26:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:26:00,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:26:00,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:26:00,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-11-22 21:26:00,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:26:00,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-11-22 21:26:00,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-22 21:26:00,479 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 21:26:00,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 21:26:00,479 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-22 21:26:00,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2018-11-22 21:26:00,503 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 21:26:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:26:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-22 21:26:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-22 21:26:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:26:00,503 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:26:00,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:26:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:26:00,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:26:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:26:00,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:26:00,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:26:00,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-11-22 21:26:00,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:26:00,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-11-22 21:26:00,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-22 21:26:00,585 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 21:26:00,586 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 21:26:00,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-22 21:26:00,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2018-11-22 21:26:00,619 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 21:26:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:26:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-22 21:26:00,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-22 21:26:00,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:26:00,620 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:26:00,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:26:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:26:00,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:26:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:26:00,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:26:00,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:26:00,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-11-22 21:26:00,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:26:00,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-11-22 21:26:00,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:26:00,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-22 21:26:00,751 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 21:26:00,752 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 21:26:00,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-22 21:26:00,781 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2018-11-22 21:26:00,782 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 21:26:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:26:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-22 21:26:00,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-22 21:26:00,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:26:00,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-22 21:26:00,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:26:00,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-22 21:26:00,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:26:00,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2018-11-22 21:26:00,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:26:00,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-22 21:26:00,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:26:00,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:26:00,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:26:00,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:26:00,784 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:26:00,784 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:26:00,784 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:26:00,784 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 21:26:00,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:26:00,785 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:26:00,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:26:00,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:26:00 BoogieIcfgContainer [2018-11-22 21:26:00,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:26:00,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:26:00,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:26:00,791 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:26:00,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:25:42" (3/4) ... [2018-11-22 21:26:00,795 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:26:00,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:26:00,795 INFO L168 Benchmark]: Toolchain (without parser) took 18505.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -97.4 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:26:00,796 INFO L168 Benchmark]: CDTParser took 0.11 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 21:26:00,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -219.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:26:00,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.35 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:26:00,797 INFO L168 Benchmark]: Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:26:00,797 INFO L168 Benchmark]: RCFGBuilder took 198.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:26:00,797 INFO L168 Benchmark]: BuchiAutomizer took 17886.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 252.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Peak memory consumption was 350.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:26:00,797 INFO L168 Benchmark]: Witness Printer took 3.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:26:00,799 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -219.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.35 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 198.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17886.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 252.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Peak memory consumption was 350.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 8.6s. Construction of modules took 3.0s. Büchi inclusion checks took 5.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 186 SDslu, 83 SDs, 0 SdLazy, 775 SolverSat, 167 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital364 mio100 ax105 hnf99 lsp82 ukn56 mio100 lsp35 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf172 smp82 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 208ms VariablesStem: 8 VariablesLoop: 8 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...