./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/mutual_simple2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/mutual_simple2_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0e5de97577f46d865036abdb75ab0d17479e10b3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:24:07,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:07,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:07,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:07,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:07,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:07,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:07,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:07,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:07,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:07,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:07,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:07,732 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:07,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:07,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:07,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:07,736 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:07,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:07,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:07,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:07,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:07,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:07,748 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:07,748 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:07,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:07,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:07,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:07,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:07,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:07,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:07,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:07,754 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:07,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:07,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:07,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:07,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:07,757 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:07,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:07,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:07,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:07,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:07,777 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:07,777 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:07,777 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:07,777 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:07,778 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:07,778 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:07,778 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:07,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:07,778 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:07,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:07,779 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:07,779 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:07,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:07,779 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:07,779 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:07,780 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:07,780 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:07,780 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:07,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:07,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:07,780 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:07,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:07,781 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:07,781 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:07,782 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:07,782 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0e5de97577f46d865036abdb75ab0d17479e10b3 [2018-11-28 23:24:07,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:07,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:07,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:07,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:07,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:07,870 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/mutual_simple2_true-termination.c.i [2018-11-28 23:24:07,936 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9528184/49a6454980354214a0b1ceddabf185d9/FLAGce2808e98 [2018-11-28 23:24:08,372 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:08,373 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/mutual_simple2_true-termination.c.i [2018-11-28 23:24:08,379 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9528184/49a6454980354214a0b1ceddabf185d9/FLAGce2808e98 [2018-11-28 23:24:08,744 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9528184/49a6454980354214a0b1ceddabf185d9 [2018-11-28 23:24:08,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:08,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:08,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:08,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:08,755 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:08,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:08" (1/1) ... [2018-11-28 23:24:08,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6ea25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:08, skipping insertion in model container [2018-11-28 23:24:08,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:08" (1/1) ... [2018-11-28 23:24:08,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:08,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:09,007 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:09,022 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:09,047 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:09,067 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:09,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09 WrapperNode [2018-11-28 23:24:09,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:09,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:09,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:09,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:09,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:09,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:09,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:09,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:09,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... [2018-11-28 23:24:09,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:09,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:09,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:09,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:09,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:24:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-28 23:24:09,287 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-28 23:24:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-28 23:24:09,288 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-28 23:24:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:09,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:09,705 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:09,706 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 23:24:09,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:09 BoogieIcfgContainer [2018-11-28 23:24:09,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:09,707 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:09,707 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:09,711 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:09,712 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:09,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:08" (1/3) ... [2018-11-28 23:24:09,714 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e7fbaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:09, skipping insertion in model container [2018-11-28 23:24:09,714 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:09,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:09" (2/3) ... [2018-11-28 23:24:09,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e7fbaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:09, skipping insertion in model container [2018-11-28 23:24:09,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:09,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:09" (3/3) ... [2018-11-28 23:24:09,717 INFO L375 chiAutomizerObserver]: Analyzing ICFG mutual_simple2_true-termination.c.i [2018-11-28 23:24:09,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:09,781 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:09,781 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:09,781 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:09,781 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:09,782 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:09,782 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:09,782 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:09,782 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:09,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:24:09,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:24:09,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:09,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:09,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:09,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:24:09,834 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:09,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:24:09,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:24:09,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:09,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:09,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:09,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:24:09,845 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet9, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(main_#t~nondet9, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet9; 16#L44true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 15#fENTRYtrue [2018-11-28 23:24:09,845 INFO L796 eck$LassoCheckResult]: Loop: 15#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~r.base, ~r.offset := #in~r.base, #in~r.offset;call ULTIMATE.dealloc(~r.base, ~r.offset);call #t~mem1 := read~int(~q.base, ~q.offset, 4); 17#L14true assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~s~0.base, ~s~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~mem3 := read~int(~q.base, ~q.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~q.base, ~q.offset, 4);havoc #t~mem3;havoc #t~post4; 4#L21true call g(~q.base, ~q.offset, ~s~0.base, ~s~0.offset);< 13#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;call ULTIMATE.dealloc(~s.base, ~s.offset);call #t~mem5 := read~int(~p.base, ~p.offset, 4); 14#L27true assume !(#t~mem5 < 0);havoc #t~mem5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);~r~0.base, ~r~0.offset := #t~malloc6.base, #t~malloc6.offset; 5#L33true call f(~p.base, ~p.offset, ~r~0.base, ~r~0.offset);< 15#fENTRYtrue [2018-11-28 23:24:09,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 43767, now seen corresponding path program 1 times [2018-11-28 23:24:09,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:09,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:09,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:09,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:09,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:10,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 891860259, now seen corresponding path program 1 times [2018-11-28 23:24:10,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:10,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:10,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:10,102 INFO L82 PathProgramCache]: Analyzing trace with hash -306262119, now seen corresponding path program 1 times [2018-11-28 23:24:10,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:10,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:10,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:10,554 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:24:10,720 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:24:11,026 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-28 23:24:11,174 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:24:11,779 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-11-28 23:24:12,371 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-11-28 23:24:12,732 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-28 23:24:12,909 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:24:13,066 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-28 23:24:13,159 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:13,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:13,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:13,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:13,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:13,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:13,161 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:13,161 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:13,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: mutual_simple2_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:24:13,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:13,162 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:13,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,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-28 23:24:13,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-28 23:24:13,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-28 23:24:13,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,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-28 23:24:13,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-28 23:24:13,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,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-28 23:24:13,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:14,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:14,136 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:14,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,187 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:14,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,188 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:24:14,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,190 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:14,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:14,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,300 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:14,324 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:14,325 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:14,329 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:14,334 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:14,335 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:14,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2018-11-28 23:24:14,393 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:14,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:14,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:14,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:14,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:14,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:14,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:24:14,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:14,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 23:24:14,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:14,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:14,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:14,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-28 23:24:15,016 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-28 23:24:15,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:24:15,032 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 7 states. [2018-11-28 23:24:15,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 7 states. Result 47 states and 53 transitions. Complement of second has 22 states. [2018-11-28 23:24:15,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-11-28 23:24:15,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:24:15,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:15,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:24:15,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:15,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-28 23:24:15,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:15,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2018-11-28 23:24:15,383 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:15,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2018-11-28 23:24:15,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:15,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:15,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:15,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:15,388 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:15,388 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:15,388 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:15,388 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:15,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:15,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:15,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:15,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:15 BoogieIcfgContainer [2018-11-28 23:24:15,394 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:15,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:15,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:15,395 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:15,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:09" (3/4) ... [2018-11-28 23:24:15,400 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:15,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:15,400 INFO L168 Benchmark]: Toolchain (without parser) took 6651.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:15,402 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:15,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:15,403 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.13 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:15,404 INFO L168 Benchmark]: Boogie Preprocessor took 35.90 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:15,405 INFO L168 Benchmark]: RCFGBuilder took 557.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:15,406 INFO L168 Benchmark]: BuchiAutomizer took 5687.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:15,407 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:15,412 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.13 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.90 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 557.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5687.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[q][q] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 11 SDslu, 20 SDs, 0 SdLazy, 64 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf100 lsp94 ukn60 mio100 lsp27 div100 bol100 ite100 ukn100 eq160 hnf90 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...