./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.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 ecbf88ff5eccf5176dc1eb8ce718b872e4a38037 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:14:33,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:14:33,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:14:33,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:14:33,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:14:33,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:14:33,660 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:14:33,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:14:33,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:14:33,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:14:33,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:14:33,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:14:33,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:14:33,670 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:14:33,671 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:14:33,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:14:33,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:14:33,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:14:33,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:14:33,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:14:33,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:14:33,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:14:33,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:14:33,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:14:33,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:14:33,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:14:33,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:14:33,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:14:33,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:14:33,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:14:33,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:14:33,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:14:33,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:14:33,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:14:33,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:14:33,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:14:33,696 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:14:33,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:14:33,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:14:33,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:14:33,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:14:33,736 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:14:33,738 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:14:33,738 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:14:33,738 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:14:33,739 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:14:33,739 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:14:33,739 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:14:33,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:14:33,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:14:33,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:14:33,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:14:33,742 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:14:33,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:14:33,743 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:14:33,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:14:33,743 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:14:33,743 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:14:33,743 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:14:33,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:14:33,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:14:33,744 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:14:33,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:14:33,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:14:33,744 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:14:33,749 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:14:33,750 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 -> ecbf88ff5eccf5176dc1eb8ce718b872e4a38037 [2018-11-28 23:14:33,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:14:33,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:14:33,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:14:33,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:14:33,848 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:14:33,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2018-11-28 23:14:33,920 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f65241b5/ed5d36d399c044eb8be4b100b721b123/FLAG4f2e82da8 [2018-11-28 23:14:34,383 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:14:34,384 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2018-11-28 23:14:34,392 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f65241b5/ed5d36d399c044eb8be4b100b721b123/FLAG4f2e82da8 [2018-11-28 23:14:34,747 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f65241b5/ed5d36d399c044eb8be4b100b721b123 [2018-11-28 23:14:34,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:14:34,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:14:34,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:34,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:14:34,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:14:34,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:34" (1/1) ... [2018-11-28 23:14:34,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1435883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:34, skipping insertion in model container [2018-11-28 23:14:34,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:34" (1/1) ... [2018-11-28 23:14:34,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:14:34,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:14:35,079 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:35,091 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:14:35,127 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:35,146 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:14:35,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35 WrapperNode [2018-11-28 23:14:35,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:35,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:35,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:14:35,149 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:14:35,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:35,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:14:35,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:14:35,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:14:35,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... [2018-11-28 23:14:35,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:14:35,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:14:35,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:14:35,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:14:35,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:14:35,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:14:35,822 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:14:35,822 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:14:35,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:35 BoogieIcfgContainer [2018-11-28 23:14:35,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:14:35,826 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:14:35,826 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:14:35,834 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:14:35,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:35,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:14:34" (1/3) ... [2018-11-28 23:14:35,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a7c4517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:35, skipping insertion in model container [2018-11-28 23:14:35,838 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:35,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:35" (2/3) ... [2018-11-28 23:14:35,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a7c4517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:35, skipping insertion in model container [2018-11-28 23:14:35,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:35,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:35" (3/3) ... [2018-11-28 23:14:35,843 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2018-11-28 23:14:35,964 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:14:35,969 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:14:35,977 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:14:35,977 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:14:35,977 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:14:35,978 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:14:35,978 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:14:35,978 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:14:35,978 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:14:35,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:14:36,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:14:36,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:36,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:36,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:36,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:36,033 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:14:36,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:14:36,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:14:36,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:36,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:36,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:36,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:36,048 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 7#L20true assume !!(-268435455 <= main_~y~0); 10#L21true assume !!(-268435455 <= main_~z~0); 12#L22true assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := 1; 8#L22-2true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 3#L27-1true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 9#L32-1true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 19#L37-1true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 6#L42-1true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 18#L47-1true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 5#L52-1true assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 16#L57-1true assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 15#L67-1true [2018-11-28 23:14:36,049 INFO L796 eck$LassoCheckResult]: Loop: 15#L67-1true assume !!(main_~y~0 < 100 && main_~z~0 < 100);main_~y~0 := main_~y~0 + main_~x~0;main_~z~0 := main_~z~0 - main_~x~0; 15#L67-1true [2018-11-28 23:14:36,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 21841375, now seen corresponding path program 1 times [2018-11-28 23:14:36,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:36,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:36,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:36,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:14:36,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:14:36,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:14:36,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2018-11-28 23:14:36,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:14:36,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:14:36,358 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-28 23:14:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:36,601 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-28 23:14:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:14:36,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2018-11-28 23:14:36,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-28 23:14:36,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 31 transitions. [2018-11-28 23:14:36,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 23:14:36,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 23:14:36,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-11-28 23:14:36,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:36,626 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 23:14:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-11-28 23:14:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:14:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:14:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 23:14:36,670 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:14:36,670 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:14:36,670 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:14:36,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 23:14:36,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:14:36,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:36,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:36,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:36,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:36,682 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 63#L20 assume !!(-268435455 <= main_~y~0); 64#L21 assume !!(-268435455 <= main_~z~0); 66#L22 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := -1; 68#L22-2 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 56#L27-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 57#L32-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 65#L37-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 60#L42-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 61#L47-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 58#L52-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 59#L57-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 69#L67-1 [2018-11-28 23:14:36,682 INFO L796 eck$LassoCheckResult]: Loop: 69#L67-1 assume !!(main_~y~0 < 100 && main_~z~0 < 100);main_~y~0 := main_~y~0 + main_~x~0;main_~z~0 := main_~z~0 - main_~x~0; 69#L67-1 [2018-11-28 23:14:36,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash -322927901, now seen corresponding path program 1 times [2018-11-28 23:14:36,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:36,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:36,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:36,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:36,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:14:36,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:14:36,767 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:14:36,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 2 times [2018-11-28 23:14:36,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:36,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:36,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:14:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:14:36,946 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:14:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:37,097 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-28 23:14:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:14:37,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2018-11-28 23:14:37,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-28 23:14:37,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2018-11-28 23:14:37,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 23:14:37,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 23:14:37,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2018-11-28 23:14:37,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:37,103 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-28 23:14:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2018-11-28 23:14:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:14:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:14:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:14:37,112 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:14:37,112 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:14:37,112 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:14:37,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-28 23:14:37,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:14:37,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:37,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:37,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:37,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:37,118 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 111#L20 assume !!(-268435455 <= main_~y~0); 112#L21 assume !!(-268435455 <= main_~z~0); 115#L22 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := -1; 113#L22-2 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 105#L27-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 106#L32-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 114#L37-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 109#L42-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 110#L47-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 123#L52-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 122#L57-1 assume !(main_~x~0 > 0);main_~x~0 := main_~x~0 - 1; 118#L67-1 [2018-11-28 23:14:37,118 INFO L796 eck$LassoCheckResult]: Loop: 118#L67-1 assume !!(main_~y~0 < 100 && main_~z~0 < 100);main_~y~0 := main_~y~0 + main_~x~0;main_~z~0 := main_~z~0 - main_~x~0; 118#L67-1 [2018-11-28 23:14:37,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash 701899747, now seen corresponding path program 1 times [2018-11-28 23:14:37,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:37,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:37,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:37,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:37,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 3 times [2018-11-28 23:14:37,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:37,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:37,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:37,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:37,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:37,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash 284055750, now seen corresponding path program 1 times [2018-11-28 23:14:37,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:37,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:37,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:37,659 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-11-28 23:14:37,692 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:37,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:37,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:37,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:37,694 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:37,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:37,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:37,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:37,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration3_Lasso [2018-11-28 23:14:37,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:37,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:37,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:37,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:37,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:37,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:37,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:37,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:37,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:38,040 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:14:38,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:38,404 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 [2018-11-28 23:14:38,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:38,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:38,421 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:38,421 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} 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 [2018-11-28 23:14:38,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:38,445 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:38,471 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:38,471 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:38,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:38,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:38,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:38,482 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:38,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:38,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:38,522 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:38,522 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:38,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:38,550 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:38,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:38,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:50,734 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:14:50,746 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:50,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:50,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:50,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:50,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:50,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:50,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:50,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:50,747 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration3_Lasso [2018-11-28 23:14:50,747 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:50,747 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:50,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,322 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:14:51,349 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:51,355 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:51,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:51,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:51,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:51,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:51,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:51,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:51,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:51,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:51,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:51,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:51,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:51,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:51,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:51,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:51,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:51,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:51,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:51,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:51,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:51,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:51,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:51,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:51,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:51,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:51,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:51,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:51,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:51,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:51,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:51,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:51,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:51,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:51,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:51,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:51,454 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:51,454 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:51,458 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:51,461 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:14:51,461 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:51,462 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = -2*ULTIMATE.start_main_~z~0 + 207 Supporting invariants [-1*ULTIMATE.start_main_~x~0 - 9 >= 0] [2018-11-28 23:14:51,479 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:14:51,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:51,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:52,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:52,019 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 1 loop predicates [2018-11-28 23:14:52,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-11-28 23:14:52,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 22 transitions. cyclomatic complexity: 2. Second operand 10 states. Result 23 states and 24 transitions. Complement of second has 10 states. [2018-11-28 23:14:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:14:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-11-28 23:14:52,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 12 letters. Loop has 1 letters. [2018-11-28 23:14:52,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:52,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 13 letters. Loop has 1 letters. [2018-11-28 23:14:52,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:52,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 23:14:52,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:52,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-28 23:14:52,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:14:52,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 13 states and 13 transitions. [2018-11-28 23:14:52,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:14:52,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:14:52,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 13 transitions. [2018-11-28 23:14:52,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:52,576 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-28 23:14:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 13 transitions. [2018-11-28 23:14:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 23:14:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:14:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-28 23:14:52,579 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-28 23:14:52,580 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-28 23:14:52,580 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:14:52,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 13 transitions. [2018-11-28 23:14:52,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:14:52,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:52,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:52,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:52,583 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:52,583 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 243#L20 assume !!(-268435455 <= main_~y~0); 244#L21 assume !!(-268435455 <= main_~z~0); 247#L22 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := 1; 245#L22-2 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 237#L27-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 238#L32-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 246#L37-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 241#L42-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 242#L47-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 239#L52-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 240#L57-1 assume main_~x~0 > 0;main_~x~0 := 1 + main_~x~0; 249#L67-1 [2018-11-28 23:14:52,584 INFO L796 eck$LassoCheckResult]: Loop: 249#L67-1 assume !!(main_~y~0 < 100 && main_~z~0 < 100);main_~y~0 := main_~y~0 + main_~x~0;main_~z~0 := main_~z~0 - main_~x~0; 249#L67-1 [2018-11-28 23:14:52,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1002986271, now seen corresponding path program 1 times [2018-11-28 23:14:52,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:52,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 4 times [2018-11-28 23:14:52,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1027803256, now seen corresponding path program 1 times [2018-11-28 23:14:52,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,775 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:14:52,901 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:14:53,040 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-11-28 23:14:53,052 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:53,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:53,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:53,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:53,053 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:53,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:53,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:53,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-11-28 23:14:53,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:53,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:53,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,274 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:14:53,414 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:53,415 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,423 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,444 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:14:53,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,478 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,481 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,481 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} 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 [2018-11-28 23:14:53,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:14:53,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,553 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,554 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 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 [2018-11-28 23:14:53,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,562 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:14:53,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,586 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:53,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:05,595 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:05,606 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:05,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:05,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:05,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:05,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:05,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:05,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:05,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:05,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-11-28 23:15:05,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:05,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:05,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:05,742 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:05,743 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:05,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:05,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:05,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:05,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:05,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:05,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:05,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:05,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:05,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:05,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:05,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:05,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:05,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:05,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:05,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:05,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:05,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:05,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:05,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:05,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:05,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:05,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:05,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:05,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:05,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:05,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:05,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:05,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:05,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:05,813 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:05,857 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:15:05,860 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:15:05,860 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:05,863 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:15:05,863 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:05,863 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 207 Supporting invariants [1*ULTIMATE.start_main_~x~0 - 9 >= 0] [2018-11-28 23:15:05,890 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:15:05,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:05,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:06,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:06,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 1 loop predicates [2018-11-28 23:15:06,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 13 transitions. cyclomatic complexity: 1 Second operand 10 states. [2018-11-28 23:15:06,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 13 transitions. cyclomatic complexity: 1. Second operand 10 states. Result 14 states and 14 transitions. Complement of second has 10 states. [2018-11-28 23:15:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:15:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:15:06,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 12 letters. Loop has 1 letters. [2018-11-28 23:15:06,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:06,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 13 letters. Loop has 1 letters. [2018-11-28 23:15:06,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:06,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 23:15:06,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:06,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-11-28 23:15:06,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:06,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-28 23:15:06,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:15:06,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:15:06,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:15:06,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:15:06,235 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:06,235 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:06,235 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:06,235 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:15:06,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:15:06,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:06,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:15:06,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:15:06 BoogieIcfgContainer [2018-11-28 23:15:06,242 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:15:06,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:15:06,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:15:06,243 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:15:06,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:35" (3/4) ... [2018-11-28 23:15:06,247 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:15:06,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:15:06,248 INFO L168 Benchmark]: Toolchain (without parser) took 31496.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:06,249 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:06,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.26 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:06,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:06,251 INFO L168 Benchmark]: Boogie Preprocessor took 51.08 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:06,252 INFO L168 Benchmark]: RCFGBuilder took 569.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:06,252 INFO L168 Benchmark]: BuchiAutomizer took 30416.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:06,254 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:06,260 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.21 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 394.26 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 54.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.08 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 569.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30416.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * z + 207 and consists of 10 locations. One deterministic module has affine ranking function -2 * y + 207 and consists of 10 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 28.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 23 SDslu, 16 SDs, 0 SdLazy, 91 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital34 mio100 ax135 hnf95 lsp72 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf93 smp100 dnf100 smp100 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 24.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...