./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/GCD3_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 aae625cda61f26fa063b78c3d3a58aff5ded8a89 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:36:36,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:36:36,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:36:36,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:36:36,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:36:36,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:36:36,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:36:36,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:36:36,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:36:36,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:36:36,484 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:36:36,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:36:36,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:36:36,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:36:36,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:36:36,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:36:36,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:36:36,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:36:36,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:36:36,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:36:36,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:36:36,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:36:36,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:36:36,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:36:36,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:36:36,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:36:36,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:36:36,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:36:36,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:36:36,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:36:36,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:36:36,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:36:36,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:36:36,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:36:36,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:36:36,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:36:36,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:36:36,559 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:36:36,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:36:36,560 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:36:36,560 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:36:36,560 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:36:36,561 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:36:36,561 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:36:36,562 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:36:36,562 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:36:36,562 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:36:36,562 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:36:36,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:36:36,563 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:36:36,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:36:36,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:36:36,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:36:36,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:36:36,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:36:36,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:36:36,565 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:36:36,565 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:36:36,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:36:36,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:36:36,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:36:36,566 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:36:36,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:36:36,566 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:36:36,567 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:36:36,568 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:36:36,568 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 -> aae625cda61f26fa063b78c3d3a58aff5ded8a89 [2019-01-01 21:36:36,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:36:36,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:36:36,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:36:36,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:36:36,626 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:36:36,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c [2019-01-01 21:36:36,684 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c917fdb15/136b117641894421a0cfb2d218be5663/FLAG9c887a8f0 [2019-01-01 21:36:37,184 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:36:37,185 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c [2019-01-01 21:36:37,193 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c917fdb15/136b117641894421a0cfb2d218be5663/FLAG9c887a8f0 [2019-01-01 21:36:37,494 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c917fdb15/136b117641894421a0cfb2d218be5663 [2019-01-01 21:36:37,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:36:37,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:36:37,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:37,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:36:37,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:36:37,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37, skipping insertion in model container [2019-01-01 21:36:37,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:36:37,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:36:37,783 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:37,788 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:36:37,816 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:37,835 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:36:37,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37 WrapperNode [2019-01-01 21:36:37,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:37,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:37,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:36:37,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:36:37,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:37,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:36:37,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:36:37,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:36:37,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... [2019-01-01 21:36:37,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:36:37,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:36:37,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:36:37,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:36:37,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:36:38,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:36:38,348 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:36:38,348 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:36:38,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:38 BoogieIcfgContainer [2019-01-01 21:36:38,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:36:38,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:36:38,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:36:38,356 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:36:38,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:38,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:36:37" (1/3) ... [2019-01-01 21:36:38,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d38b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:38, skipping insertion in model container [2019-01-01 21:36:38,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:38,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:37" (2/3) ... [2019-01-01 21:36:38,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d38b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:38, skipping insertion in model container [2019-01-01 21:36:38,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:38,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:38" (3/3) ... [2019-01-01 21:36:38,363 INFO L375 chiAutomizerObserver]: Analyzing ICFG GCD3_true-termination_true-no-overflow.c [2019-01-01 21:36:38,447 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:36:38,448 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:36:38,448 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:36:38,448 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:36:38,448 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:36:38,449 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:36:38,449 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:36:38,449 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:36:38,450 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:36:38,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:36:38,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:36:38,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:38,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:38,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:38,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:36:38,499 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:36:38,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:36:38,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:36:38,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:38,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:38,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:38,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:36:38,511 INFO L794 eck$LassoCheckResult]: Stem: 10#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; 11#L13-2true [2019-01-01 21:36:38,512 INFO L796 eck$LassoCheckResult]: Loop: 11#L13-2true assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 3#L17true assume 0 == main_~y~0;main_~y~0 := main_~y~0; 7#L21-2true assume !(main_~xtmp~0 > 0); 5#L31-2true assume !true; 4#L31-3true main_~y~0 := main_~xtmp~0; 15#L25-1true main_~x~0 := main_~tmp~0; 11#L13-2true [2019-01-01 21:36:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:36:38,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1187012529, now seen corresponding path program 1 times [2019-01-01 21:36:38,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:38,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:36:38,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:36:38,718 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:36:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:36:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:36:38,740 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-01-01 21:36:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:38,800 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-01 21:36:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:36:38,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-01 21:36:38,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:36:38,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-01 21:36:38,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:36:38,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:36:38,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:36:38,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:38,812 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:36:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:36:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:36:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:36:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:36:38,844 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:36:38,844 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:36:38,844 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:36:38,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:36:38,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:36:38,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:38,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:38,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:38,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:38,847 INFO L794 eck$LassoCheckResult]: Stem: 39#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; 40#L13-2 [2019-01-01 21:36:38,847 INFO L796 eck$LassoCheckResult]: Loop: 40#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 41#L17 assume !(0 == main_~y~0); 37#L21 assume !(main_~y~0 < 0); 38#L21-2 assume !(main_~xtmp~0 > 0); 45#L31-2 assume !(main_~xtmp~0 < 0); 42#L31-3 main_~y~0 := main_~xtmp~0; 43#L25-1 main_~x~0 := main_~tmp~0; 40#L13-2 [2019-01-01 21:36:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:36:38,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:38,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1817939337, now seen corresponding path program 1 times [2019-01-01 21:36:38,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:38,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:38,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:36:38,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:36:38,912 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:36:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:36:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:36:38,913 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:36:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:38,984 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-01 21:36:38,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:36:38,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-01 21:36:38,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:36:38,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2019-01-01 21:36:38,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:36:38,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:36:38,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-01-01 21:36:38,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:38,990 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-01 21:36:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-01-01 21:36:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-01 21:36:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:36:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-01 21:36:38,992 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:36:38,992 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:36:38,993 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:36:38,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-01-01 21:36:38,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:36:38,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:38,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:38,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:38,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:38,995 INFO L794 eck$LassoCheckResult]: Stem: 67#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; 68#L13-2 [2019-01-01 21:36:38,995 INFO L796 eck$LassoCheckResult]: Loop: 68#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 69#L17 assume !(0 == main_~y~0); 65#L21 assume !(main_~y~0 < 0); 66#L21-2 assume main_~xtmp~0 > 0; 72#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 70#L26-3 main_~y~0 := main_~xtmp~0; 71#L25-1 main_~x~0 := main_~tmp~0; 68#L13-2 [2019-01-01 21:36:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 21:36:38,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1818401082, now seen corresponding path program 1 times [2019-01-01 21:36:39,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:39,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:39,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:39,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 669111751, now seen corresponding path program 1 times [2019-01-01 21:36:39,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:39,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:39,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:39,233 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:39,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:39,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:39,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:39,235 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:39,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:39,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:39,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:39,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:39,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:39,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:39,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:39,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:39,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:39,414 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:36:39,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:39,632 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:39,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:39,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:39,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:39,665 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:39,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:39,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:39,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:39,692 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:39,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:39,699 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:39,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:39,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:44,868 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:44,871 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:44,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:44,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:44,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:44,872 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:44,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:44,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:44,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:44,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:44,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:44,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:44,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:44,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:44,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:45,102 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:45,109 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:45,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:45,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:45,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:45,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:45,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:45,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:45,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:45,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:45,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:45,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:45,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:45,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:45,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:45,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:45,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:45,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:45,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:45,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:45,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:45,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:45,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:45,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:45,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:45,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:45,173 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:45,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:45,187 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:45,190 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:45,190 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:45,191 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:45,191 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:36:45,194 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:45,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:45,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:45,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:36:45,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-01 21:36:45,975 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2019-01-01 21:36:45,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:36:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 21:36:45,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 7 letters. [2019-01-01 21:36:45,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:45,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 7 letters. [2019-01-01 21:36:45,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:45,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 14 letters. [2019-01-01 21:36:45,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:45,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-01-01 21:36:45,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:36:45,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-01-01 21:36:45,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:36:45,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:36:45,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-01 21:36:45,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:45,990 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-01 21:36:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-01 21:36:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-01 21:36:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:36:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-01 21:36:45,994 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-01 21:36:45,994 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-01 21:36:45,994 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:36:45,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-01-01 21:36:45,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:36:45,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:45,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:45,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:36:45,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:36:45,999 INFO L794 eck$LassoCheckResult]: Stem: 158#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; 159#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 161#L17 assume !(0 == main_~y~0); 174#L21 assume !(main_~y~0 < 0); 173#L21-2 assume main_~xtmp~0 > 0; 169#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 170#L26-2 [2019-01-01 21:36:45,999 INFO L796 eck$LassoCheckResult]: Loop: 170#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 170#L26-2 [2019-01-01 21:36:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash 925834904, now seen corresponding path program 1 times [2019-01-01 21:36:45,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:45,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:46,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2019-01-01 21:36:46,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:46,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889015, now seen corresponding path program 2 times [2019-01-01 21:36:46,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:46,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:46,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:46,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:46,204 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-01 21:36:46,225 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:46,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:46,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:46,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:46,226 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:46,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:46,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:46,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:36:46,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:46,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:46,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,429 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:46,429 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:46,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:46,456 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:46,456 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:46,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:46,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:46,467 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:46,489 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:46,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:46,698 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:46,701 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:46,701 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:46,701 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:46,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:46,701 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:46,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,702 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:46,702 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:46,702 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:36:46,702 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:46,702 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:46,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:46,875 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:46,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:46,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:46,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:46,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:46,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:46,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:46,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:46,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:46,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:46,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:46,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:46,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:46,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:46,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:46,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:46,913 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:46,928 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:36:46,929 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:36:46,930 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:46,932 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:36:46,932 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:46,933 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~xtmp~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-01-01 21:36:46,950 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:36:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:47,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:47,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:47,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:36:47,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:47,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 31 transitions. Complement of second has 6 states. [2019-01-01 21:36:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:36:47,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-01 21:36:47,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:47,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-01 21:36:47,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:47,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:36:47,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:47,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-01 21:36:47,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:36:47,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2019-01-01 21:36:47,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:36:47,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:36:47,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2019-01-01 21:36:47,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:47,338 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-01 21:36:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2019-01-01 21:36:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-01 21:36:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:36:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-01 21:36:47,341 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-01 21:36:47,341 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-01 21:36:47,342 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:36:47,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-01-01 21:36:47,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:36:47,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:47,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:47,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:47,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:47,345 INFO L794 eck$LassoCheckResult]: Stem: 256#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; 257#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 271#L17 assume !(0 == main_~y~0); 274#L21 assume !(main_~y~0 < 0); 273#L21-2 assume main_~xtmp~0 > 0; 272#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 270#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 262#L26-3 [2019-01-01 21:36:47,345 INFO L796 eck$LassoCheckResult]: Loop: 262#L26-3 main_~y~0 := main_~xtmp~0; 263#L25-1 main_~x~0 := main_~tmp~0; 258#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 259#L17 assume !(0 == main_~y~0); 252#L21 assume !(main_~y~0 < 0); 253#L21-2 assume main_~xtmp~0 > 0; 266#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 262#L26-3 [2019-01-01 21:36:47,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 1 times [2019-01-01 21:36:47,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:47,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:47,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:47,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:47,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1776384388, now seen corresponding path program 2 times [2019-01-01 21:36:47,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:47,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:47,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:47,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190014, now seen corresponding path program 1 times [2019-01-01 21:36:47,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:47,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:36:47,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:36:47,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:36:47,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:47,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:36:47,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:36:47,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 21:36:47,771 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:47,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:47,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:47,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:47,772 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:47,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:47,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:47,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:47,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:36:47,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:47,773 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:47,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:47,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:47,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:47,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:47,898 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:47,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:47,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:47,925 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:47,925 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:47,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:47,930 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:47,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:47,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:55,235 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:55,238 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:55,239 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:55,239 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:55,239 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:55,239 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:55,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:55,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:55,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:55,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:36:55,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:55,240 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:55,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:55,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:55,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:55,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:55,339 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:55,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:55,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:55,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:55,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:55,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:55,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:55,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:55,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:55,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:55,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:55,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:55,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:55,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:55,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:55,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:55,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:55,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:55,364 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:55,364 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:55,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:55,365 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:55,365 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:55,365 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-01 21:36:55,365 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:55,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:55,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:55,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:36:55,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:36:55,553 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 58 states and 72 transitions. Complement of second has 8 states. [2019-01-01 21:36:55,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-01 21:36:55,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 7 letters. [2019-01-01 21:36:55,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:55,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 7 letters. [2019-01-01 21:36:55,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:55,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 14 letters. [2019-01-01 21:36:55,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:55,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2019-01-01 21:36:55,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:36:55,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 67 transitions. [2019-01-01 21:36:55,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 21:36:55,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:36:55,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-01-01 21:36:55,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:55,563 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-01-01 21:36:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-01-01 21:36:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-01-01 21:36:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:36:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-01-01 21:36:55,570 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-01 21:36:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:36:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:36:55,571 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2019-01-01 21:36:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:55,774 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-01-01 21:36:55,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:36:55,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-01-01 21:36:55,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:36:55,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 37 transitions. [2019-01-01 21:36:55,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:36:55,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 21:36:55,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2019-01-01 21:36:55,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:55,780 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-01 21:36:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2019-01-01 21:36:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-01-01 21:36:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:36:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-01 21:36:55,785 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-01 21:36:55,786 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-01 21:36:55,786 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:36:55,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-01-01 21:36:55,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:36:55,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:55,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:55,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:55,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:55,790 INFO L794 eck$LassoCheckResult]: Stem: 559#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; 560#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 576#L17 assume !(0 == main_~y~0); 575#L21 assume !(main_~y~0 < 0); 574#L21-2 assume main_~xtmp~0 > 0; 573#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 572#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 563#L26-3 [2019-01-01 21:36:55,790 INFO L796 eck$LassoCheckResult]: Loop: 563#L26-3 main_~y~0 := main_~xtmp~0; 564#L25-1 main_~x~0 := main_~tmp~0; 561#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 562#L17 assume !(0 == main_~y~0); 557#L21 assume !(main_~y~0 < 0); 558#L21-2 assume main_~xtmp~0 > 0; 565#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 566#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 563#L26-3 [2019-01-01 21:36:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 2 times [2019-01-01 21:36:55,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:55,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:55,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash -766658727, now seen corresponding path program 1 times [2019-01-01 21:36:55,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:55,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:55,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1189119455, now seen corresponding path program 2 times [2019-01-01 21:36:55,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:55,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:55,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:55,964 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-01 21:36:55,984 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:55,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:55,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:55,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:55,984 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:55,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:55,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:55,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:55,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:36:55,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:55,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:55,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:56,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:56,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:56,075 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:56,076 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:56,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:56,082 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:56,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:56,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:02,589 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:02,592 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:02,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:02,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:02,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:02,593 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:02,593 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:02,593 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:02,593 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:02,593 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:37:02,593 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:02,594 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:02,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:02,710 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:02,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:02,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:02,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:02,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:02,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:02,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:02,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:02,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:02,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:02,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:02,721 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:02,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:02,721 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:02,721 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:02,721 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-01 21:37:02,722 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:37:02,787 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:02,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:37:02,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 54 transitions. Complement of second has 6 states. [2019-01-01 21:37:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:37:02,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-01 21:37:02,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2019-01-01 21:37:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 16 letters. [2019-01-01 21:37:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-01-01 21:37:02,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:37:02,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 45 transitions. [2019-01-01 21:37:02,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 21:37:02,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 21:37:02,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2019-01-01 21:37:02,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:02,853 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-01-01 21:37:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2019-01-01 21:37:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-01-01 21:37:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:37:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-01 21:37:02,857 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-01 21:37:02,858 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-01 21:37:02,858 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:37:02,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-01-01 21:37:02,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:37:02,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:02,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:02,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:37:02,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:37:02,861 INFO L794 eck$LassoCheckResult]: Stem: 699#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; 700#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 718#L17 assume !(0 == main_~y~0); 717#L21 assume !(main_~y~0 < 0); 716#L21-2 assume main_~xtmp~0 > 0; 715#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 713#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 712#L26-3 main_~y~0 := main_~xtmp~0; 708#L25-1 main_~x~0 := main_~tmp~0; 701#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 702#L17 assume !(0 == main_~y~0); 695#L21 assume !(main_~y~0 < 0); 696#L21-2 assume main_~xtmp~0 > 0; 709#L26-2 [2019-01-01 21:37:02,861 INFO L796 eck$LassoCheckResult]: Loop: 709#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 709#L26-2 [2019-01-01 21:37:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash -521667071, now seen corresponding path program 3 times [2019-01-01 21:37:02,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2019-01-01 21:37:02,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190016, now seen corresponding path program 4 times [2019-01-01 21:37:02,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:03,037 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:03,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:03,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:03,038 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:03,038 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:03,038 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,038 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:03,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:03,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-01 21:37:03,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:03,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:03,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,157 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,157 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,171 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:03,171 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,191 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:03,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,385 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:03,387 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:03,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:03,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:03,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:03,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:03,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:03,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:03,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-01 21:37:03,389 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:03,389 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:03,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,503 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:03,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:03,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:03,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:03,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:03,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:03,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:03,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:03,592 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:37:03,595 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:03,596 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:03,598 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:37:03,599 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:03,599 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~xtmp~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-01-01 21:37:03,607 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:37:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:03,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:37:03,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:37:03,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2019-01-01 21:37:03,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:37:03,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-01 21:37:03,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,738 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:03,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:37:03,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:37:03,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2019-01-01 21:37:03,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:37:03,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-01 21:37:03,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,849 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:03,919 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:37:03,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:37:03,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 5 states. [2019-01-01 21:37:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:37:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-01 21:37:03,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-01 21:37:03,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:37:03,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-01-01 21:37:03,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:03,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-01 21:37:03,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:03,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:03,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:03,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:03,994 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:03,994 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:03,994 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:03,994 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:37:03,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:03,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:03,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:04,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:04 BoogieIcfgContainer [2019-01-01 21:37:04,002 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:04,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:04,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:04,003 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:04,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:38" (3/4) ... [2019-01-01 21:37:04,007 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:04,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:04,008 INFO L168 Benchmark]: Toolchain (without parser) took 26508.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -72.0 MB). Peak memory consumption was 128.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:04,009 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:04,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.73 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:04,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.56 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:04,011 INFO L168 Benchmark]: Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:04,011 INFO L168 Benchmark]: RCFGBuilder took 443.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:04,012 INFO L168 Benchmark]: BuchiAutomizer took 25651.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.9 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:04,013 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:04,019 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.73 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 41.56 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 443.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25651.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.9 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 4 locations. One deterministic module has affine ranking function xtmp and consists of 5 locations. One deterministic module has affine ranking function xtmp and consists of 4 locations. One nondeterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 23.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 56 SDtfs, 93 SDslu, 16 SDs, 0 SdLazy, 185 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf96 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf103 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 19.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...