./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-linkedlists/ll_create_rec-alloca_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-memory-linkedlists/ll_create_rec-alloca_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 6051a5fb5d8f122488338219baae2c7290933e19 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38:18,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:38:18,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:38:18,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:38:18,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:38:18,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:38:18,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:38:18,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:38:18,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:38:18,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:38:18,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:38:18,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:38:18,279 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:38:18,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:38:18,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:38:18,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:38:18,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:38:18,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:38:18,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:38:18,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:38:18,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:38:18,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:38:18,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:38:18,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:38:18,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:38:18,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:38:18,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:38:18,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:38:18,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:38:18,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:38:18,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:38:18,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:38:18,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:38:18,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:38:18,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:38:18,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:38:18,304 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:38:18,338 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:38:18,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:38:18,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:38:18,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:38:18,340 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:38:18,341 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:38:18,342 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:38:18,342 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:38:18,343 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:38:18,343 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:38:18,343 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:38:18,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:38:18,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:38:18,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:38:18,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:38:18,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:38:18,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:38:18,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:38:18,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:38:18,346 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:38:18,346 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:38:18,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:38:18,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:38:18,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:38:18,347 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:38:18,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:38:18,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:38:18,350 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:38:18,352 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:38:18,352 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 -> 6051a5fb5d8f122488338219baae2c7290933e19 [2019-01-14 02:38:18,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:38:18,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:38:18,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:38:18,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:38:18,427 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:38:18,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-linkedlists/ll_create_rec-alloca_true-termination.c.i [2019-01-14 02:38:18,489 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da4152c6/91fd28d269574a3cbbce893e510c3bcd/FLAG016f40c96 [2019-01-14 02:38:18,989 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:38:18,989 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-linkedlists/ll_create_rec-alloca_true-termination.c.i [2019-01-14 02:38:19,001 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da4152c6/91fd28d269574a3cbbce893e510c3bcd/FLAG016f40c96 [2019-01-14 02:38:19,321 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da4152c6/91fd28d269574a3cbbce893e510c3bcd [2019-01-14 02:38:19,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:38:19,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:38:19,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:38:19,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:38:19,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:38:19,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:19,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591a51b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19, skipping insertion in model container [2019-01-14 02:38:19,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:19,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:38:19,382 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:38:19,758 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:38:19,777 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:38:19,846 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:38:19,899 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:38:19,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19 WrapperNode [2019-01-14 02:38:19,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:38:19,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:38:19,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:38:19,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:38:19,973 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:38:19" (1/1) ... [2019-01-14 02:38:19,998 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:38:19" (1/1) ... [2019-01-14 02:38:20,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:38:20,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:38:20,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:38:20,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:38:20,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (1/1) ... [2019-01-14 02:38:20,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:38:20,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:38:20,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:38:20,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:38:20,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (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:38:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2019-01-14 02:38:20,105 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2019-01-14 02:38:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:38:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:38:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 02:38:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:38:20,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:38:20,412 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:38:20,413 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 02:38:20,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:38:20 BoogieIcfgContainer [2019-01-14 02:38:20,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:38:20,415 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:38:20,415 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:38:20,418 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:38:20,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:38:20,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:38:19" (1/3) ... [2019-01-14 02:38:20,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1423a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:38:20, skipping insertion in model container [2019-01-14 02:38:20,420 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:38:20,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:38:19" (2/3) ... [2019-01-14 02:38:20,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1423a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:38:20, skipping insertion in model container [2019-01-14 02:38:20,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:38:20,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:38:20" (3/3) ... [2019-01-14 02:38:20,422 INFO L375 chiAutomizerObserver]: Analyzing ICFG ll_create_rec-alloca_true-termination.c.i [2019-01-14 02:38:20,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:38:20,480 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:38:20,480 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:38:20,480 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:38:20,481 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:38:20,481 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:38:20,481 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:38:20,481 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:38:20,481 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:38:20,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:38:20,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:38:20,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:38:20,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:38:20,536 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:38:20,536 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:38:20,536 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:38:20,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:38:20,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:38:20,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:38:20,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:38:20,541 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:38:20,541 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:38:20,549 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5.base, main_#t~ret5.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 4#L558true assume !(main_~n~0 < 0); 13#L561true call main_#t~ret5.base, main_#t~ret5.offset := new_ll(main_~n~0);< 11#new_llENTRYtrue [2019-01-14 02:38:20,549 INFO L796 eck$LassoCheckResult]: Loop: 11#new_llENTRYtrue ~n := #in~n; 16#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 6#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 11#new_llENTRYtrue [2019-01-14 02:38:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:20,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1171947, now seen corresponding path program 1 times [2019-01-14 02:38:20,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:38:20,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:38:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:38:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:38:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:38:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:38:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:38:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 29936, now seen corresponding path program 1 times [2019-01-14 02:38:20,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:38:20,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:38:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:38:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:38:20,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:38:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:38:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:38:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 553734854, now seen corresponding path program 1 times [2019-01-14 02:38:20,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:38:20,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:38:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:38:20,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:38:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:38:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:38:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:38:21,348 WARN L181 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-01-14 02:38:21,508 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:38:21,736 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:38:21,953 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 02:38:22,116 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 02:38:22,256 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:38:22,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:38:22,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:38:22,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:38:22,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:38:22,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:38:22,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:38:22,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:38:22,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_create_rec-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:38:22,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:38:22,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:38:22,284 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:38:22,308 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:38:22,313 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:38:22,317 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:38:22,320 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:38:22,323 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:38:22,327 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:38:22,336 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:38:22,339 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:38:22,345 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:38:22,350 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:38:22,351 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:38:22,354 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:38:22,357 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:38:22,361 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:38:22,363 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:38:22,368 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:38:22,384 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:38:22,387 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:38:22,445 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:38:22,447 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:38:22,449 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:38:22,796 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:38:22,800 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:38:22,802 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:38:22,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,812 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:38:22,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,816 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:38:22,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,821 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:38:22,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,824 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:38:22,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,827 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:38:22,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,831 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:38:22,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:22,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:22,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,839 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:38:22,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,843 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:38:22,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,846 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:38:22,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:22,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:22,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,856 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:38:22,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,859 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:38:22,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,863 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:38:22,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,866 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:38:22,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:22,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:22,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,873 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:38:22,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,880 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:38:22,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:22,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:22,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,887 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:38:22,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:22,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,890 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:38:22,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:38:22,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:22,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:22,901 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:38:22,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:22,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:22,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:38:22,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:22,910 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:38:22,910 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:38:22,983 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:38:23,054 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:38:23,056 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:38:23,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:38:23,064 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 02:38:23,065 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:38:23,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2019-01-14 02:38:23,098 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:38:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:23,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:23,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:23,317 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:38:23,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:38:23,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 5 states. [2019-01-14 02:38:23,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 5 states. Result 32 states and 36 transitions. Complement of second has 13 states. [2019-01-14 02:38:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:38:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:38:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 02:38:23,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:38:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:38:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:38:23,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:23,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2019-01-14 02:38:23,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:38:23,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 02:38:23,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:38:23,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:38:23,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:38:23,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:38:23,615 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:38:23,615 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:38:23,615 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:38:23,615 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:38:23,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:38:23,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:38:23,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:38:23,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:38:23 BoogieIcfgContainer [2019-01-14 02:38:23,622 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:38:23,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:38:23,623 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:38:23,623 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:38:23,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:38:20" (3/4) ... [2019-01-14 02:38:23,627 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:38:23,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:38:23,628 INFO L168 Benchmark]: Toolchain (without parser) took 4302.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.3 MB in the beginning and 918.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 153.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:23,629 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:38:23,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.20 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:23,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:23,631 INFO L168 Benchmark]: Boogie Preprocessor took 22.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:38:23,632 INFO L168 Benchmark]: RCFGBuilder took 368.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:23,633 INFO L168 Benchmark]: BuchiAutomizer took 3207.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.0 MB in the end (delta: 181.0 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:23,634 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.2 GB. Free memory is still 918.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:38:23,639 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 573.20 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 368.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3207.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.0 MB in the end (delta: 181.0 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.2 GB. Free memory is still 918.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 \old(n) and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: 9 SDtfs, 12 SDslu, 5 SDs, 0 SdLazy, 18 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf100 lsp95 ukn25 mio100 lsp42 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 164ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...