./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/GCD4_true-termination_true-no-overflow.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-restricted-15/GCD4_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e1a6e72adfb4c8fee6c8faa90b8bdc807e2f6147 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:40,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:36:40,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:36:40,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:36:40,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:36:40,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:36:40,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:36:40,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:36:40,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:36:40,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:36:40,433 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:36:40,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:36:40,434 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:36:40,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:36:40,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:36:40,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:36:40,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:36:40,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:36:40,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:36:40,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:36:40,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:36:40,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:36:40,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:36:40,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:36:40,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:36:40,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:36:40,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:36:40,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:36:40,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:36:40,474 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:36:40,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:36:40,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:36:40,477 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:36:40,477 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:36:40,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:36:40,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:36:40,480 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:36:40,504 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:36:40,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:36:40,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:36:40,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:36:40,507 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:36:40,507 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:36:40,507 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:36:40,507 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:36:40,512 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:36:40,512 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:36:40,512 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:36:40,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:36:40,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:36:40,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:36:40,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:36:40,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:36:40,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:36:40,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:36:40,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:36:40,514 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:36:40,514 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:36:40,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:36:40,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:36:40,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:36:40,515 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:36:40,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:36:40,516 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:36:40,518 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:36:40,521 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:36:40,522 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 -> e1a6e72adfb4c8fee6c8faa90b8bdc807e2f6147 [2019-01-01 21:36:40,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:36:40,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:36:40,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:36:40,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:36:40,605 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:36:40,606 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/GCD4_true-termination_true-no-overflow.c [2019-01-01 21:36:40,664 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f086d299d/6524563720464ac6b3117a2fceaba051/FLAGd83d26e46 [2019-01-01 21:36:41,072 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:36:41,072 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/GCD4_true-termination_true-no-overflow.c [2019-01-01 21:36:41,078 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f086d299d/6524563720464ac6b3117a2fceaba051/FLAGd83d26e46 [2019-01-01 21:36:41,463 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f086d299d/6524563720464ac6b3117a2fceaba051 [2019-01-01 21:36:41,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:36:41,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:36:41,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:41,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:36:41,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:36:41,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3026fc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41, skipping insertion in model container [2019-01-01 21:36:41,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:36:41,503 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:36:41,727 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:41,731 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:36:41,749 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:41,762 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:36:41,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41 WrapperNode [2019-01-01 21:36:41,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:41,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:41,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:36:41,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:36:41,773 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:36:41" (1/1) ... [2019-01-01 21:36:41,778 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:36:41" (1/1) ... [2019-01-01 21:36:41,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:41,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:36:41,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:36:41,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:36:41,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (1/1) ... [2019-01-01 21:36:41,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:36:41,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:36:41,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:36:41,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:36:41,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36: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:36:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:36:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:36:42,111 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:36:42,111 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:36:42,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:42 BoogieIcfgContainer [2019-01-01 21:36:42,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:36:42,112 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:36:42,113 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:36:42,116 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:36:42,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:42,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:36:41" (1/3) ... [2019-01-01 21:36:42,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3c5086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:42, skipping insertion in model container [2019-01-01 21:36:42,118 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:42,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:41" (2/3) ... [2019-01-01 21:36:42,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3c5086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:42, skipping insertion in model container [2019-01-01 21:36:42,118 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:42,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:42" (3/3) ... [2019-01-01 21:36:42,120 INFO L375 chiAutomizerObserver]: Analyzing ICFG GCD4_true-termination_true-no-overflow.c [2019-01-01 21:36:42,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:36:42,176 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:36:42,176 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:36:42,176 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:36:42,177 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:36:42,177 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:36:42,177 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:36:42,177 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:36:42,177 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:36:42,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:36:42,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:36:42,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:42,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:42,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:42,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:42,223 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:36:42,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:36:42,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:36:42,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:42,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:42,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:42,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:42,233 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L13-2true [2019-01-01 21:36:42,233 INFO L796 eck$LassoCheckResult]: Loop: 6#L13-2true assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 3#L17-2true assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 9#L17-3true main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 6#L13-2true [2019-01-01 21:36:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:36:42,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:42,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-01 21:36:42,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:42,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-01 21:36:42,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:42,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:42,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:42,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:42,649 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 21:36:42,685 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:42,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:42,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:42,687 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:42,687 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:42,687 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:42,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:42,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:42,687 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:36:42,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:42,688 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:42,710 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:36:42,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:42,806 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:36:42,930 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:36:43,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:43,184 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:43,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:43,191 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:43,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:43,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:44,193 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:44,196 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:44,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:44,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:44,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:44,197 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:44,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:44,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:44,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:44,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:36:44,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:44,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:44,200 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:36:44,206 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:36:44,225 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:36:44,414 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:44,420 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:44,422 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:36:44,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:44,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:44,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:44,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:44,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:44,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:44,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:44,438 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:36:44,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:44,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:44,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:44,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:44,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:44,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:44,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:44,464 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:44,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:44,479 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:44,483 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:44,485 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:44,485 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:44,487 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:36:44,488 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:44,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:44,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:44,972 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:36:44,988 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:36:44,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-01 21:36:45,189 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:36:45,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 33 states and 49 transitions. Complement of second has 10 states. [2019-01-01 21:36:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-01 21:36:45,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:36:45,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:45,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:36:45,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:45,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:36:45,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:45,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 49 transitions. [2019-01-01 21:36:45,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:36:45,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 11 states and 16 transitions. [2019-01-01 21:36:45,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:36:45,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:36:45,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:36:45,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:45,366 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:36:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:36:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:36:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:36:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-01-01 21:36:45,405 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-01 21:36:45,406 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-01 21:36:45,406 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:36:45,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-01-01 21:36:45,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:36:45,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:45,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:45,409 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:36:45,409 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:36:45,410 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 91#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 86#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 87#L17-2 [2019-01-01 21:36:45,410 INFO L796 eck$LassoCheckResult]: Loop: 87#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 87#L17-2 [2019-01-01 21:36:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-01 21:36:45,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:45,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:45,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:45,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 21:36:45,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:45,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:45,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2019-01-01 21:36:45,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:45,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:45,563 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:45,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:45,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:45,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:45,564 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:45,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:45,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:45,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:45,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:36:45,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:45,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:45,567 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:36:45,571 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:36:45,577 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:36:45,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:45,694 INFO L412 LassoAnalysis]: Checking for nontermination... 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:36:45,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:45,699 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:45,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:45,721 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 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:36:45,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:45,726 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:45,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:45,746 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 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:36:45,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:45,752 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:36:45,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:45,811 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,000 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:46,002 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:46,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:46,002 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:46,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:46,002 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:46,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:46,003 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:46,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:36:46,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:46,003 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:46,004 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:36:46,020 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:36:46,024 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:36:46,159 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:46,160 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:46,161 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:36:46,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:46,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:46,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:46,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:46,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:46,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:46,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:46,172 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:36:46,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:46,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:46,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:46,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:46,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:46,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:46,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:46,187 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:36:46,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:46,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:46,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:46,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:46,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:46,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:46,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:46,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:46,216 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:36:46,217 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:36:46,219 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:46,219 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:46,219 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:46,219 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-01 21:36:46,222 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:46,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:46,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:46,279 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:36:46,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:36:46,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 8 Second operand 2 states. [2019-01-01 21:36:46,313 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 8. Second operand 2 states. Result 15 states and 22 transitions. Complement of second has 5 states. [2019-01-01 21:36:46,314 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:36:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:36:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:36:46,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:36:46,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:46,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 21:36:46,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:46,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:36:46,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:46,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-01-01 21:36:46,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:36:46,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-01 21:36:46,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:36:46,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:36:46,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-01 21:36:46,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:46,320 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:36:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-01 21:36:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-01 21:36:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:36:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2019-01-01 21:36:46,322 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-01-01 21:36:46,322 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-01-01 21:36:46,322 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:36:46,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2019-01-01 21:36:46,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:36:46,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:46,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:46,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:36:46,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:46,327 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 147#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 150#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 153#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 144#L17-3 [2019-01-01 21:36:46,327 INFO L796 eck$LassoCheckResult]: Loop: 144#L17-3 main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 148#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 143#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 144#L17-3 [2019-01-01 21:36:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 963528, now seen corresponding path program 1 times [2019-01-01 21:36:46,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:46,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash 52221, now seen corresponding path program 2 times [2019-01-01 21:36:46,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:46,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:46,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285994, now seen corresponding path program 1 times [2019-01-01 21:36:46,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:46,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:46,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:46,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:36:46,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:36:46,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:36:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:46,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:36:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:36:46,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-01 21:36:46,760 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:46,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:46,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:46,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:46,761 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:46,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:46,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:46,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:46,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:46,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:46,764 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:36:46,785 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:36:46,794 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:36:46,908 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:46,908 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:46,916 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:46,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:51,694 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:51,696 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:51,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:51,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:51,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:51,697 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:51,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:51,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:51,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:51,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:51,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:51,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:51,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:36:51,709 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:36:51,723 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:36:51,850 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:36:52,208 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:36:52,214 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:52,215 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:52,215 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:36:52,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:52,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:52,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:52,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:52,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:52,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:52,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:52,227 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:36:52,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:52,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:52,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:52,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:52,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:52,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:52,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:52,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:52,247 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:52,248 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:52,248 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:52,248 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:52,248 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:52,249 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-01 21:36:52,250 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:52,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:52,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:52,421 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:36:52,422 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:36:52,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 17 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:36:52,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 17 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 33 states and 52 transitions. Complement of second has 10 states. [2019-01-01 21:36:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-01-01 21:36:52,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:36:52,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:52,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:36:52,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:52,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:36:52,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:52,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 52 transitions. [2019-01-01 21:36:52,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:36:52,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 35 transitions. [2019-01-01 21:36:52,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:36:52,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:36:52,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-01-01 21:36:52,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:52,505 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-01-01 21:36:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-01-01 21:36:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-01 21:36:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:36:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2019-01-01 21:36:52,510 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-01 21:36:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:36:52,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:36:52,514 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 9 states. [2019-01-01 21:36:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:52,669 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-01 21:36:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:36:52,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:36:52,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:36:52,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 26 transitions. [2019-01-01 21:36:52,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:36:52,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:36:52,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-01-01 21:36:52,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:52,678 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 21:36:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-01-01 21:36:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2019-01-01 21:36:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:36:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 21:36:52,683 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:36:52,683 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:36:52,683 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:36:52,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 21:36:52,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:36:52,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:52,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:52,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:36:52,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:36:52,685 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 323#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 326#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 325#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 321#L17-3 [2019-01-01 21:36:52,686 INFO L796 eck$LassoCheckResult]: Loop: 321#L17-3 main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 324#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 318#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 319#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 321#L17-3 [2019-01-01 21:36:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 963528, now seen corresponding path program 2 times [2019-01-01 21:36:52,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:52,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:52,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1618930, now seen corresponding path program 1 times [2019-01-01 21:36:52,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:52,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:52,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 780807225, now seen corresponding path program 2 times [2019-01-01 21:36:52,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:52,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:52,849 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:52,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:52,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:52,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:52,849 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:52,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:52,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:52,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:52,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:36:52,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:52,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:52,851 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:36:52,856 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:36:52,861 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:36:52,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:52,981 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:52,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:52,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:53,016 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:53,016 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:53,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:53,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:53,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:53,044 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:53,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:53,051 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:53,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:53,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:02,658 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:02,661 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:02,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:02,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:02,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:02,662 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:02,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:02,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:02,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:02,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:37:02,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:02,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:02,664 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:37:02,696 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:37:02,700 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:37:02,783 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:02,784 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:02,784 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:37:02,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:02,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:02,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:02,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:02,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:02,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:02,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:02,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:02,801 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:02,801 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:02,801 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:02,802 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:02,802 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:02,802 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-01 21:37:02,802 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:37:02,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:02,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:37:02,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2019-01-01 21:37:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:37:02,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:37:02,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:37:02,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 21:37:02,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-01-01 21:37:02,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:37:02,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 27 transitions. [2019-01-01 21:37:02,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:37:02,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:37:02,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-01-01 21:37:02,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:02,918 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-01 21:37:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-01-01 21:37:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-01 21:37:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:37:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-01 21:37:02,921 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:37:02,921 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:37:02,921 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:37:02,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-01 21:37:02,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:37:02,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:02,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:02,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-01 21:37:02,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:37:02,924 INFO L794 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 406#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 415#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 412#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 411#L17-3 main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 407#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 402#L17-2 [2019-01-01 21:37:02,925 INFO L796 eck$LassoCheckResult]: Loop: 402#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 402#L17-2 [2019-01-01 21:37:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 3 times [2019-01-01 21:37:02,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-01 21:37:02,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 4 times [2019-01-01 21:37:02,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,981 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:02,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:02,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:02,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:02,981 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:02,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:02,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:02,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:02,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:37:02,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:02,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:02,984 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:37:02,992 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:37:02,996 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:37:03,060 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,060 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,068 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:03,088 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:03,111 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,117 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:03,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,246 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:03,249 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:03,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:03,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:03,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:03,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:03,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:03,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:03,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:37:03,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:03,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:03,251 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:37:03,255 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:37:03,263 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:37:03,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,353 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:03,354 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:37:03,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,362 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:37:03,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,371 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:37:03,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:03,381 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:37:03,382 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:37:03,382 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:03,382 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:03,383 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:03,383 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-01 21:37:03,383 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,462 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:37:03,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:03,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2019-01-01 21:37:03,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9. Second operand 2 states. Result 20 states and 28 transitions. Complement of second has 5 states. [2019-01-01 21:37:03,483 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:37:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:37:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:03,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-01 21:37:03,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,484 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,553 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:37:03,554 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:03,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2019-01-01 21:37:03,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9. Second operand 2 states. Result 20 states and 28 transitions. Complement of second has 5 states. [2019-01-01 21:37:03,565 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:37:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:37:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:03,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-01 21:37:03,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,591 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:37:03,591 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:03,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2019-01-01 21:37:03,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9. Second operand 2 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2019-01-01 21:37:03,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:37:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:37:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:37:03,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-01 21:37:03,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-01 21:37:03,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:37:03,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-01-01 21:37:03,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:03,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-01 21:37:03,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:03,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:03,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:03,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:03,619 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:03,619 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:03,619 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:03,619 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:37:03,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:03,619 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:03,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:03,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:03 BoogieIcfgContainer [2019-01-01 21:37:03,627 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:03,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:03,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:03,627 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:03,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:42" (3/4) ... [2019-01-01 21:37:03,632 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:03,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:03,634 INFO L168 Benchmark]: Toolchain (without parser) took 22166.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:03,635 INFO L168 Benchmark]: CDTParser took 0.14 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:37:03,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.15 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:37:03,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.03 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:37:03,637 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 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:37:03,637 INFO L168 Benchmark]: RCFGBuilder took 295.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:03,638 INFO L168 Benchmark]: BuchiAutomizer took 21514.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 88.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:03,639 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:03,646 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.14 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 294.15 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 31.03 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 20.90 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 295.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21514.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 88.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y and consists of 6 locations. One deterministic module has affine ranking function xtmp and consists of 3 locations. One deterministic module has affine ranking function xtmp and consists of 6 locations. One deterministic module has affine ranking function xtmp and consists of 4 locations. One nondeterministic module has affine ranking function xtmp and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 19.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 33 SDtfs, 45 SDslu, 9 SDs, 0 SdLazy, 102 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax165 hnf95 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf108 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 15.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...