./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex10_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/rec_malloc_ex10_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 15c6db6bd14dffda34ad35d2a51204e1169327e8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:48:12,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:48:12,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:48:12,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:48:12,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:48:12,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:48:12,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:48:12,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:48:12,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:48:12,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:48:12,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:48:12,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:48:12,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:48:12,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:48:12,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:48:12,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:48:12,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:48:12,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:48:12,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:48:12,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:48:12,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:48:12,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:48:12,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:48:12,915 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:48:12,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:48:12,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:48:12,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:48:12,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:48:12,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:48:12,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:48:12,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:48:12,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:48:12,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:48:12,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:48:12,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:48:12,923 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:12,953 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:48:12,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:48:12,955 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:48:12,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:48:12,955 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:48:12,955 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:48:12,955 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:48:12,956 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:48:12,956 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:48:12,956 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:48:12,956 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:48:12,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:48:12,957 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:48:12,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:48:12,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:48:12,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:48:12,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:48:12,957 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:48:12,958 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:48:12,958 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:48:12,958 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:48:12,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:48:12,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:48:12,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:48:12,959 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:48:12,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:48:12,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:48:12,959 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:48:12,960 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:48:12,960 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 -> 15c6db6bd14dffda34ad35d2a51204e1169327e8 [2019-01-14 02:48:13,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:48:13,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:48:13,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:48:13,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:48:13,053 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:48:13,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex10_true-termination.c.i [2019-01-14 02:48:13,116 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5468b63/1cc52bf71a7d45e9a619370d36b2fc7d/FLAGb9a131388 [2019-01-14 02:48:13,544 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:48:13,544 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex10_true-termination.c.i [2019-01-14 02:48:13,552 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5468b63/1cc52bf71a7d45e9a619370d36b2fc7d/FLAGb9a131388 [2019-01-14 02:48:13,908 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5468b63/1cc52bf71a7d45e9a619370d36b2fc7d [2019-01-14 02:48:13,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:48:13,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:48:13,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:13,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:48:13,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:48:13,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:13" (1/1) ... [2019-01-14 02:48:13,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375e8f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:13, skipping insertion in model container [2019-01-14 02:48:13,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:13" (1/1) ... [2019-01-14 02:48:13,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:48:13,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:48:14,111 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:14,131 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:48:14,152 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:14,172 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:48:14,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:14 WrapperNode [2019-01-14 02:48:14,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:14,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:14,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:48:14,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:48:14,187 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:14" (1/1) ... [2019-01-14 02:48:14,197 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:14" (1/1) ... [2019-01-14 02:48:14,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:14,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:48:14,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:48:14,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:48:14,236 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:14" (1/1) ... [2019-01-14 02:48:14,237 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:14" (1/1) ... [2019-01-14 02:48:14,240 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:14" (1/1) ... [2019-01-14 02:48:14,241 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:14" (1/1) ... [2019-01-14 02:48:14,249 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:14" (1/1) ... [2019-01-14 02:48:14,261 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:14" (1/1) ... [2019-01-14 02:48:14,263 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:14" (1/1) ... [2019-01-14 02:48:14,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:48:14,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:48:14,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:48:14,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:48:14,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:14" (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:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:48:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:48:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 02:48:14,426 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 02:48:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 02:48:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 02:48:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:48:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:48:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:48:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:48:14,834 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:48:14,834 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 02:48:14,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:14 BoogieIcfgContainer [2019-01-14 02:48:14,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:48:14,837 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:48:14,837 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:48:14,840 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:48:14,841 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:14,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:48:13" (1/3) ... [2019-01-14 02:48:14,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@101a9dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:14, skipping insertion in model container [2019-01-14 02:48:14,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:14,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:14" (2/3) ... [2019-01-14 02:48:14,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@101a9dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:14, skipping insertion in model container [2019-01-14 02:48:14,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:14,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:14" (3/3) ... [2019-01-14 02:48:14,846 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex10_true-termination.c.i [2019-01-14 02:48:14,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:48:14,908 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:48:14,908 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:48:14,909 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:48:14,909 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:48:14,909 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:48:14,909 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:48:14,909 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:48:14,909 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:48:14,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:48:14,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:48:14,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:14,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:14,965 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:14,965 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:48:14,965 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:48:14,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:48:14,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:48:14,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:14,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:14,968 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:14,968 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:48:14,977 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_#t~nondet10, 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;call write~int(main_#t~nondet10, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet10; 5#L49true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 13#fENTRYtrue [2019-01-14 02:48:14,978 INFO L796 eck$LassoCheckResult]: Loop: 13#fENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);call #t~mem2 := read~int(~q.base, ~q.offset, 4); 15#L13true assume !(#t~mem1 + #t~mem2 < 0);havoc #t~mem2;havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~np~0.base, ~np~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);call write~int(#t~mem4 - 1, ~np~0.base, ~np~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~p.base, ~p.offset); 17#L23true call g(~q.base, ~q.offset, ~np~0.base, ~np~0.offset);< 12#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);call #t~mem6 := read~int(~q.base, ~q.offset, 4); 7#L31true assume !(#t~mem5 + #t~mem6 < 0);havoc #t~mem5;havoc #t~mem6; 18#L35true call f(~q.base, ~q.offset, ~p.base, ~p.offset);< 13#fENTRYtrue [2019-01-14 02:48:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 43766, now seen corresponding path program 1 times [2019-01-14 02:48:14,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash 891830467, now seen corresponding path program 1 times [2019-01-14 02:48:15,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:15,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:15,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:15,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:15,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1193795592, now seen corresponding path program 1 times [2019-01-14 02:48:15,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:15,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:15,589 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 02:48:15,728 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:48:15,932 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 02:48:16,174 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 02:48:16,927 WARN L181 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-14 02:48:17,057 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:48:17,184 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:48:17,725 WARN L181 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-01-14 02:48:18,164 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-14 02:48:18,314 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-14 02:48:18,452 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:48:18,537 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:18,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:18,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:18,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:18,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:18,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:18,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:18,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:18,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex10_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:48:18,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:18,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:18,569 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:18,589 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:18,612 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:18,615 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:18,617 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:18,619 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:18,622 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:18,640 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:18,643 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:18,647 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:18,651 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:18,655 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:18,690 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:18,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:18,698 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:18,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:18,710 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:18,712 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:18,716 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:18,718 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:18,720 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:18,727 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:18,731 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:18,736 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:18,740 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:18,745 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:18,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:18,751 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:18,754 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:18,761 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:18,936 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-14 02:48:19,249 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-01-14 02:48:19,249 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:19,252 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:19,254 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:19,256 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:19,261 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:19,263 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:19,266 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:19,268 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:19,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:19,985 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:19,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:19,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,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:20,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:20,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:20,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,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:20,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,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:20,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:20,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:20,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,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:20,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:20,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:20,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:20,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:20,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:20,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:20,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:20,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:20,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:20,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:20,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:20,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,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:20,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,266 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:48:20,266 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:48:20,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,276 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-01-14 02:48:20,276 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:48:20,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:20,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:20,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:20,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:20,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:20,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:20,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:20,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:20,388 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:20,415 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:48:20,416 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:48:20,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:20,420 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:20,420 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:20,421 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1, v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~p.base) f_#in~p.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:20,463 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:48:20,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:20,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:20,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:20,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:20,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:20,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:20,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 02:48:20,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:20,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 56 [2019-01-14 02:48:20,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-01-14 02:48:20,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:20,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:20,879 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 2 case distinctions, treesize of input 38 treesize of output 48 [2019-01-14 02:48:20,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:20,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:20,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:20,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:78 [2019-01-14 02:48:21,286 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:21,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:48:21,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 6 states. [2019-01-14 02:48:21,561 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 6 states. Result 46 states and 52 transitions. Complement of second has 20 states. [2019-01-14 02:48:21,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:48:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 02:48:21,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:48:21,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:21,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:48:21,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:21,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-01-14 02:48:21,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:21,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2019-01-14 02:48:21,575 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:21,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-01-14 02:48:21,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:21,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:21,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:21,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:21,580 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:21,580 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:21,580 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:21,580 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:48:21,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:21,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:21,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:21,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:21 BoogieIcfgContainer [2019-01-14 02:48:21,587 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:21,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:21,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:21,587 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:21,588 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:14" (3/4) ... [2019-01-14 02:48:21,592 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:21,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:21,593 INFO L168 Benchmark]: Toolchain (without parser) took 7680.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 951.4 MB in the beginning and 977.9 MB in the end (delta: -26.5 MB). Peak memory consumption was 179.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:21,594 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-14 02:48:21,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.08 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. [2019-01-14 02:48:21,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.10 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. [2019-01-14 02:48:21,596 INFO L168 Benchmark]: Boogie Preprocessor took 42.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 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:21,597 INFO L168 Benchmark]: RCFGBuilder took 568.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:21,598 INFO L168 Benchmark]: BuchiAutomizer took 6750.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 115.4 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:21,599 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.2 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:21,604 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.08 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 51.10 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 42.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 568.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6750.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 115.4 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.2 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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[p][p] + unknown-#memory_int-unknown[q][q] and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. 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: 12 SDtfs, 12 SDslu, 22 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf100 lsp97 ukn64 mio100 lsp38 div100 bol100 ite100 ukn100 eq164 hnf90 smp96 dnf101 smp98 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...