./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-0ed9222-m [2019-01-14 02:19:06,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:06,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:06,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:06,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:06,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:06,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:06,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:06,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:06,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:06,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:06,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:06,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:06,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:06,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:06,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:06,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:06,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:06,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:06,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:06,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:06,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:06,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:06,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:06,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:06,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:06,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:06,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:06,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:06,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:06,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:06,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:06,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:06,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:06,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:06,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:06,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:19:06,965 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:06,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:06,967 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:06,968 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:06,971 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:06,971 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:06,971 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:06,971 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:06,972 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:06,972 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:06,972 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:06,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:06,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:06,973 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:06,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:06,974 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:06,974 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:06,974 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:06,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:06,974 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:06,974 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:06,976 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:06,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:06,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:06,976 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:06,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:06,977 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:06,977 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:06,978 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:06,979 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-14 02:19:07,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:07,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:07,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:07,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:07,068 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:07,069 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-14 02:19:07,125 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad5047da/8257b03abc274a2f92634b7e4e75e454/FLAGf96a29640 [2019-01-14 02:19:07,549 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:07,549 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/GCD4_true-termination_true-no-overflow.c [2019-01-14 02:19:07,558 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad5047da/8257b03abc274a2f92634b7e4e75e454/FLAGf96a29640 [2019-01-14 02:19:07,902 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad5047da/8257b03abc274a2f92634b7e4e75e454 [2019-01-14 02:19:07,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:07,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:07,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:07,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:07,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:07,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:07" (1/1) ... [2019-01-14 02:19:07,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7a5c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:07, skipping insertion in model container [2019-01-14 02:19:07,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:07" (1/1) ... [2019-01-14 02:19:07,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:07,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:08,170 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:08,175 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:08,192 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:08,208 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:08,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08 WrapperNode [2019-01-14 02:19:08,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:08,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:08,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:08,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:08,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:08,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:08,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:08,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:08,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... [2019-01-14 02:19:08,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:08,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:08,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:08,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:08,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:08,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:08,676 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:08,676 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:19:08,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:08 BoogieIcfgContainer [2019-01-14 02:19:08,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:08,678 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:08,678 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:08,683 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:08,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:08,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:07" (1/3) ... [2019-01-14 02:19:08,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1af35438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:08, skipping insertion in model container [2019-01-14 02:19:08,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:08,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:08" (2/3) ... [2019-01-14 02:19:08,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1af35438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:08, skipping insertion in model container [2019-01-14 02:19:08,687 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:08,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:08" (3/3) ... [2019-01-14 02:19:08,689 INFO L375 chiAutomizerObserver]: Analyzing ICFG GCD4_true-termination_true-no-overflow.c [2019-01-14 02:19:08,836 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:08,837 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:08,840 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:08,840 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:08,840 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:08,840 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:08,840 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:08,841 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:08,841 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:08,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:19:08,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:08,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:08,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:08,950 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:08,952 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:08,952 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:08,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:19:08,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:08,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:08,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:08,954 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:08,954 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:08,965 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-14 02:19:08,965 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-14 02:19:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:08,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:09,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:19:09,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:09,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:09,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:09,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:19:09,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:09,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:09,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:09,310 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-14 02:19:09,347 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:09,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:09,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:09,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:09,349 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:09,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:09,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:09,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:09,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:09,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:09,351 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:09,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:09,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:09,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 02:19:09,674 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:19:09,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:09,815 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:09,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:09,822 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-14 02:19:09,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:09,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:10,842 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:10,844 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:10,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:10,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:10,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:10,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:10,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:10,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:10,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:10,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:10,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:10,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:10,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:10,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:10,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,040 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:19:11,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:11,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:11,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:11,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:11,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:11,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:11,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:11,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:11,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:11,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:11,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:11,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:11,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:11,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:11,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:11,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:11,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:11,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:11,142 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:11,154 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:11,154 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:11,157 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:11,157 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:11,158 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:11,158 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-14 02:19:11,160 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:11,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:11,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:11,441 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 02:19:11,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-14 02:19:11,658 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 02:19:11,822 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-14 02:19:11,823 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-14 02:19:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-14 02:19:11,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:19:11,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:11,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:19:11,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:11,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:19:11,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:11,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 49 transitions. [2019-01-14 02:19:11,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:19:11,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 11 states and 16 transitions. [2019-01-14 02:19:11,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:19:11,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:19:11,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:19:11,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:11,845 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:19:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:19:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:19:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:19:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-01-14 02:19:11,873 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 02:19:11,873 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 02:19:11,874 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:11,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-01-14 02:19:11,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:19:11,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:11,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:11,875 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:19:11,875 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:11,876 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-14 02:19:11,876 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-14 02:19:11,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:19:11,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:11,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:19:11,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:11,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2019-01-14 02:19:11,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:11,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,964 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:11,964 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:11,964 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:11,964 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:11,965 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:11,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:11,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:11,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:11,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:11,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:11,966 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:11,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 02:19:11,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,075 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:12,075 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-14 02:19:12,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:12,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:12,109 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:12,109 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-14 02:19:12,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:12,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:12,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:12,153 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-14 02:19:12,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:12,168 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:12,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:12,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:12,415 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:12,416 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:12,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:12,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:12,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:12,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:12,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:12,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:12,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:12,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:12,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:12,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:12,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:12,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:12,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:12,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:12,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:12,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:12,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:12,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:12,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:12,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:12,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:12,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:12,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:12,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:12,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:12,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:12,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:12,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:12,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:12,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:12,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:12,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:12,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:12,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:12,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:12,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:12,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:12,606 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:19:12,606 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:19:12,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:12,607 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:12,607 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:12,607 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-14 02:19:12,609 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:12,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:12,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:12,685 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-14 02:19:12,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 8 Second operand 2 states. [2019-01-14 02:19:12,736 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-14 02:19:12,737 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-14 02:19:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:19:12,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:19:12,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 02:19:12,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:19:12,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:12,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-01-14 02:19:12,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:12,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-14 02:19:12,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:19:12,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:19:12,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-14 02:19:12,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:12,743 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 02:19:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-14 02:19:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-14 02:19:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:19:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2019-01-14 02:19:12,745 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-01-14 02:19:12,745 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-01-14 02:19:12,745 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:12,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2019-01-14 02:19:12,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:12,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:12,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:12,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:19:12,748 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:12,749 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-14 02:19:12,749 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-14 02:19:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash 963528, now seen corresponding path program 1 times [2019-01-14 02:19:12,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:12,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:12,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:12,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 52221, now seen corresponding path program 2 times [2019-01-14 02:19:12,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285994, now seen corresponding path program 1 times [2019-01-14 02:19:12,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:12,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:12,900 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-14 02:19:12,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:12,902 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-14 02:19:12,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:12,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:13,080 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-14 02:19:13,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:13,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-14 02:19:13,175 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:13,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:13,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:13,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:13,176 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:13,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:13,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:13,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:13,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:13,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:13,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:13,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:13,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:13,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:13,335 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:13,336 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-14 02:19:13,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:13,346 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-14 02:19:13,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:13,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:17,857 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:17,859 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:17,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:17,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:17,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:17,860 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:17,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:17,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:17,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:17,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:17,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:17,861 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:17,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:17,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:17,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:18,322 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:19:18,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:18,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19: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 02:19:18,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:18,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:18,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:18,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:18,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:18,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:18,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:18,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:18,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:18,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:18,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:18,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:18,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:18,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:18,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:18,347 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:18,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:18,352 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:18,353 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:18,353 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:18,353 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:18,353 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-14 02:19:18,354 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:18,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:18,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:18,473 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 02:19:18,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 17 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 02:19:18,549 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-14 02:19:18,551 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-14 02:19:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-01-14 02:19:18,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:19:18,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:18,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:19:18,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:18,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:19:18,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:18,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 52 transitions. [2019-01-14 02:19:18,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:19:18,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 35 transitions. [2019-01-14 02:19:18,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:19:18,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:19:18,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-01-14 02:19:18,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:18,565 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-01-14 02:19:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-01-14 02:19:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-14 02:19:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:19:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2019-01-14 02:19:18,568 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-14 02:19:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:19:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:19:18,573 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 9 states. [2019-01-14 02:19:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:18,778 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-14 02:19:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:19:18,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:19:18,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:19:18,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 26 transitions. [2019-01-14 02:19:18,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:19:18,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:19:18,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-01-14 02:19:18,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:18,784 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 02:19:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-01-14 02:19:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2019-01-14 02:19:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:19:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:19:18,787 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:19:18,788 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:19:18,788 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:18,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:19:18,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:18,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:18,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:18,789 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:19:18,789 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:19:18,789 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-14 02:19:18,789 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-14 02:19:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:18,792 INFO L82 PathProgramCache]: Analyzing trace with hash 963528, now seen corresponding path program 2 times [2019-01-14 02:19:18,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:18,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:18,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1618930, now seen corresponding path program 1 times [2019-01-14 02:19:18,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:18,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:18,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:18,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:18,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 780807225, now seen corresponding path program 2 times [2019-01-14 02:19:18,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:18,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:18,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:18,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:18,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,943 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:18,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:18,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:18,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:18,943 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:18,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:18,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:18,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:18,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:18,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:18,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:18,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:19,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:19,058 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-14 02:19:19,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:19,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:19,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:19,082 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-14 02:19:19,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:19,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:19,110 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:19,110 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-14 02:19:19,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:19,116 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-14 02:19:19,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:19,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:28,283 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:28,286 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:28,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:28,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:28,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:28,286 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:28,286 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:28,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:28,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:28,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:28,287 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:28,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:28,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:28,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:28,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:28,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:28,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:28,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:28,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:28,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:28,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:28,479 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:28,491 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:28,492 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:28,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:28,492 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:28,493 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:28,493 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-14 02:19:28,493 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:28,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:28,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:28,550 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-14 02:19:28,551 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 02:19:28,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:19:28,594 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-14 02:19:28,599 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 02:19:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-14 02:19:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:19:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:19:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 02:19:28,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:28,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-01-14 02:19:28,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:28,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 27 transitions. [2019-01-14 02:19:28,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:19:28,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:19:28,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-01-14 02:19:28,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:28,606 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-14 02:19:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-01-14 02:19:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-14 02:19:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:19:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-14 02:19:28,608 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:19:28,609 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:19:28,609 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:19:28,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-14 02:19:28,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:28,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:28,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:28,613 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-14 02:19:28,613 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:28,613 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-14 02:19:28,613 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-14 02:19:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 3 times [2019-01-14 02:19:28,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:28,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:19:28,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:28,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 4 times [2019-01-14 02:19:28,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:28,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,671 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:28,671 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:28,671 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:28,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:28,671 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:28,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:28,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:28,671 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:28,671 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:28,672 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:28,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,746 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:28,746 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-14 02:19:28,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:28,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:28,771 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:28,771 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-14 02:19:28,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:28,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:28,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:28,795 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-14 02:19:28,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:28,799 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-14 02:19:28,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:28,823 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:28,929 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:28,931 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:28,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:28,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:28,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:28,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:28,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:28,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:28,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD4_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:28,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:28,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:28,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:29,019 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:29,020 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:29,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:29,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:29,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:29,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:29,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:29,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:29,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:29,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:29,051 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:19:29,051 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:19:29,051 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:29,051 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:29,052 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:29,052 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-14 02:19:29,052 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:29,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:29,171 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-14 02:19:29,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2019-01-14 02:19:29,191 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-14 02:19:29,192 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-14 02:19:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:29,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:29,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,193 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:29,224 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-14 02:19:29,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2019-01-14 02:19:29,233 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-14 02:19:29,234 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-14 02:19:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:29,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:29,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,235 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:29,272 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-14 02:19:29,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2019-01-14 02:19:29,297 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-14 02:19:29,299 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-14 02:19:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:19:29,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:29,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:19:29,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:19:29,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-01-14 02:19:29,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:29,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:19:29,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:29,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:29,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:29,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:29,305 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:29,305 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:29,306 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:29,306 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:19:29,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:29,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:29,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:29,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:29 BoogieIcfgContainer [2019-01-14 02:19:29,317 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:29,317 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:29,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:29,317 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:29,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:08" (3/4) ... [2019-01-14 02:19:29,324 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:29,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:29,325 INFO L168 Benchmark]: Toolchain (without parser) took 21417.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:29,327 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:29,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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-14 02:19:29,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.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-14 02:19:29,329 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 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-14 02:19:29,329 INFO L168 Benchmark]: RCFGBuilder took 409.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:29,330 INFO L168 Benchmark]: BuchiAutomizer took 20638.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:29,333 INFO L168 Benchmark]: Witness Printer took 7.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:29,338 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.16 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 299.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 36.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 22.28 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 409.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20638.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 20.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.7s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. 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.4s 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: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 15.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...