./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/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-0ed9222-m [2019-01-14 02:15:31,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:15:31,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:15:31,492 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:15:31,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:15:31,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:15:31,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:15:31,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:15:31,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:15:31,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:15:31,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:15:31,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:15:31,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:15:31,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:15:31,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:15:31,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:15:31,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:15:31,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:15:31,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:15:31,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:15:31,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:15:31,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:15:31,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:15:31,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:15:31,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:15:31,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:15:31,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:15:31,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:15:31,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:15:31,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:15:31,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:15:31,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:15:31,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:15:31,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:15:31,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:15:31,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:15:31,526 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:15:31,551 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:15:31,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:15:31,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:15:31,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:15:31,552 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:15:31,553 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:15:31,553 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:15:31,553 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:15:31,553 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:15:31,553 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:15:31,553 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:15:31,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:15:31,555 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:15:31,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:15:31,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:15:31,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:15:31,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:15:31,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:15:31,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:15:31,557 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:15:31,557 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:15:31,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:15:31,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:15:31,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:15:31,558 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:15:31,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:15:31,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:15:31,558 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:15:31,560 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:15:31,560 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 [2019-01-14 02:15:31,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:15:31,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:15:31,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:15:31,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:15:31,613 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:15:31,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2019-01-14 02:15:31,676 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff762551/adf7893ea0644ab889fa31186f40461b/FLAG3258820a2 [2019-01-14 02:15:32,066 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:15:32,066 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2019-01-14 02:15:32,074 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff762551/adf7893ea0644ab889fa31186f40461b/FLAG3258820a2 [2019-01-14 02:15:32,471 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff762551/adf7893ea0644ab889fa31186f40461b [2019-01-14 02:15:32,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:15:32,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:15:32,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:15:32,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:15:32,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:15:32,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8b5888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32, skipping insertion in model container [2019-01-14 02:15:32,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:15:32,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:15:32,723 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:15:32,729 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:15:32,753 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:15:32,769 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:15:32,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32 WrapperNode [2019-01-14 02:15:32,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:15:32,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:15:32,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:15:32,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:15:32,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:15:32,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:15:32,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:15:32,816 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:15:32,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... [2019-01-14 02:15:32,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:15:32,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:15:32,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:15:32,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:15:32,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:15:32,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:15:33,260 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:15:33,260 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:15:33,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:15:33 BoogieIcfgContainer [2019-01-14 02:15:33,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:15:33,262 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:15:33,263 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:15:33,266 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:15:33,267 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:15:33,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:15:32" (1/3) ... [2019-01-14 02:15:33,269 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd6732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:15:33, skipping insertion in model container [2019-01-14 02:15:33,269 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:15:33,269 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:15:32" (2/3) ... [2019-01-14 02:15:33,269 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd6732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:15:33, skipping insertion in model container [2019-01-14 02:15:33,269 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:15:33,270 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:15:33" (3/3) ... [2019-01-14 02:15:33,271 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2019-01-14 02:15:33,328 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:15:33,328 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:15:33,328 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:15:33,329 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:15:33,329 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:15:33,329 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:15:33,330 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:15:33,330 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:15:33,330 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:15:33,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:15:33,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:15:33,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:33,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:33,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:33,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:15:33,372 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:15:33,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:15:33,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:15:33,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:33,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:33,376 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:33,376 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:15:33,382 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 [2019-01-14 02:15:33,383 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 [2019-01-14 02:15:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash 21841375, now seen corresponding path program 1 times [2019-01-14 02:15:33,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:33,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:33,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:33,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:15:33,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:15:33,552 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:15:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2019-01-14 02:15:33,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:33,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:33,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:33,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:33,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:15:33,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:15:33,738 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-14 02:15:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:33,994 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-01-14 02:15:33,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:15:33,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-01-14 02:15:34,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 02:15:34,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 31 transitions. [2019-01-14 02:15:34,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:15:34,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:15:34,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-01-14 02:15:34,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:34,009 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 02:15:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-01-14 02:15:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-14 02:15:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:15:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-14 02:15:34,042 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:15:34,042 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:15:34,042 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:15:34,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-14 02:15:34,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:15:34,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:34,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:34,046 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:34,046 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:15:34,047 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 [2019-01-14 02:15:34,047 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 [2019-01-14 02:15:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -322927901, now seen corresponding path program 1 times [2019-01-14 02:15:34,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:34,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:34,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:15:34,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:15:34,123 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:15:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 2 times [2019-01-14 02:15:34,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:34,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:34,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:34,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,259 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:15:34,387 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:15:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:15:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:15:34,401 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:15:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:34,597 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-14 02:15:34,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:15:34,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-01-14 02:15:34,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 02:15:34,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2019-01-14 02:15:34,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:15:34,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:15:34,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2019-01-14 02:15:34,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:34,602 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-14 02:15:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2019-01-14 02:15:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-14 02:15:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:15:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-14 02:15:34,607 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-14 02:15:34,607 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-14 02:15:34,607 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:15:34,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-01-14 02:15:34,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:15:34,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:34,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:34,610 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:34,610 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:15:34,610 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 [2019-01-14 02:15:34,610 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 [2019-01-14 02:15:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash 701899747, now seen corresponding path program 1 times [2019-01-14 02:15:34,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:34,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:34,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 3 times [2019-01-14 02:15:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash 284055750, now seen corresponding path program 1 times [2019-01-14 02:15:34,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:35,000 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-01-14 02:15:35,027 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:35,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:35,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:35,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:35,029 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:35,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:35,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:35,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:35,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration3_Lasso [2019-01-14 02:15:35,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:35,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:35,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:35,324 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:15:35,489 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:15:35,702 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:35,703 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:35,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:35,710 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:35,719 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:35,719 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 [2019-01-14 02:15:35,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:35,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:35,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:35,766 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 [2019-01-14 02:15:35,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:35,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:35,787 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:35,788 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 [2019-01-14 02:15:35,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:35,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:35,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:35,820 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 [2019-01-14 02:15:35,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:35,844 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 [2019-01-14 02:15:35,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:35,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:48,029 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:15:48,040 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:48,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:48,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:48,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:48,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:48,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:48,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:48,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:48,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration3_Lasso [2019-01-14 02:15:48,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:48,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:48,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:48,574 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:48,579 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:48,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:48,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:48,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:48,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:48,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:48,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:15:48,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:15:48,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:48,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:48,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:48,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:48,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:48,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:48,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:48,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:48,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:48,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:48,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:48,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:48,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:48,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:48,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:48,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:48,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:48,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:48,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:48,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:48,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:48,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:48,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:48,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:48,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:15:48,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:15:48,649 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:48,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:15:48,676 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:48,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:48,688 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:15:48,689 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:48,690 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] [2019-01-14 02:15:48,722 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:15:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:48,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:49,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:49,220 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 [2019-01-14 02:15:49,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-01-14 02:15:49,703 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. [2019-01-14 02:15:49,704 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 [2019-01-14 02:15:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:15:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2019-01-14 02:15:49,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 12 letters. Loop has 1 letters. [2019-01-14 02:15:49,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:49,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-14 02:15:49,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:49,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:15:49,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:49,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-01-14 02:15:49,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:15:49,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 13 states and 13 transitions. [2019-01-14 02:15:49,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:15:49,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:15:49,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 13 transitions. [2019-01-14 02:15:49,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:49,713 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-14 02:15:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 13 transitions. [2019-01-14 02:15:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:15:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:15:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-14 02:15:49,715 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-14 02:15:49,715 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-14 02:15:49,715 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:15:49,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 13 transitions. [2019-01-14 02:15:49,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:15:49,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:49,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:49,716 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:49,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:15:49,717 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 [2019-01-14 02:15:49,717 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 [2019-01-14 02:15:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1002986271, now seen corresponding path program 1 times [2019-01-14 02:15:49,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:49,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:49,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 4 times [2019-01-14 02:15:49,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1027803256, now seen corresponding path program 1 times [2019-01-14 02:15:49,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:49,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:49,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:49,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:49,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:49,912 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:15:50,124 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-14 02:15:50,136 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:50,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:50,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:50,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:50,137 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:50,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:50,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:50,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:50,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2019-01-14 02:15:50,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:50,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:50,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:50,340 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:15:50,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:50,448 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 [2019-01-14 02:15:50,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:50,474 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:50,474 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 [2019-01-14 02:15:50,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:50,484 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:50,484 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 [2019-01-14 02:15:50,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:50,527 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:50,527 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 [2019-01-14 02:15:50,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:50,554 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:50,554 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 [2019-01-14 02:15:50,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:50,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:50,597 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 [2019-01-14 02:15:50,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:50,606 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:50,606 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 [2019-01-14 02:15:50,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:50,629 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 [2019-01-14 02:15:50,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:50,654 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:01,238 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:01,250 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:01,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:01,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:01,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:01,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:01,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:01,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:01,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:01,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2019-01-14 02:16:01,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:01,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:01,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:01,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:01,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:01,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:01,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:01,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:01,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:01,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:01,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:01,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:01,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:01,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:01,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:01,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:01,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:01,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:01,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:01,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:01,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:01,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:01,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:01,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:01,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:01,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:01,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:01,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:01,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:01,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:01,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:01,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:01,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:01,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:01,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:01,521 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:16:01,521 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:16:01,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:01,524 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:16:01,525 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:01,525 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] [2019-01-14 02:16:01,543 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:16:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:01,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:01,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:01,759 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 [2019-01-14 02:16:01,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 13 transitions. cyclomatic complexity: 1 Second operand 10 states. [2019-01-14 02:16:01,899 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. [2019-01-14 02:16:01,900 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 [2019-01-14 02:16:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:16:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:16:01,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 12 letters. Loop has 1 letters. [2019-01-14 02:16:01,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:01,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-14 02:16:01,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:01,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:16:01,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:01,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2019-01-14 02:16:01,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:01,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-14 02:16:01,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:16:01,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:16:01,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:16:01,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:01,905 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:01,905 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:01,905 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:01,905 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:16:01,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:16:01,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:01,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:16:01,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:16:01 BoogieIcfgContainer [2019-01-14 02:16:01,912 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:16:01,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:16:01,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:16:01,913 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:16:01,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:15:33" (3/4) ... [2019-01-14 02:16:01,916 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:16:01,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:16:01,917 INFO L168 Benchmark]: Toolchain (without parser) took 29442.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:01,919 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:01,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:01,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.40 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:01,920 INFO L168 Benchmark]: Boogie Preprocessor took 27.52 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:01,921 INFO L168 Benchmark]: RCFGBuilder took 418.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:01,922 INFO L168 Benchmark]: BuchiAutomizer took 28649.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.9 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:01,923 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:01,928 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.40 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.52 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28649.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.9 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.14 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 28.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 26.6s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. 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.5s 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: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 22.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...