./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/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 0c73140129db08253eb2666e014a272764010e16 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:24:54,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:24:54,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:24:54,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:24:54,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:24:54,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:24:54,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:24:54,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:24:54,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:24:54,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:24:54,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:24:54,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:24:54,831 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:24:54,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:24:54,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:24:54,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:24:54,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:24:54,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:24:54,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:24:54,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:24:54,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:24:54,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:24:54,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:24:54,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:24:54,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:24:54,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:24:54,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:24:54,886 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:24:54,887 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:24:54,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:24:54,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:24:54,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:24:54,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:24:54,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:24:54,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:24:54,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:24:54,891 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 16:24:54,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:24:54,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:24:54,951 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:24:54,951 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:24:54,951 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:24:54,951 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:24:54,951 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:24:54,951 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:24:54,951 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:24:54,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:24:54,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:24:54,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:24:54,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:24:54,953 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:24:54,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:24:54,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:24:54,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:24:54,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:24:54,955 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:24:54,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:24:54,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:24:54,956 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:24:54,956 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:24:54,957 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_ecccf884-d2db-457d-a1a9-73036d870449/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 -> 0c73140129db08253eb2666e014a272764010e16 [2018-11-18 16:24:55,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:24:55,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:24:55,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:24:55,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:24:55,126 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:24:55,126 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-18 16:24:55,338 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/data/6a80dc0be/7890a574d2524f48af9a141bd5c16615/FLAGd0b5e5cf1 [2018-11-18 16:24:56,379 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:24:56,382 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-18 16:24:56,406 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/data/6a80dc0be/7890a574d2524f48af9a141bd5c16615/FLAGd0b5e5cf1 [2018-11-18 16:24:56,542 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/bin-2019/uautomizer/data/6a80dc0be/7890a574d2524f48af9a141bd5c16615 [2018-11-18 16:24:56,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:24:56,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:24:56,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:24:56,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:24:56,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:24:56,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:24:56" (1/1) ... [2018-11-18 16:24:56,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527ba39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:56, skipping insertion in model container [2018-11-18 16:24:56,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:24:56" (1/1) ... [2018-11-18 16:24:56,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:24:56,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:24:57,516 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:24:57,527 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:24:57,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:24:57,686 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:24:57,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57 WrapperNode [2018-11-18 16:24:57,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:24:57,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:24:57,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:24:57,688 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:24:57,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:24:57,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:24:57,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:24:57,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:24:57,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... [2018-11-18 16:24:57,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:24:57,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:24:57,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:24:57,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:24:57,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecccf884-d2db-457d-a1a9-73036d870449/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-18 16:24:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:24:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:24:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:24:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:24:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:24:58,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:24:58,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:24:58,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:24:58 BoogieIcfgContainer [2018-11-18 16:24:58,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:24:58,917 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:24:58,917 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:24:58,920 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:24:58,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:24:58,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:24:56" (1/3) ... [2018-11-18 16:24:58,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73e33c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:24:58, skipping insertion in model container [2018-11-18 16:24:58,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:24:58,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:24:57" (2/3) ... [2018-11-18 16:24:58,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73e33c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:24:58, skipping insertion in model container [2018-11-18 16:24:58,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:24:58,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:24:58" (3/3) ... [2018-11-18 16:24:58,945 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2018-11-18 16:24:59,087 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:24:59,088 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:24:59,088 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:24:59,088 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:24:59,088 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:24:59,088 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:24:59,089 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:24:59,089 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:24:59,089 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:24:59,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:24:59,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:24:59,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:24:59,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:24:59,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:24:59,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:24:59,185 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:24:59,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:24:59,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:24:59,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:24:59,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:24:59,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:24:59,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:24:59,194 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 11#L574true assume !(main_~Alen~0 < 1); 16#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 15#L554-3true [2018-11-18 16:24:59,195 INFO L796 eck$LassoCheckResult]: Loop: 15#L554-3true assume true; 10#L554-1true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 8#L557-3true assume !(0 == diff_~found~0); 13#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 15#L554-3true [2018-11-18 16:24:59,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 16:24:59,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:24:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash 46963718, now seen corresponding path program 1 times [2018-11-18 16:24:59,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:24:59,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:24:59,355 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-18 16:24:59,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:24:59,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:24:59,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:24:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:24:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:24:59,378 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-11-18 16:24:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:24:59,383 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2018-11-18 16:24:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:24:59,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2018-11-18 16:24:59,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:24:59,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 17 transitions. [2018-11-18 16:24:59,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 16:24:59,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 16:24:59,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-18 16:24:59,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:24:59,391 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-18 16:24:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-18 16:24:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 16:24:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 16:24:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-18 16:24:59,439 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-18 16:24:59,439 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-18 16:24:59,439 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:24:59,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-18 16:24:59,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:24:59,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:24:59,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:24:59,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:24:59,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:24:59,441 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 41#L574 assume !(main_~Alen~0 < 1); 45#L574-2 assume !(main_~Blen~0 < 1); 51#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 47#L554-3 [2018-11-18 16:24:59,441 INFO L796 eck$LassoCheckResult]: Loop: 47#L554-3 assume true; 42#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 43#L558-2 assume true; 49#L557-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 50#L557-3 assume !(0 == diff_~found~0); 46#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 47#L554-3 [2018-11-18 16:24:59,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 16:24:59,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:24:59,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442797, now seen corresponding path program 1 times [2018-11-18 16:24:59,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:24:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:24:59,572 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-18 16:24:59,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:24:59,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:24:59,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:24:59,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:24:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:24:59,573 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 16:24:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:24:59,638 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-11-18 16:24:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:24:59,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-18 16:24:59,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 16:24:59,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2018-11-18 16:24:59,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 16:24:59,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 16:24:59,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-18 16:24:59,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:24:59,642 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 16:24:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-18 16:24:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-18 16:24:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 16:24:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-18 16:24:59,645 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-18 16:24:59,645 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-18 16:24:59,645 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:24:59,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-18 16:24:59,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:24:59,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:24:59,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:24:59,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:24:59,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:24:59,648 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 76#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 77#L574 assume !(main_~Alen~0 < 1); 82#L574-2 assume !(main_~Blen~0 < 1); 88#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 84#L554-3 [2018-11-18 16:24:59,648 INFO L796 eck$LassoCheckResult]: Loop: 84#L554-3 assume true; 78#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 79#L558-2 assume true; 90#L557-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 89#L557-3 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 83#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 84#L554-3 [2018-11-18 16:24:59,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-18 16:24:59,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:24:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442735, now seen corresponding path program 1 times [2018-11-18 16:24:59,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:24:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:24:59,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:24:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2146066612, now seen corresponding path program 1 times [2018-11-18 16:24:59,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:24:59,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:24:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:24:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:24:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:24:59,943 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-18 16:24:59,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:24:59,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:25:00,623 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-18 16:25:00,829 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 16:25:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:25:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:25:00,830 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 16:25:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:01,018 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2018-11-18 16:25:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:25:01,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2018-11-18 16:25:01,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 16:25:01,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2018-11-18 16:25:01,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 16:25:01,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 16:25:01,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-18 16:25:01,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:01,021 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-18 16:25:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-18 16:25:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-18 16:25:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 16:25:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-18 16:25:01,027 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 16:25:01,027 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 16:25:01,027 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:25:01,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-18 16:25:01,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:25:01,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:01,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:01,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:25:01,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:01,029 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 124#L574 assume !(main_~Alen~0 < 1); 127#L574-2 assume !(main_~Blen~0 < 1); 134#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 133#L554-3 [2018-11-18 16:25:01,029 INFO L796 eck$LassoCheckResult]: Loop: 133#L554-3 assume true; 125#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 126#L558-2 assume true; 135#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 128#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 129#L558-2 assume true; 139#L557-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 137#L557-3 assume !(0 == diff_~found~0); 132#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 133#L554-3 [2018-11-18 16:25:01,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:01,029 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-18 16:25:01,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:01,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:01,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:01,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:01,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1447989759, now seen corresponding path program 1 times [2018-11-18 16:25:01,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:01,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:01,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:01,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1364405670, now seen corresponding path program 1 times [2018-11-18 16:25:01,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:01,762 WARN L180 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-18 16:25:02,384 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-18 16:25:02,632 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 16:25:02,646 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:02,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:02,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:02,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:02,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:02,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:02,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:02,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:02,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 16:25:02,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:02,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:02,675 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-18 16:25:02,693 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-18 16:25:02,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-18 16:25:02,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-18 16:25:02,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-18 16:25:02,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-18 16:25:02,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:02,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:02,771 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-18 16:25:02,781 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-18 16:25:02,792 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-18 16:25:02,802 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-18 16:25:02,809 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-18 16:25:02,813 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-18 16:25:02,817 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-18 16:25:02,828 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-18 16:25:02,832 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-18 16:25:03,412 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-11-18 16:25:03,538 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-18 16:25:03,539 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-18 16:25:04,042 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 16:25:04,622 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 16:25:04,985 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 16:25:05,378 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 16:25:05,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:05,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:05,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,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-18 16:25:05,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,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-18 16:25:05,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,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-18 16:25:05,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,553 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:05,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,555 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:05,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:05,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:05,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,600 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:05,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,604 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:05,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:05,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:05,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:05,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,680 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:05,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,684 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:05,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:05,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:05,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:05,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:05,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:05,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:05,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:05,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:05,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:05,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:05,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:05,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:05,759 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:25:05,804 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:25:05,804 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:25:05,813 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:25:05,815 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:25:05,815 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:25:05,815 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2018-11-18 16:25:06,266 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 16:25:06,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:06,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:06,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:25:06,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:25:06,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 16:25:06,453 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2018-11-18 16:25:06,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 16:25:06,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 16:25:06,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:06,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 16:25:06,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:06,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 16:25:06,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:06,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-11-18 16:25:06,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:25:06,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-11-18 16:25:06,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 16:25:06,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 16:25:06,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-18 16:25:06,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:25:06,460 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-18 16:25:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-18 16:25:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-18 16:25:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 16:25:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-18 16:25:06,463 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-18 16:25:06,463 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-18 16:25:06,464 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:25:06,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-18 16:25:06,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:25:06,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:06,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:06,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:06,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:25:06,465 INFO L794 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 295#L574 assume !(main_~Alen~0 < 1); 300#L574-2 assume !(main_~Blen~0 < 1); 309#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 308#L554-3 assume true; 296#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 297#L558-2 [2018-11-18 16:25:06,465 INFO L796 eck$LassoCheckResult]: Loop: 297#L558-2 assume true; 310#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 301#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 297#L558-2 [2018-11-18 16:25:06,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935596, now seen corresponding path program 1 times [2018-11-18 16:25:06,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:06,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:06,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 58783, now seen corresponding path program 1 times [2018-11-18 16:25:06,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:06,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1593248660, now seen corresponding path program 1 times [2018-11-18 16:25:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:06,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:06,779 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 16:25:07,359 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 108 [2018-11-18 16:25:07,626 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-18 16:25:07,629 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:07,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:07,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:07,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:07,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:07,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:07,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:07,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:07,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 16:25:07,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:07,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:07,633 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-18 16:25:07,662 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-18 16:25:07,670 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-18 16:25:07,684 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-18 16:25:07,689 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-18 16:25:07,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-18 16:25:07,716 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-18 16:25:07,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-18 16:25:07,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-18 16:25:07,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-18 16:25:07,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:07,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:07,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:07,773 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-18 16:25:08,182 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-18 16:25:08,335 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-18 16:25:08,336 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-18 16:25:08,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:08,411 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-18 16:25:08,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:08,907 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-18 16:25:09,806 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-18 16:25:10,029 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:10,030 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:10,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:10,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:10,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:10,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:10,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:10,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:10,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:10,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:25:10,042 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:25:10,042 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:25:10,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:25:10,044 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:25:10,045 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:25:10,045 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-18 16:25:10,446 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 16:25:10,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:10,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:10,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:10,554 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-18 16:25:10,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:25:10,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 16:25:10,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 70 states and 93 transitions. Complement of second has 7 states. [2018-11-18 16:25:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 16:25:10,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 16:25:10,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:10,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 16:25:10,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:10,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 16:25:10,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:10,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 93 transitions. [2018-11-18 16:25:10,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:25:10,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 66 states and 89 transitions. [2018-11-18 16:25:10,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 16:25:10,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 16:25:10,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 89 transitions. [2018-11-18 16:25:10,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:25:10,736 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 89 transitions. [2018-11-18 16:25:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 89 transitions. [2018-11-18 16:25:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-11-18 16:25:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 16:25:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2018-11-18 16:25:10,743 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-11-18 16:25:10,743 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-11-18 16:25:10,743 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:25:10,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 77 transitions. [2018-11-18 16:25:10,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:25:10,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:10,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:10,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:10,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:25:10,746 INFO L794 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 506#L574 assume !(main_~Alen~0 < 1); 511#L574-2 assume !(main_~Blen~0 < 1); 524#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 519#L554-3 assume true; 520#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 532#L558-2 assume true; 525#L557-1 [2018-11-18 16:25:10,746 INFO L796 eck$LassoCheckResult]: Loop: 525#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 512#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 513#L558-2 assume true; 525#L557-1 [2018-11-18 16:25:10,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 180428657, now seen corresponding path program 1 times [2018-11-18 16:25:10,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:10,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:10,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:10,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:10,760 INFO L82 PathProgramCache]: Analyzing trace with hash 64695, now seen corresponding path program 1 times [2018-11-18 16:25:10,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:10,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:10,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:10,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2146068295, now seen corresponding path program 1 times [2018-11-18 16:25:10,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:10,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:11,227 WARN L180 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:25:11,534 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-18 16:25:11,902 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-18 16:25:12,058 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-18 16:25:12,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:12,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:12,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:12,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:12,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:12,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:12,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:12,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:12,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-18 16:25:12,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:12,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:12,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,076 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-18 16:25:12,413 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-18 16:25:12,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,494 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-18 16:25:12,496 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-18 16:25:12,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:12,506 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-18 16:25:12,508 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-18 16:25:12,510 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-18 16:25:12,511 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-18 16:25:12,513 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-18 16:25:12,514 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-18 16:25:12,516 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-18 16:25:12,518 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-18 16:25:12,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:12,919 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:12,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:12,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:12,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:12,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:12,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:12,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:12,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:12,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,930 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:12,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,930 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:12,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:12,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,938 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:12,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,939 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:12,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:12,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:12,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:12,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:12,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:12,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:12,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:12,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:12,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:12,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:12,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:12,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:12,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:12,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:12,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:12,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:12,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:12,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:13,002 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:25:13,056 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:25:13,056 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 16:25:13,057 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:25:13,058 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:25:13,058 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:25:13,058 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-18 16:25:13,366 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 16:25:13,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:13,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:13,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:13,409 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-18 16:25:13,409 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-18 16:25:13,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 77 transitions. cyclomatic complexity: 27 Second operand 4 states. [2018-11-18 16:25:13,439 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 77 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 141 states and 183 transitions. Complement of second has 7 states. [2018-11-18 16:25:13,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 16:25:13,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 16:25:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:13,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 16:25:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:13,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 16:25:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:13,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 183 transitions. [2018-11-18 16:25:13,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:25:13,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 95 states and 128 transitions. [2018-11-18 16:25:13,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 16:25:13,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 16:25:13,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 128 transitions. [2018-11-18 16:25:13,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:25:13,450 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 128 transitions. [2018-11-18 16:25:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 128 transitions. [2018-11-18 16:25:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2018-11-18 16:25:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 16:25:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2018-11-18 16:25:13,457 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 93 transitions. [2018-11-18 16:25:13,457 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 93 transitions. [2018-11-18 16:25:13,457 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:25:13,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 93 transitions. [2018-11-18 16:25:13,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:25:13,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:13,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:13,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:13,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:25:13,459 INFO L794 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 820#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 821#L574 assume !(main_~Alen~0 < 1); 830#L574-2 assume !(main_~Blen~0 < 1); 845#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 834#L554-3 assume true; 835#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 880#L558-2 assume true; 839#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 882#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 881#L558-2 assume true; 843#L557-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 844#L557-3 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 857#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 867#L554-3 assume true; 851#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 827#L558-2 [2018-11-18 16:25:13,459 INFO L796 eck$LassoCheckResult]: Loop: 827#L558-2 assume true; 837#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 826#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 827#L558-2 [2018-11-18 16:25:13,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash 546124804, now seen corresponding path program 1 times [2018-11-18 16:25:13,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:13,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:13,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:13,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 58785, now seen corresponding path program 2 times [2018-11-18 16:25:13,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:13,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:13,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash 267947710, now seen corresponding path program 2 times [2018-11-18 16:25:13,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:13,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:13,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:13,958 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:25:14,770 WARN L180 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 145 [2018-11-18 16:25:14,948 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-18 16:25:14,950 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:14,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:14,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:14,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:14,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:14,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:14,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:14,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:14,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 16:25:14,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:14,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:14,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:14,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-18 16:25:14,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-18 16:25:14,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-18 16:25:14,978 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-18 16:25:14,982 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-18 16:25:14,983 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-18 16:25:14,984 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-18 16:25:14,990 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-18 16:25:14,991 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-18 16:25:14,996 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-18 16:25:14,998 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-18 16:25:15,684 WARN L180 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-18 16:25:15,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-18 16:25:15,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-18 16:25:15,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:15,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-18 16:25:15,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:15,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:16,036 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-18 16:25:16,330 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:16,331 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:16,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-18 16:25:16,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:16,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:16,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:16,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:16,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:16,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:16,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:16,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:16,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:16,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:16,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:16,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:16,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:16,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:16,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:16,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:16,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:16,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:16,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:16,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:16,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:16,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:16,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:16,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:16,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,380 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:16,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,381 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:16,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,397 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:16,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,398 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 16:25:16,398 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 16:25:16,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,412 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:16,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,413 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:16,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:16,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:16,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:16,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:16,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:16,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:16,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:16,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:16,495 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:25:16,535 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:25:16,541 INFO L444 ModelExtractionUtils]: 68 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:25:16,542 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:25:16,542 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:25:16,543 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:25:16,543 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_4, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_4 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-18 16:25:16,797 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 16:25:16,798 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:25:16,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:16,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:16,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:16,846 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-18 16:25:16,847 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:25:16,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-18 16:25:16,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 132 states and 171 transitions. Complement of second has 7 states. [2018-11-18 16:25:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-18 16:25:16,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 16:25:16,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:16,882 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:25:16,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:16,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:16,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:16,923 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-18 16:25:16,923 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:25:16,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-18 16:25:16,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 132 states and 171 transitions. Complement of second has 7 states. [2018-11-18 16:25:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-18 16:25:16,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 16:25:16,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:16,947 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:25:16,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:17,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:17,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:17,190 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-18 16:25:17,191 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:25:17,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-18 16:25:17,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 159 states and 213 transitions. Complement of second has 6 states. [2018-11-18 16:25:17,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 16:25:17,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 16:25:17,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:17,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 16:25:17,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:17,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-18 16:25:17,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:17,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 213 transitions. [2018-11-18 16:25:17,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:25:17,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 74 states and 99 transitions. [2018-11-18 16:25:17,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 16:25:17,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 16:25:17,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 99 transitions. [2018-11-18 16:25:17,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:25:17,251 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 99 transitions. [2018-11-18 16:25:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 99 transitions. [2018-11-18 16:25:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2018-11-18 16:25:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 16:25:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-11-18 16:25:17,254 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-18 16:25:17,254 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-18 16:25:17,254 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 16:25:17,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2018-11-18 16:25:17,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:25:17,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:17,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:17,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:17,261 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:25:17,261 INFO L794 eck$LassoCheckResult]: Stem: 1626#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1615#L574 assume !(main_~Alen~0 < 1); 1625#L574-2 assume !(main_~Blen~0 < 1); 1632#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1629#L554-3 assume true; 1618#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1619#L558-2 assume true; 1658#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1657#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 1655#L558-2 assume true; 1651#L557-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1642#L557-3 assume !(0 == diff_~found~0); 1634#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1635#L554-3 assume true; 1616#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1617#L558-2 assume true; 1630#L557-1 [2018-11-18 16:25:17,261 INFO L796 eck$LassoCheckResult]: Loop: 1630#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1620#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 1621#L558-2 assume true; 1630#L557-1 [2018-11-18 16:25:17,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash 561193437, now seen corresponding path program 2 times [2018-11-18 16:25:17,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:17,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:17,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 64633, now seen corresponding path program 2 times [2018-11-18 16:25:17,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:17,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:17,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1793966819, now seen corresponding path program 3 times [2018-11-18 16:25:17,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:17,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:17,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:17,910 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 129 [2018-11-18 16:25:18,074 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-18 16:25:18,076 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:18,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:18,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:18,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:18,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:18,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:18,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:18,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:18,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-18 16:25:18,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:18,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:18,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:18,085 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-18 16:25:18,095 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-18 16:25:18,112 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-18 16:25:18,118 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-18 16:25:18,128 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-18 16:25:18,138 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-18 16:25:18,139 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-18 16:25:18,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:18,141 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-18 16:25:18,942 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2018-11-18 16:25:18,994 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-18 16:25:18,996 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-18 16:25:18,998 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-18 16:25:19,000 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-18 16:25:19,010 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-18 16:25:19,024 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-18 16:25:19,038 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-18 16:25:19,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:19,374 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-18 16:25:19,612 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-18 16:25:19,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:19,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:19,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,838 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:19,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,838 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:19,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:19,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:19,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:19,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:19,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:19,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:19,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,882 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:25:19,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,883 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:19,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,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-18 16:25:19,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:19,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:19,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:19,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:19,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 16:25:19,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:19,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:19,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:19,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:19,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:19,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:25:19,915 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:25:19,917 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:25:19,917 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:25:19,917 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:25:19,918 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:25:19,918 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:25:19,918 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-18 16:25:20,168 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2018-11-18 16:25:20,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:20,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:20,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:20,231 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-18 16:25:20,232 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-18 16:25:20,232 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-18 16:25:20,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 76 states and 103 transitions. Complement of second has 7 states. [2018-11-18 16:25:20,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-18 16:25:20,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 16:25:20,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:20,274 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:25:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:20,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:20,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:20,333 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-18 16:25:20,333 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 16:25:20,333 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-18 16:25:20,427 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 74 states and 100 transitions. Complement of second has 9 states. [2018-11-18 16:25:20,428 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-18 16:25:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-18 16:25:20,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 16:25:20,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:20,429 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:25:20,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:20,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:20,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:25:20,534 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-18 16:25:20,535 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 3 loop predicates [2018-11-18 16:25:20,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-18 16:25:20,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 118 states and 163 transitions. Complement of second has 13 states. [2018-11-18 16:25:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:25:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:25:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 16:25:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 16:25:20,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 16:25:20,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 17 letters. Loop has 6 letters. [2018-11-18 16:25:20,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:25:20,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 163 transitions. [2018-11-18 16:25:20,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:25:20,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2018-11-18 16:25:20,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:25:20,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:25:20,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:25:20,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:20,606 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:25:20,606 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:25:20,607 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:25:20,607 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 16:25:20,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:25:20,607 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:25:20,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:25:20,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:25:20 BoogieIcfgContainer [2018-11-18 16:25:20,615 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:25:20,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:25:20,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:25:20,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:25:20,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:24:58" (3/4) ... [2018-11-18 16:25:20,618 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:25:20,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:25:20,619 INFO L168 Benchmark]: Toolchain (without parser) took 24060.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.1 MB). Free memory was 958.4 MB in the beginning and 946.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 425.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:20,620 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:25:20,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1126.99 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 934.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:20,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 217.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 934.2 MB in the beginning and 1.1 GB in the end (delta: -215.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:20,621 INFO L168 Benchmark]: Boogie Preprocessor took 46.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:20,621 INFO L168 Benchmark]: RCFGBuilder took 964.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:20,621 INFO L168 Benchmark]: BuchiAutomizer took 21698.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 946.4 MB in the end (delta: 178.4 MB). Peak memory consumption was 440.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:20,622 INFO L168 Benchmark]: Witness Printer took 3.41 ms. Allocated memory is still 1.4 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:25:20,624 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1126.99 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 934.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 217.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 934.2 MB in the beginning and 1.1 GB in the end (delta: -215.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 964.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21698.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 946.4 MB in the end (delta: 178.4 MB). Peak memory consumption was 440.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.41 ms. Allocated memory is still 1.4 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * i + l1 and consists of 4 locations. One deterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.5s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 19.5s. Construction of modules took 0.4s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 75 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 230 SDtfs, 254 SDslu, 103 SDs, 0 SdLazy, 159 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital268 mio100 ax106 hnf99 lsp84 ukn89 mio100 lsp56 div100 bol100 ite100 ukn100 eq187 hnf89 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...