./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 0ed9222f 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-0ed9222-m [2019-01-14 02:48:04,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:48:04,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:48:04,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:48:04,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:48:04,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:48:04,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:48:04,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:48:04,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:48:04,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:48:04,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:48:04,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:48:04,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:48:04,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:48:04,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:48:04,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:48:04,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:48:04,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:48:04,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:48:04,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:48:04,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:48:04,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:48:04,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:48:04,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:48:04,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:48:04,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:48:04,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:48:04,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:48:04,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:48:04,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:48:04,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:48:04,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:48:04,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:48:04,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:48:04,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:48:04,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:48:04,661 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:48:04,687 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:48:04,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:48:04,689 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:48:04,689 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:48:04,692 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:48:04,692 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:48:04,692 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:48:04,692 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:48:04,692 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:48:04,693 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:48:04,694 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:48:04,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:48:04,694 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:48:04,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:48:04,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:48:04,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:48:04,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:48:04,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:48:04,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:48:04,696 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:48:04,696 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:48:04,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:48:04,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:48:04,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:48:04,699 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:48:04,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:48:04,699 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:48:04,699 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:48:04,701 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:48:04,701 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 [2019-01-14 02:48:04,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:48:04,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:48:04,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:48:04,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:48:04,765 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:48:04,765 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/mutual_simple2_true-termination.c.i [2019-01-14 02:48:04,823 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014f50014/b652c3bf137c454a89be3bc64cf484c8/FLAGf0b4ff740 [2019-01-14 02:48:05,264 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:48:05,265 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/mutual_simple2_true-termination.c.i [2019-01-14 02:48:05,272 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014f50014/b652c3bf137c454a89be3bc64cf484c8/FLAGf0b4ff740 [2019-01-14 02:48:05,631 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014f50014/b652c3bf137c454a89be3bc64cf484c8 [2019-01-14 02:48:05,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:48:05,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:48:05,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:05,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:48:05,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:48:05,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6161e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05, skipping insertion in model container [2019-01-14 02:48:05,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:48:05,672 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:48:05,861 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:05,878 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:48:05,896 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:05,913 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:48:05,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05 WrapperNode [2019-01-14 02:48:05,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:05,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:05,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:48:05,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:48:05,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:05,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:48:05,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:48:05,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:48:05,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (1/1) ... [2019-01-14 02:48:05,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:48:05,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:48:05,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:48:05,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:48:05,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (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 [2019-01-14 02:48:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:48:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:48:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 02:48:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 02:48:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 02:48:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 02:48:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:48:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:48:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:48:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:48:06,450 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:48:06,450 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 02:48:06,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:06 BoogieIcfgContainer [2019-01-14 02:48:06,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:48:06,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:48:06,452 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:48:06,455 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:48:06,456 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:06,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:48:05" (1/3) ... [2019-01-14 02:48:06,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c9c6dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:06, skipping insertion in model container [2019-01-14 02:48:06,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:06,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:05" (2/3) ... [2019-01-14 02:48:06,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c9c6dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:06, skipping insertion in model container [2019-01-14 02:48:06,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:06,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:06" (3/3) ... [2019-01-14 02:48:06,460 INFO L375 chiAutomizerObserver]: Analyzing ICFG mutual_simple2_true-termination.c.i [2019-01-14 02:48:06,511 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:48:06,511 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:48:06,512 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:48:06,512 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:48:06,512 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:48:06,512 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:48:06,512 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:48:06,512 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:48:06,512 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:48:06,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:48:06,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:48:06,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:06,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:06,566 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:06,566 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:48:06,566 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:48:06,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:48:06,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:48:06,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:06,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:06,570 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:06,570 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:48:06,578 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.allocOnHeap(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.allocOnHeap(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 [2019-01-14 02:48:06,579 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.allocOnHeap(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.allocOnHeap(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 [2019-01-14 02:48:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash 43767, now seen corresponding path program 1 times [2019-01-14 02:48:06,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:06,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:06,730 INFO L82 PathProgramCache]: Analyzing trace with hash 891860259, now seen corresponding path program 1 times [2019-01-14 02:48:06,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash -306262119, now seen corresponding path program 1 times [2019-01-14 02:48:06,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,283 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 02:48:07,461 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-14 02:48:07,696 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 02:48:07,821 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:48:08,300 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-14 02:48:08,504 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:48:08,950 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-01-14 02:48:09,348 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-14 02:48:09,581 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-14 02:48:09,653 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:09,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:09,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:09,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:09,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:09,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:09,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:09,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:09,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: mutual_simple2_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:48:09,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:09,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:09,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:09,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:10,929 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-01-14 02:48:11,013 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:11,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:11,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:11,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:11,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:11,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:11,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,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 [2019-01-14 02:48:11,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,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 [2019-01-14 02:48:11,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,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 [2019-01-14 02:48:11,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:11,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:11,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:11,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:11,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:11,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:11,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:11,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:11,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:11,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:11,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:11,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:11,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:11,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:11,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:11,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:11,295 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:48:11,295 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:48:11,298 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:11,300 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:11,301 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:11,301 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 [] [2019-01-14 02:48:11,340 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:48:11,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:11,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:11,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:11,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:11,498 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 [2019-01-14 02:48:11,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:11,505 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 [2019-01-14 02:48:11,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:11,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:11,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:11,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-01-14 02:48:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:11,647 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 [2019-01-14 02:48:11,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 7 states. [2019-01-14 02:48:11,968 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. [2019-01-14 02:48:11,969 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 [2019-01-14 02:48:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:48:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-01-14 02:48:11,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:48:11,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:11,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:48:11,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:11,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-01-14 02:48:11,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:11,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2019-01-14 02:48:11,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:11,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2019-01-14 02:48:11,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:11,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:11,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:11,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:11,986 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:11,986 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:11,986 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:11,986 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:48:11,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:11,987 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:11,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:11,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:11 BoogieIcfgContainer [2019-01-14 02:48:11,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:11,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:11,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:11,994 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:11,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:06" (3/4) ... [2019-01-14 02:48:11,997 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:11,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:11,998 INFO L168 Benchmark]: Toolchain (without parser) took 6363.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -80.3 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:12,000 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:12,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.76 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:12,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:12,002 INFO L168 Benchmark]: Boogie Preprocessor took 31.74 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:12,003 INFO L168 Benchmark]: RCFGBuilder took 467.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:12,004 INFO L168 Benchmark]: BuchiAutomizer took 5539.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.4 MB). Peak memory consumption was 140.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:12,006 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:12,011 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.76 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 37.15 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.74 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5539.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.4 MB). Peak memory consumption was 140.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: inital224 mio100 ax100 hnf100 lsp94 ukn62 mio100 lsp25 div100 bol100 ite100 ukn100 eq160 hnf98 smp100 dnf280 smp91 tf100 neg88 sie147 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...