./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 2e94e6aa 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-2e94e6a [2019-01-01 21:33:02,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:02,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:02,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:02,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:02,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:02,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:02,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:02,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:02,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:02,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:02,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:02,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:02,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:02,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:02,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:02,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:02,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:02,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:02,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:02,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:02,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:02,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:02,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:02,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:02,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:02,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:02,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:02,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:02,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:02,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:02,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:02,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:02,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:02,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:02,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:02,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:33:02,347 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:02,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:02,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:02,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:02,349 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:02,350 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:02,350 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:02,350 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:02,351 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:02,351 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:02,351 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:02,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:02,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:02,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:02,352 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:02,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:02,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:02,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:02,355 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:02,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:02,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:02,355 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:02,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:02,358 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-01 21:33:02,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:02,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:02,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:02,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:02,414 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:02,415 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-01 21:33:02,479 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddfeb2ce/24ef5dc741394dac8ef3fabd5197884e/FLAG29a02c395 [2019-01-01 21:33:02,974 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:02,976 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2019-01-01 21:33:02,985 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddfeb2ce/24ef5dc741394dac8ef3fabd5197884e/FLAG29a02c395 [2019-01-01 21:33:03,300 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddfeb2ce/24ef5dc741394dac8ef3fabd5197884e [2019-01-01 21:33:03,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:03,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:03,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:03,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:03,311 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:03,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53427258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03, skipping insertion in model container [2019-01-01 21:33:03,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:03,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:03,535 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:03,540 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:03,564 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:03,580 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:03,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03 WrapperNode [2019-01-01 21:33:03,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:03,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:03,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:03,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:03,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:03,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:03,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:03,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:03,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (1/1) ... [2019-01-01 21:33:03,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:03,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:03,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:03,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:03,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (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-01 21:33:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:04,073 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:04,073 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:04,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:04 BoogieIcfgContainer [2019-01-01 21:33:04,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:04,075 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:04,075 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:04,079 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:04,079 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:04,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:03" (1/3) ... [2019-01-01 21:33:04,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d88609e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:04, skipping insertion in model container [2019-01-01 21:33:04,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:04,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:03" (2/3) ... [2019-01-01 21:33:04,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d88609e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:04, skipping insertion in model container [2019-01-01 21:33:04,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:04,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:04" (3/3) ... [2019-01-01 21:33:04,083 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c [2019-01-01 21:33:04,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:04,138 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:04,138 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:04,138 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:04,138 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:04,139 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:04,139 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:04,139 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:04,139 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:04,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 21:33:04,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:04,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:04,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:04,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:04,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:04,192 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:04,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 21:33:04,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:04,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:04,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:04,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:04,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:04,205 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-01 21:33:04,205 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-01 21:33:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash 21841375, now seen corresponding path program 1 times [2019-01-01 21:33:04,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:04,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:04,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:04,395 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-01 21:33:04,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:04,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:33:04,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2019-01-01 21:33:04,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:04,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:04,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:04,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:04,637 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:33:04,770 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:33:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:33:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:33:04,815 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-01 21:33:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:05,082 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-01-01 21:33:05,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:33:05,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-01-01 21:33:05,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:33:05,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 31 transitions. [2019-01-01 21:33:05,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:33:05,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 21:33:05,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-01-01 21:33:05,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:05,099 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-01 21:33:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-01-01 21:33:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 21:33:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:33:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-01 21:33:05,133 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:33:05,133 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:33:05,133 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:05,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-01 21:33:05,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:05,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:05,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:05,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:05,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:05,141 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-01 21:33:05,141 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-01 21:33:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash -322927901, now seen corresponding path program 1 times [2019-01-01 21:33:05,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:05,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:05,224 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-01 21:33:05,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:05,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:33:05,224 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 2 times [2019-01-01 21:33:05,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:05,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:33:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:33:05,355 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:33:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:05,478 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-01 21:33:05,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:33:05,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-01-01 21:33:05,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:33:05,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2019-01-01 21:33:05,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:33:05,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 21:33:05,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2019-01-01 21:33:05,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:05,484 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-01 21:33:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2019-01-01 21:33:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 21:33:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:33:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-01 21:33:05,488 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-01 21:33:05,488 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-01 21:33:05,488 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:05,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-01-01 21:33:05,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:05,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:05,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:05,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:05,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:05,492 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-01 21:33:05,492 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-01 21:33:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash 701899747, now seen corresponding path program 1 times [2019-01-01 21:33:05,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:05,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:05,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 3 times [2019-01-01 21:33:05,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:05,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:05,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:05,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash 284055750, now seen corresponding path program 1 times [2019-01-01 21:33:05,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:05,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:05,909 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-01-01 21:33:05,949 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:05,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:05,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:05,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:05,951 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:05,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:05,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:05,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:05,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration3_Lasso [2019-01-01 21:33:05,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:05,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:05,972 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-01 21:33:05,978 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-01 21:33:05,995 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-01 21:33:05,998 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-01 21:33:06,008 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-01 21:33:06,047 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-01 21:33:06,052 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-01 21:33:06,268 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:33:06,437 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:33:06,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:06,632 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-01 21:33:06,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:06,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:06,649 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:06,649 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-01 21:33:06,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:06,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:06,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:06,697 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-01 21:33:06,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:06,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:06,706 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:06,706 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-01 21:33:06,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:06,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:06,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:06,732 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-01 21:33:06,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:06,770 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) [2019-01-01 21:33:06,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:06,821 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:18,954 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:33:18,966 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:18,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:18,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:18,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:18,967 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:18,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:18,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:18,967 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:18,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration3_Lasso [2019-01-01 21:33:18,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:18,968 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:18,970 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-01 21:33:18,974 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-01 21:33:18,980 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-01 21:33:18,983 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-01 21:33:19,010 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-01 21:33:19,014 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-01 21:33:19,018 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-01 21:33:19,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:19,479 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:19,481 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-01 21:33:19,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:19,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:19,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:19,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:19,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:19,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:19,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:19,493 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-01 21:33:19,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:19,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:19,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:19,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:19,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:19,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:19,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:19,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:19,497 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-01 21:33:19,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:19,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:19,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:19,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:19,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:19,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:19,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:19,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:19,500 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-01 21:33:19,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:19,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:19,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:19,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:19,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:19,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:19,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:19,568 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:19,568 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:19,571 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:19,574 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:19,574 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:19,575 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-01 21:33:19,588 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:19,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:20,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:20,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-01 21:33:20,126 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-01 21:33:20,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-01-01 21:33:20,534 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-01 21:33:20,535 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-01 21:33:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:33:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2019-01-01 21:33:20,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 12 letters. Loop has 1 letters. [2019-01-01 21:33:20,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:20,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-01 21:33:20,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:20,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 21:33:20,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:20,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-01-01 21:33:20,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:20,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 13 states and 13 transitions. [2019-01-01 21:33:20,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:33:20,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:33:20,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 13 transitions. [2019-01-01 21:33:20,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:20,544 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-01 21:33:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 13 transitions. [2019-01-01 21:33:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:33:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:33:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-01 21:33:20,546 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-01 21:33:20,546 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-01 21:33:20,546 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:20,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 13 transitions. [2019-01-01 21:33:20,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:20,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:20,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:20,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:20,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:20,548 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-01 21:33:20,549 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-01 21:33:20,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1002986271, now seen corresponding path program 1 times [2019-01-01 21:33:20,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:20,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:20,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 4 times [2019-01-01 21:33:20,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:20,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1027803256, now seen corresponding path program 1 times [2019-01-01 21:33:20,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:20,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:20,781 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-01 21:33:20,794 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:20,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:20,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:20,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:20,795 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:20,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:20,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:20,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:20,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2019-01-01 21:33:20,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:20,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:20,798 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-01 21:33:20,810 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-01 21:33:20,813 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-01 21:33:20,819 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-01 21:33:20,821 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-01 21:33:20,825 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-01 21:33:20,828 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-01 21:33:21,015 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:33:21,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:21,130 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-01 21:33:21,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:21,159 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:21,159 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-01 21:33:21,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:21,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:21,169 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-01 21:33:21,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:21,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:21,196 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-01 21:33:21,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:21,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:21,225 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-01 21:33:21,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:21,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:21,270 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-01 21:33:21,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:21,281 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:21,282 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-01 21:33:21,308 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:21,308 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-01 21:33:21,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:21,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:32,203 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:32,214 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:32,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:32,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:32,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:32,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:32,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:32,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:32,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2019-01-01 21:33:32,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:32,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:32,220 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-01 21:33:32,231 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-01 21:33:32,238 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-01 21:33:32,245 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-01 21:33:32,248 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-01 21:33:32,250 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-01 21:33:32,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:32,388 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:32,389 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:32,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-01 21:33:32,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:32,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:32,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,401 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-01 21:33:32,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:32,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:32,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:32,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,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-01 21:33:32,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:32,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:32,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,412 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-01 21:33:32,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:32,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:32,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:32,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,416 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-01 21:33:32,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:32,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:32,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:32,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,425 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-01 21:33:32,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:32,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:32,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,436 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-01 21:33:32,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:32,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:32,464 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:32,484 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:33:32,484 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:33:32,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:32,487 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:32,487 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:32,488 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-01 21:33:32,520 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:32,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,014 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-01 21:33:33,015 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-01 21:33:33,015 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 13 transitions. cyclomatic complexity: 1 Second operand 10 states. [2019-01-01 21:33:33,363 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-01 21:33:33,364 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-01 21:33:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:33:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:33:33,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 12 letters. Loop has 1 letters. [2019-01-01 21:33:33,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-01 21:33:33,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 21:33:33,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2019-01-01 21:33:33,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:33,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-01 21:33:33,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:33,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:33,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:33,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:33,368 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:33,369 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:33,369 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:33,369 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:33,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:33,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:33,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:33,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:33 BoogieIcfgContainer [2019-01-01 21:33:33,377 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:33,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:33,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:33,378 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:33,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:04" (3/4) ... [2019-01-01 21:33:33,383 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:33,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:33,384 INFO L168 Benchmark]: Toolchain (without parser) took 30079.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:33,385 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:33,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.43 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:33,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.75 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:33,387 INFO L168 Benchmark]: Boogie Preprocessor took 41.53 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:33,388 INFO L168 Benchmark]: RCFGBuilder took 408.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:33,389 INFO L168 Benchmark]: BuchiAutomizer took 29302.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.6 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:33,391 INFO L168 Benchmark]: Witness Printer took 5.34 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-01 21:33:33,397 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.43 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.75 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.53 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 408.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29302.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.6 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.34 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 29.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 26.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.6s. 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: 23.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...