./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/Nyala-2lex_true-no-overflow_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/Nyala-2lex_true-no-overflow_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 054e86c0b11592f66f6efc3e0f84c6f8bee49b59 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:32:40,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:32:40,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:32:40,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:32:40,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:32:40,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:32:40,266 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:32:40,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:32:40,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:32:40,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:32:40,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:32:40,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:32:40,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:32:40,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:32:40,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:32:40,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:32:40,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:32:40,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:32:40,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:32:40,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:32:40,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:32:40,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:32:40,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:32:40,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:32:40,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:32:40,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:32:40,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:32:40,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:32:40,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:32:40,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:32:40,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:32:40,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:32:40,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:32:40,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:32:40,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:32:40,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:32:40,311 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:32:40,333 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:32:40,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:32:40,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:32:40,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:32:40,336 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:32:40,337 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:32:40,337 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:32:40,338 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:32:40,338 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:32:40,338 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:32:40,339 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:32:40,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:32:40,339 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:32:40,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:32:40,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:32:40,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:32:40,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:32:40,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:32:40,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:32:40,342 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:32:40,343 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:32:40,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:32:40,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:32:40,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:32:40,343 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:32:40,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:32:40,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:32:40,344 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:32:40,348 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:32:40,349 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 -> 054e86c0b11592f66f6efc3e0f84c6f8bee49b59 [2019-01-01 21:32:40,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:32:40,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:32:40,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:32:40,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:32:40,456 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:32:40,456 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:40,520 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1edf14d24/cb92936b30de4ebeba4e77211e234cb4/FLAG8c8ae810e [2019-01-01 21:32:40,952 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:32:40,953 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:40,959 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1edf14d24/cb92936b30de4ebeba4e77211e234cb4/FLAG8c8ae810e [2019-01-01 21:32:41,335 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1edf14d24/cb92936b30de4ebeba4e77211e234cb4 [2019-01-01 21:32:41,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:32:41,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:32:41,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:41,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:32:41,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:32:41,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283bee70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41, skipping insertion in model container [2019-01-01 21:32:41,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:32:41,390 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:32:41,614 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:41,621 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:32:41,645 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:41,665 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:32:41,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41 WrapperNode [2019-01-01 21:32:41,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:41,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:41,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:32:41,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:32:41,682 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:32:41" (1/1) ... [2019-01-01 21:32:41,691 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:32:41" (1/1) ... [2019-01-01 21:32:41,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:41,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:32:41,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:32:41,722 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:32:41,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (1/1) ... [2019-01-01 21:32:41,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:32:41,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:32:41,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:32:41,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:32:41,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (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:32:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:32:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:32:42,057 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:32:42,057 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:32:42,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:42 BoogieIcfgContainer [2019-01-01 21:32:42,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:32:42,060 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:32:42,060 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:32:42,064 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:32:42,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:42,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:32:41" (1/3) ... [2019-01-01 21:32:42,066 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@172fcacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:42, skipping insertion in model container [2019-01-01 21:32:42,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:42,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:41" (2/3) ... [2019-01-01 21:32:42,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@172fcacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:42, skipping insertion in model container [2019-01-01 21:32:42,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:42,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:42" (3/3) ... [2019-01-01 21:32:42,070 INFO L375 chiAutomizerObserver]: Analyzing ICFG Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:42,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:32:42,139 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:32:42,139 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:32:42,139 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:32:42,139 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:32:42,139 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:32:42,139 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:32:42,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:32:42,140 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:32:42,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:32:42,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:42,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:42,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:42,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:32:42,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:42,190 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:32:42,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:32:42,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:42,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:42,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:42,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:32:42,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:42,203 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L21-2true [2019-01-01 21:32:42,204 INFO L796 eck$LassoCheckResult]: Loop: 8#L21-2true assume !!(main_~x~0 >= 0 && main_~y~0 >= 0);main_~y~0 := main_~y~0 - 1; 4#L21true assume main_~y~0 < 0;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L21-2true [2019-01-01 21:32:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:32:42,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:42,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:42,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:32:42,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:32:42,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:42,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:42,563 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 21:32:42,647 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:42,648 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:42,649 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:42,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:42,649 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:42,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:42,649 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:42,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:42,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:42,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:42,650 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:42,676 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:32:42,685 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:32:42,699 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:32:42,726 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:32:42,992 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:42,993 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) [2019-01-01 21:32:43,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:43,011 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:43,068 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:43,069 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:32:43,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:43,079 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:43,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:43,130 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:32:43,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:43,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:43,144 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:43,144 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_~y~0=0, 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 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:32:43,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:43,166 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:32:43,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:43,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:43,246 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:43,249 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:43,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:43,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:43,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:43,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:43,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:43,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:43,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:43,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:43,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:43,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:43,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:32:43,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:43,268 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:32:43,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:43,526 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:43,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:43,539 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:32:43,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:43,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:43,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:43,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:43,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:43,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:43,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:43,571 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:32:43,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:43,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:43,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:43,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:43,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:43,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:43,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:43,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:43,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:43,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:43,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:43,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:43,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:43,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:43,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:43,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:43,624 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:32:43,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:43,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:43,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:43,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:43,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:43,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:43,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:43,645 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:43,659 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:43,660 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:43,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:43,666 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:43,669 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:43,670 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-01 21:32:43,676 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:44,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:44,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:44,133 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:32:44,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:44,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:32:44,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:32:44,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-01 21:32:44,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:32:44,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:44,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:32:44,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:44,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:32:44,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:44,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 21:32:44,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:44,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-01 21:32:44,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:32:44,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:32:44,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:32:44,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:44,408 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:32:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:32:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-01 21:32:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:32:44,448 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:32:44,448 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:32:44,448 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:32:44,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:32:44,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:44,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:44,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:44,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:44,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:44,451 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 77#L21-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0);main_~y~0 := main_~y~0 - 1; 71#L21 [2019-01-01 21:32:44,451 INFO L796 eck$LassoCheckResult]: Loop: 71#L21 assume !(main_~y~0 < 0); 72#L21-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0);main_~y~0 := main_~y~0 - 1; 71#L21 [2019-01-01 21:32:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:32:44,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:44,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-01 21:32:44,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:44,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:44,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 1 times [2019-01-01 21:32:44,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:44,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:44,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:44,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:44,626 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:44,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:44,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:44,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:44,626 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:44,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:44,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:44,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:44,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:44,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:44,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:44,629 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:32:44,668 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:32:44,683 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:32:44,689 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:32:44,763 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:44,764 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:44,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:44,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:44,811 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:44,812 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 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:32:44,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:44,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:44,880 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:44,880 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:32:44,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:44,892 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:44,946 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:44,946 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=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) [2019-01-01 21:32:44,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:44,959 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:32:45,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:45,018 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:45,069 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:45,074 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:45,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:45,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:45,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:45,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:45,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:45,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:45,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:45,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:45,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:45,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:45,085 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:32:45,125 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:32:45,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:45,205 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:32:45,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:45,390 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:45,391 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:32:45,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:45,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:45,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:45,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:45,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:45,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:45,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:45,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:32:45,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:45,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:45,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:45,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:45,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:45,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:45,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:45,411 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:32:45,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:45,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:45,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:45,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:45,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:45,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:45,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:45,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:45,415 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:32:45,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:45,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:45,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:45,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:45,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:45,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:45,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:45,421 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:45,425 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:45,425 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:45,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:45,426 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:45,426 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:45,426 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-01-01 21:32:45,427 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:45,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:45,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:45,562 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:32:45,563 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:45,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:32:45,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 14 states and 19 transitions. Complement of second has 5 states. [2019-01-01 21:32:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:45,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:32:45,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:45,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:45,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:45,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:32:45,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:45,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-01 21:32:45,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:45,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 12 transitions. [2019-01-01 21:32:45,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:32:45,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:32:45,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-01 21:32:45,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:45,618 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-01 21:32:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-01 21:32:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-01-01 21:32:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:32:45,625 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:32:45,625 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:32:45,625 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:32:45,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:32:45,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:45,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:45,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:45,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:32:45,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:45,629 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 131#L21-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0);main_~y~0 := main_~y~0 - 1; 127#L21 assume main_~y~0 < 0;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet2;havoc main_#t~nondet2; 128#L21-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0);main_~y~0 := main_~y~0 - 1; 125#L21 [2019-01-01 21:32:45,629 INFO L796 eck$LassoCheckResult]: Loop: 125#L21 assume !(main_~y~0 < 0); 126#L21-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0);main_~y~0 := main_~y~0 - 1; 125#L21 [2019-01-01 21:32:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:32:45,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:45,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:45,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:45,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:45,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:32:45,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:45,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 1 times [2019-01-01 21:32:45,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:45,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:45,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:45,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:45,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:45,715 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:45,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:45,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:45,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:45,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:45,716 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:45,716 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:45,716 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:45,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:45,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:45,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:45,719 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:32:45,732 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:32:45,735 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:32:45,740 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:32:45,823 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:45,823 INFO L412 LassoAnalysis]: Checking for nontermination... 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:32:45,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:45,828 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:32:45,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:45,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:45,882 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:45,884 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:45,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:45,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:45,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:45,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:45,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:45,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:45,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:45,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: Nyala-2lex_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:45,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:45,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:45,886 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:32:45,897 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:32:45,906 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:32:45,910 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:32:46,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:46,014 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:46,015 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:32:46,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:46,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:46,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:46,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:46,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:46,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:46,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:46,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:46,024 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:46,025 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:46,025 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:46,025 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:46,026 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:46,026 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-01-01 21:32:46,026 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:46,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:46,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:46,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:46,130 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:32:46,131 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:46,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:32:46,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-01 21:32:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:46,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:46,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:46,169 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:46,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:46,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:46,247 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:32:46,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:46,248 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:32:46,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-01 21:32:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:46,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:46,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:46,268 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:46,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:46,335 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:32:46,335 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:46,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:32:46,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 4 states. [2019-01-01 21:32:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:46,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:46,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:46,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:32:46,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:46,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:32:46,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:46,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-01 21:32:46,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:46,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2019-01-01 21:32:46,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:46,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:46,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:46,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:46,359 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:46,359 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:46,359 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:46,359 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:32:46,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:32:46,359 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:46,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:32:46,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:32:46 BoogieIcfgContainer [2019-01-01 21:32:46,368 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:32:46,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:32:46,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:32:46,369 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:32:46,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:42" (3/4) ... [2019-01-01 21:32:46,373 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:32:46,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:32:46,374 INFO L168 Benchmark]: Toolchain (without parser) took 5033.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.4 MB in the beginning and 883.2 MB in the end (delta: 68.1 MB). Peak memory consumption was 197.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:46,375 INFO L168 Benchmark]: CDTParser took 0.15 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:32:46,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:46,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.46 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:46,377 INFO L168 Benchmark]: Boogie Preprocessor took 27.35 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:46,378 INFO L168 Benchmark]: RCFGBuilder took 308.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:46,379 INFO L168 Benchmark]: BuchiAutomizer took 4308.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.2 MB in the end (delta: 221.3 MB). Peak memory consumption was 221.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:46,380 INFO L168 Benchmark]: Witness Printer took 4.68 ms. Allocated memory is still 1.2 GB. Free memory is still 883.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:46,385 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.15 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 323.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.46 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.35 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 308.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4308.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.2 MB in the end (delta: 221.3 MB). Peak memory consumption was 221.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.68 ms. Allocated memory is still 1.2 GB. Free memory is still 883.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * y + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 18 SDslu, 10 SDs, 0 SdLazy, 36 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax178 hnf97 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp100 dnf100 smp100 tf113 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...