./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c --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-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c -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 7c08193784b646afd298f73ae6296b7af2e0cac1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:16:18,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:16:18,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:16:18,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:16:18,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:16:18,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:16:18,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:16:18,593 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:16:18,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:16:18,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:16:18,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:16:18,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:16:18,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:16:18,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:16:18,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:16:18,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:16:18,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:16:18,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:16:18,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:16:18,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:16:18,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:16:18,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:16:18,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:16:18,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:16:18,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:16:18,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:16:18,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:16:18,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:16:18,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:16:18,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:16:18,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:16:18,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:16:18,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:16:18,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:16:18,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:16:18,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:16:18,647 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:16:18,664 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:16:18,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:16:18,667 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:16:18,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:16:18,667 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:16:18,667 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:16:18,667 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:16:18,668 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:16:18,671 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:16:18,671 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:16:18,671 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:16:18,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:16:18,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:16:18,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:16:18,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:16:18,672 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:16:18,672 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:16:18,672 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:16:18,673 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:16:18,673 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:16:18,673 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:16:18,673 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:16:18,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:16:18,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:16:18,674 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:16:18,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:16:18,674 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:16:18,674 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:16:18,675 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:16:18,675 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 -> 7c08193784b646afd298f73ae6296b7af2e0cac1 [2019-01-14 02:16:18,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:16:18,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:16:18,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:16:18,759 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:16:18,759 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:16:18,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-14 02:16:18,832 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0c776e2/d8de8b88db634d8eb4d06f62a723e447/FLAGe305b8adf [2019-01-14 02:16:19,225 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:16:19,226 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-14 02:16:19,231 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0c776e2/d8de8b88db634d8eb4d06f62a723e447/FLAGe305b8adf [2019-01-14 02:16:19,605 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0c776e2/d8de8b88db634d8eb4d06f62a723e447 [2019-01-14 02:16:19,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:16:19,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:16:19,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:19,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:16:19,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:16:19,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104d3319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19, skipping insertion in model container [2019-01-14 02:16:19,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:16:19,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:16:19,863 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:19,868 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:16:19,893 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:19,910 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:16:19,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19 WrapperNode [2019-01-14 02:16:19,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:19,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:19,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:16:19,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:16:19,922 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:16:19" (1/1) ... [2019-01-14 02:16:19,928 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:16:19" (1/1) ... [2019-01-14 02:16:19,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:19,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:16:19,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:16:19,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:16:19,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (1/1) ... [2019-01-14 02:16:19,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:16:19,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:16:19,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:16:19,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:16:19,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16: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:16:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:16:20,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:16:20,310 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:16:20,310 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:16:20,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:20 BoogieIcfgContainer [2019-01-14 02:16:20,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:16:20,312 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:16:20,312 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:16:20,316 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:16:20,317 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:20,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:16:19" (1/3) ... [2019-01-14 02:16:20,318 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76cd6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:20, skipping insertion in model container [2019-01-14 02:16:20,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:20,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:19" (2/3) ... [2019-01-14 02:16:20,319 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76cd6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:20, skipping insertion in model container [2019-01-14 02:16:20,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:20,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:20" (3/3) ... [2019-01-14 02:16:20,321 INFO L375 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-14 02:16:20,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:16:20,384 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:16:20,384 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:16:20,384 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:16:20,384 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:16:20,384 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:16:20,384 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:16:20,384 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:16:20,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:16:20,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:16:20,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:16:20,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:20,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:20,429 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:16:20,429 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:20,430 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:16:20,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:16:20,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:16:20,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:20,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:20,432 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:16:20,432 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:20,440 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L19-2true [2019-01-14 02:16:20,440 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 9#L21-2true assume !(main_~j~0 <= main_~i~0); 8#L21-3true main_~i~0 := 1 + main_~i~0; 6#L19-2true [2019-01-14 02:16:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:16:20,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:16:20,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:20,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:20,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:20,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:20,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:16:20,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:20,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:20,785 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:16:20,802 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:20,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:20,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:20,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:20,803 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:20,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:20,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:20,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:20,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:20,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:20,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:20,824 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:16:20,838 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:16:20,845 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:16:21,070 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:21,071 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:21,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:21,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:21,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:21,111 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:21,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:21,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:21,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:21,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:21,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:21,177 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:21,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:21,229 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:21,386 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:21,388 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:21,388 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:21,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:21,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:21,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:21,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:21,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:21,389 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:21,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:21,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:21,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:21,393 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:16:21,406 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:16:21,436 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:16:21,579 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:21,584 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:21,586 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:16:21,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:21,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:21,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:21,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:21,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:21,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:21,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:21,605 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:16:21,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:21,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:21,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:21,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:21,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:21,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:21,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:21,627 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:16:21,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:21,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:21,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:21,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:21,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:21,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:21,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:21,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:21,677 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:16:21,677 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:16:21,682 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:21,683 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:21,683 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:21,684 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:21,685 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:21,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:21,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:21,955 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:16:21,973 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:16:21,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-14 02:16:22,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 30 states and 48 transitions. Complement of second has 9 states. [2019-01-14 02:16:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-01-14 02:16:22,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:16:22,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:22,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:16:22,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:22,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:16:22,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:22,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 48 transitions. [2019-01-14 02:16:22,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:22,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2019-01-14 02:16:22,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:16:22,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:16:22,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-01-14 02:16:22,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:22,113 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:16:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-01-14 02:16:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-14 02:16:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:16:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-14 02:16:22,138 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:16:22,138 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:16:22,138 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:16:22,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-14 02:16:22,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:22,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:22,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:22,140 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:22,140 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:16:22,140 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 83#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 85#L21-2 [2019-01-14 02:16:22,140 INFO L796 eck$LassoCheckResult]: Loop: 85#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 91#L21-2 assume !(main_~j~0 <= main_~i~0); 88#L21-3 main_~i~0 := 1 + main_~i~0; 84#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 85#L21-2 [2019-01-14 02:16:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:16:22,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1506610, now seen corresponding path program 1 times [2019-01-14 02:16:22,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:22,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 1 times [2019-01-14 02:16:22,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,315 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:22,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:22,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:22,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:22,316 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:22,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:22,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:22,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:22,317 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:22,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:22,319 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:16: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:16:22,343 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:16:22,619 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:16:22,620 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:22,620 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:22,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:22,633 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:22,679 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:22,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:22,688 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:22,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:22,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:22,757 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:22,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:22,812 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,950 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:22,953 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:22,953 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:22,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:22,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:22,954 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:22,954 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:22,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:22,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:22,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:22,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:22,958 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:16:22,965 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:16:22,971 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:16:23,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:23,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:23,083 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:16:23,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:23,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:23,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,092 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:16:23,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:23,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:23,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,102 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:16:23,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:23,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:23,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:23,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:23,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:23,118 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:23,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:23,118 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:23,119 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:23,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:23,119 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:16:23,297 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:23,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 02:16:23,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 22 states and 31 transitions. Complement of second has 6 states. [2019-01-14 02:16:23,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-14 02:16:23,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:16:23,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:16:23,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 02:16:23,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-01-14 02:16:23,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:23,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 15 states and 22 transitions. [2019-01-14 02:16:23,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:16:23,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:16:23,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2019-01-14 02:16:23,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:23,387 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-14 02:16:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2019-01-14 02:16:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 02:16:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:16:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-14 02:16:23,389 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-14 02:16:23,389 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-14 02:16:23,390 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:16:23,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2019-01-14 02:16:23,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:23,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:23,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:23,391 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:16:23,391 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:23,391 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 158#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 159#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 163#L21-2 [2019-01-14 02:16:23,392 INFO L796 eck$LassoCheckResult]: Loop: 163#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 163#L21-2 [2019-01-14 02:16:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:16:23,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:23,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:16:23,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:23,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:23,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2019-01-14 02:16:23,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:23,440 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:23,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:23,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:23,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:23,441 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:23,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:23,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:23,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:23,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:23,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:23,444 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:16:23,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:16:23,477 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:16:23,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:23,563 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:23,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:23,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:23,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:23,621 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:23,657 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:23,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:23,796 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:23,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:23,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:23,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:23,797 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:23,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:23,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:23,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:23,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:23,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:23,800 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:16:23,826 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:16:23,838 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:16:23,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:23,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:23,893 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:16:23,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:23,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:23,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,902 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:16:23,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:23,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:23,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:23,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:23,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:23,912 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:16:23,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:23,912 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:23,912 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:23,913 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-14 02:16:23,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,003 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:16:24,003 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:16:24,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10 Second operand 2 states. [2019-01-14 02:16:24,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 26 states and 38 transitions. Complement of second has 5 states. [2019-01-14 02:16:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:16:24,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:16:24,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 02:16:24,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:16:24,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. [2019-01-14 02:16:24,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:24,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 33 transitions. [2019-01-14 02:16:24,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:16:24,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:16:24,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2019-01-14 02:16:24,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:24,035 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-14 02:16:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2019-01-14 02:16:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-01-14 02:16:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:16:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-01-14 02:16:24,037 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:16:24,038 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:16:24,038 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:16:24,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-01-14 02:16:24,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:24,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:24,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:24,041 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-01-14 02:16:24,041 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:24,041 INFO L794 eck$LassoCheckResult]: Stem: 229#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 230#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 232#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 236#L21-2 assume !(main_~j~0 <= main_~i~0); 245#L21-3 main_~i~0 := 1 + main_~i~0; 243#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 239#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 238#L21-2 [2019-01-14 02:16:24,041 INFO L796 eck$LassoCheckResult]: Loop: 238#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 238#L21-2 [2019-01-14 02:16:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 2 times [2019-01-14 02:16:24,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:24,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:16:24,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:24,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:24,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:24,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:24,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash 780807227, now seen corresponding path program 3 times [2019-01-14 02:16:24,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:24,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:24,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:24,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:24,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:24,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:24,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:24,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:24,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:24,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:24,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:24,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:24,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:16:24,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:24,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:24,144 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:16:24,160 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:16:24,165 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:16:24,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:24,223 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:24,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:24,229 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:24,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:24,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:24,402 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:24,404 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:24,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:24,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:24,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:24,405 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:24,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:24,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:24,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:24,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:16:24,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:24,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:24,411 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:16:24,424 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:16:24,429 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:16:24,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:24,533 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:24,534 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:16:24,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:24,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:24,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:24,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:24,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:24,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:24,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:24,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:24,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:24,548 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:16:24,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:24,549 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:24,549 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:24,549 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-14 02:16:24,549 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,593 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:16:24,594 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:16:24,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-14 02:16:24,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 24 states and 35 transitions. Complement of second has 5 states. [2019-01-14 02:16:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:16:24,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:16:24,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,618 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,659 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:16:24,660 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:16:24,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-14 02:16:24,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 24 states and 35 transitions. Complement of second has 5 states. [2019-01-14 02:16:24,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:16:24,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:16:24,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,688 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:24,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:24,735 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:16:24,735 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:16:24,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-14 02:16:24,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2019-01-14 02:16:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:16:24,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:16:24,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-14 02:16:24,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:16:24,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:24,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-01-14 02:16:24,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:24,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-14 02:16:24,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:16:24,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:16:24,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:16:24,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:24,759 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:24,760 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:24,760 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:24,760 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:16:24,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:16:24,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:24,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:16:24,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:16:24 BoogieIcfgContainer [2019-01-14 02:16:24,767 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:16:24,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:16:24,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:16:24,767 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:16:24,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:20" (3/4) ... [2019-01-14 02:16:24,771 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:16:24,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:16:24,772 INFO L168 Benchmark]: Toolchain (without parser) took 5161.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.4 MB in the beginning and 865.9 MB in the end (delta: 85.4 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,773 INFO L168 Benchmark]: CDTParser took 0.17 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:16:24,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.96 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:16:24,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.69 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:16:24,775 INFO L168 Benchmark]: Boogie Preprocessor took 25.96 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:16:24,776 INFO L168 Benchmark]: RCFGBuilder took 333.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,777 INFO L168 Benchmark]: BuchiAutomizer took 4454.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.9 MB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,777 INFO L168 Benchmark]: Witness Printer took 4.06 ms. Allocated memory is still 1.2 GB. Free memory is still 865.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:24,782 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.17 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 297.96 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 39.69 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 25.96 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. * RCFGBuilder took 333.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4454.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.9 MB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.06 ms. Allocated memory is still 1.2 GB. Free memory is still 865.9 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 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 6 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 26 SDtfs, 32 SDslu, 9 SDs, 0 SdLazy, 50 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax191 hnf99 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf110 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...