./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0497b69437c9ebb889888bdb31aaefcc8eaad029 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:33:15,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:15,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:15,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:15,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:15,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:15,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:15,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:15,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:15,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:15,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:15,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:15,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:15,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:15,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:15,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:15,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:15,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:15,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:15,197 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:15,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:15,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:15,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:15,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:15,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:15,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:15,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:15,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:15,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:15,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:15,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:15,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:15,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:15,218 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:15,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:15,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:15,220 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:33:15,251 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:15,252 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:15,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:15,253 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:15,253 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:15,253 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:15,254 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:15,254 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:15,254 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:15,254 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:15,254 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:15,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:15,255 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:15,255 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:15,255 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:15,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:15,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:15,255 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:15,257 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:15,257 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:15,257 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:15,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:15,258 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:15,258 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:15,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:15,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:15,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:15,258 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:15,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:15,259 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:15,259 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:15,260 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:15,260 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0497b69437c9ebb889888bdb31aaefcc8eaad029 [2019-01-14 04:33:15,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:15,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:15,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:15,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:15,327 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:15,327 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:15,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02109a239/c74130b5c2284c838f7d6c2255d31934/FLAGf9affe11d [2019-01-14 04:33:15,809 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:15,810 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:15,817 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02109a239/c74130b5c2284c838f7d6c2255d31934/FLAGf9affe11d [2019-01-14 04:33:16,184 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02109a239/c74130b5c2284c838f7d6c2255d31934 [2019-01-14 04:33:16,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:16,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:16,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:16,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:16,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:16,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16, skipping insertion in model container [2019-01-14 04:33:16,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:16,224 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:16,429 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:16,434 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:16,457 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:16,473 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:16,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16 WrapperNode [2019-01-14 04:33:16,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:16,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:16,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:16,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:16,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:16,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:16,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:16,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:16,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... [2019-01-14 04:33:16,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:16,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:16,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:16,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:16,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-01-14 04:33:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-01-14 04:33:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:16,978 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:16,978 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:16,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:16 BoogieIcfgContainer [2019-01-14 04:33:16,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:16,980 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:16,981 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:16,984 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:16,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:16,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:16" (1/3) ... [2019-01-14 04:33:16,987 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a99575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:16, skipping insertion in model container [2019-01-14 04:33:16,987 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:16,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:16" (2/3) ... [2019-01-14 04:33:16,987 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a99575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:16, skipping insertion in model container [2019-01-14 04:33:16,987 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:16,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:16" (3/3) ... [2019-01-14 04:33:16,989 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:17,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:17,046 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:17,047 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:17,047 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:17,047 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:17,047 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:17,047 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:17,047 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:17,047 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:17,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-14 04:33:17,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:33:17,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:17,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:17,100 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:33:17,100 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:17,100 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:17,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-14 04:33:17,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:33:17,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:17,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:17,104 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:33:17,104 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:17,112 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 10#L30true assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 18#L34true assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 4#L37true call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 5#gcdENTRYtrue [2019-01-14 04:33:17,113 INFO L796 eck$LassoCheckResult]: Loop: 5#gcdENTRYtrue ~y1 := #in~y1;~y2 := #in~y2; 21#L16true assume !(~y1 <= 0 || ~y2 <= 0); 15#L19true assume !(~y1 == ~y2); 12#L22true assume ~y1 > ~y2; 3#L23true call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 5#gcdENTRYtrue [2019-01-14 04:33:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1513559, now seen corresponding path program 1 times [2019-01-14 04:33:17,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:17,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 28756386, now seen corresponding path program 1 times [2019-01-14 04:33:17,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash -15763700, now seen corresponding path program 1 times [2019-01-14 04:33:17,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:17,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,408 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-14 04:33:17,556 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:17,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:17,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:17,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:17,558 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:17,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:17,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:17,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:17,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:17,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:17,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-14 04:33:17,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:17,894 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:17,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:17,909 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#res=0} Honda state: {gcd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:33:17,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,952 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-01-14 04:33:17,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:18,000 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,069 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:18,070 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:18,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:18,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:18,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:18,071 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:18,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:18,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:18,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:18,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:18,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:18,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,287 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:33:18,324 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:18,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:18,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:18,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:18,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:18,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:18,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:18,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:18,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:18,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:18,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:18,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:18,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:18,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:18,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:18,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:18,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:18,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:18,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:18,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:18,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:18,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:18,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:18,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:18,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:18,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:18,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:18,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:18,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:18,368 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:18,369 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:18,371 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:18,371 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:18,371 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:18,372 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_#in~y1) = 1*gcd_#in~y1 Supporting invariants [] [2019-01-14 04:33:18,373 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:18,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:18,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:18,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 04:33:18,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2019-01-14 04:33:19,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 93 states and 129 transitions. Complement of second has 30 states. [2019-01-14 04:33:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2019-01-14 04:33:19,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 5 letters. [2019-01-14 04:33:19,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 5 letters. [2019-01-14 04:33:19,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 10 letters. [2019-01-14 04:33:19,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 129 transitions. [2019-01-14 04:33:19,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:19,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 35 states and 40 transitions. [2019-01-14 04:33:19,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:33:19,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 04:33:19,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-01-14 04:33:19,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:19,653 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-14 04:33:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-01-14 04:33:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-01-14 04:33:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:33:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-14 04:33:19,678 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 04:33:19,679 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 04:33:19,679 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:19,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-14 04:33:19,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:19,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:19,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:19,680 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:19,681 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:19,681 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 209#L30 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 214#L34 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 200#L37 call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 202#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 205#L16 [2019-01-14 04:33:19,681 INFO L796 eck$LassoCheckResult]: Loop: 205#L16 assume !(~y1 <= 0 || ~y2 <= 0); 210#L19 assume !(~y1 == ~y2); 211#L22 assume !(~y1 > ~y2); 204#L25 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 203#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 205#L16 [2019-01-14 04:33:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash 46920329, now seen corresponding path program 1 times [2019-01-14 04:33:19,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:19,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 1 times [2019-01-14 04:33:19,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash -488671755, now seen corresponding path program 1 times [2019-01-14 04:33:19,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:19,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,922 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:19,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:19,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:19,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:19,923 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:19,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:19,924 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:19,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-14 04:33:19,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:19,925 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:19,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:20,086 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-14 04:33:20,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:20,131 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:20,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:20,136 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:20,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:20,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:24,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:24,797 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:24,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:24,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:24,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:24,797 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:24,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:24,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:24,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:24,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-14 04:33:24,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:24,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:24,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:24,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:24,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:24,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:25,024 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:25,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:25,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:25,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:25,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:25,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:25,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:25,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:25,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:25,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:25,047 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:25,047 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:25,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:25,048 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:25,048 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:25,048 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-01-14 04:33:25,048 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:25,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:25,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:25,183 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-14 04:33:25,184 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 04:33:25,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 53 states and 60 transitions. Complement of second has 11 states. [2019-01-14 04:33:25,251 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-14 04:33:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 04:33:25,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 04:33:25,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:25,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:33:25,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:25,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 04:33:25,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:25,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2019-01-14 04:33:25,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:25,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 32 states and 36 transitions. [2019-01-14 04:33:25,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:33:25,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:33:25,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2019-01-14 04:33:25,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:25,259 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-14 04:33:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2019-01-14 04:33:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-14 04:33:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:33:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-14 04:33:25,263 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 04:33:25,263 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 04:33:25,263 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:25,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-01-14 04:33:25,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:25,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:25,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:25,265 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:25,265 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:25,265 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 336#L30 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 344#L34 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 331#L37 call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 332#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 333#L16 assume !(~y1 <= 0 || ~y2 <= 0); 349#L19 assume !(~y1 == ~y2); 348#L22 assume ~y1 > ~y2; 327#L23 call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 329#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 345#L16 [2019-01-14 04:33:25,265 INFO L796 eck$LassoCheckResult]: Loop: 345#L16 assume !(~y1 <= 0 || ~y2 <= 0); 337#L19 assume !(~y1 == ~y2); 339#L22 assume !(~y1 > ~y2); 338#L25 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 342#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 345#L16 [2019-01-14 04:33:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -488674700, now seen corresponding path program 2 times [2019-01-14 04:33:25,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 2 times [2019-01-14 04:33:25,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:25,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1201587990, now seen corresponding path program 1 times [2019-01-14 04:33:25,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:25,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:25,449 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:25,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:25,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:25,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:25,449 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:25,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:25,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:25,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-14 04:33:25,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:25,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:25,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:25,560 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:25,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:25,580 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:25,580 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#t~ret0=0} Honda state: {gcd_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:25,600 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:25,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:26,327 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:26,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:26,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:26,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:26,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:26,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:26,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:26,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:26,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:26,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-14 04:33:26,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:26,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:26,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:26,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:26,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:26,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:26,513 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:26,514 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:26,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:26,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:26,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:26,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:26,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:26,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:26,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:26,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:26,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:26,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:26,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:26,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:26,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:26,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:26,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:26,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:26,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:26,527 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:26,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:26,533 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:26,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:26,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:26,533 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:26,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-01-14 04:33:26,534 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:26,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:26,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:26,728 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-14 04:33:26,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:33:26,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 50 transitions. Complement of second has 11 states. [2019-01-14 04:33:26,839 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-14 04:33:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 04:33:26,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:33:26,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:26,840 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:26,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:26,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:26,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:33:26,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:33:26,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 50 transitions. Complement of second has 11 states. [2019-01-14 04:33:26,967 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-14 04:33:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 04:33:26,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:33:26,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:26,969 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:27,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:27,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:27,059 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 3 loop predicates [2019-01-14 04:33:27,060 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:33:27,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 74 states and 85 transitions. Complement of second has 12 states. [2019-01-14 04:33:27,101 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-14 04:33:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:33:27,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:33:27,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:27,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2019-01-14 04:33:27,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:27,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2019-01-14 04:33:27,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:27,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 85 transitions. [2019-01-14 04:33:27,110 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:33:27,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2019-01-14 04:33:27,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:33:27,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:33:27,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:33:27,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:27,111 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:27,112 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:27,112 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:27,112 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:27,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:33:27,112 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:33:27,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:33:27,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:33:27 BoogieIcfgContainer [2019-01-14 04:33:27,122 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:33:27,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:33:27,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:33:27,123 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:33:27,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:16" (3/4) ... [2019-01-14 04:33:27,129 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:33:27,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:33:27,130 INFO L168 Benchmark]: Toolchain (without parser) took 10942.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.0 MB in the beginning and 793.0 MB in the end (delta: 149.0 MB). Peak memory consumption was 263.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:27,132 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:27,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.91 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:27,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.66 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:27,134 INFO L168 Benchmark]: Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:27,135 INFO L168 Benchmark]: RCFGBuilder took 452.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:27,136 INFO L168 Benchmark]: BuchiAutomizer took 10141.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 793.0 MB in the end (delta: 297.5 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:27,138 INFO L168 Benchmark]: Witness Printer took 6.68 ms. Allocated memory is still 1.1 GB. Free memory is still 793.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:27,143 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.91 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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 36.66 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 452.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10141.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 793.0 MB in the end (delta: 297.5 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.68 ms. Allocated memory is still 1.1 GB. Free memory is still 793.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(y1) and consists of 7 locations. One deterministic module has affine ranking function y2 and consists of 4 locations. One nondeterministic module has affine ranking function y2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 7.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 78 SDslu, 8 SDs, 0 SdLazy, 115 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq177 hnf91 smp89 dnf100 smp100 tf106 neg98 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...