./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer --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.23-0cd3be1 [2018-11-28 11:52:56,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:52:56,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:52:56,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:52:56,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:52:56,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:52:56,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:52:56,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:52:56,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:52:56,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:52:56,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:52:56,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:52:56,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:52:56,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:52:56,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:52:56,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:52:56,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:52:56,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:52:56,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:52:56,985 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:52:56,986 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:52:56,987 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:52:56,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:52:56,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:52:56,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:52:56,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:52:56,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:52:56,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:52:56,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:52:56,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:52:56,992 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:52:56,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:52:56,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:52:56,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:52:56,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:52:56,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:52:56,994 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:52:57,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:52:57,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:52:57,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:52:57,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:52:57,006 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:52:57,007 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:52:57,007 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:52:57,007 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:52:57,007 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:52:57,007 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:52:57,007 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:52:57,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:52:57,008 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:52:57,009 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:52:57,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:52:57,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:52:57,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:52:57,009 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:52:57,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:52:57,009 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:52:57,010 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:52:57,010 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:52:57,011 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer 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 [2018-11-28 11:52:57,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:52:57,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:52:57,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:52:57,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:52:57,049 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:52:57,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c [2018-11-28 11:52:57,092 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/data/6470028c4/2d3d587788c042e6bb231fb083258fed/FLAG844413d9e [2018-11-28 11:52:57,494 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:52:57,494 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/sv-benchmarks/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c [2018-11-28 11:52:57,498 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/data/6470028c4/2d3d587788c042e6bb231fb083258fed/FLAG844413d9e [2018-11-28 11:52:57,508 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/data/6470028c4/2d3d587788c042e6bb231fb083258fed [2018-11-28 11:52:57,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:52:57,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:52:57,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:52:57,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:52:57,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:52:57,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589a87e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57, skipping insertion in model container [2018-11-28 11:52:57,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:52:57,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:52:57,631 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:52:57,633 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:52:57,644 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:52:57,652 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:52:57,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57 WrapperNode [2018-11-28 11:52:57,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:52:57,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:52:57,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:52:57,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:52:57,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:52:57,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:52:57,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:52:57,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:52:57,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... [2018-11-28 11:52:57,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:52:57,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:52:57,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:52:57,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:52:57,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:52:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:52:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:52:57,858 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:52:57,858 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 11:52:57,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:57 BoogieIcfgContainer [2018-11-28 11:52:57,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:52:57,859 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:52:57,859 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:52:57,862 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:52:57,863 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:52:57,863 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:52:57" (1/3) ... [2018-11-28 11:52:57,864 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c3398c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:52:57, skipping insertion in model container [2018-11-28 11:52:57,864 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:52:57,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:57" (2/3) ... [2018-11-28 11:52:57,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c3398c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:52:57, skipping insertion in model container [2018-11-28 11:52:57,865 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:52:57,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:57" (3/3) ... [2018-11-28 11:52:57,866 INFO L375 chiAutomizerObserver]: Analyzing ICFG GCD3_true-termination_true-no-overflow.c [2018-11-28 11:52:57,902 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:52:57,903 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:52:57,903 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:52:57,903 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:52:57,903 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:52:57,903 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:52:57,903 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:52:57,903 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:52:57,903 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:52:57,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 11:52:57,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:52:57,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:57,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:57,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:52:57,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:52:57,937 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:52:57,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 11:52:57,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:52:57,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:57,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:57,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:52:57,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:52:57,943 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 [2018-11-28 11:52:57,944 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 [2018-11-28 11:52:57,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:57,947 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 11:52:57,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1187012529, now seen corresponding path program 1 times [2018-11-28 11:52:58,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:58,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:58,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:52:58,068 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:52:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:52:58,079 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-28 11:52:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:58,107 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-28 11:52:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:52:58,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 11:52:58,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:52:58,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-28 11:52:58,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:52:58,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:52:58,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 11:52:58,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:58,114 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 11:52:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 11:52:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 11:52:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:52:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 11:52:58,135 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 11:52:58,135 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 11:52:58,135 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:52:58,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 11:52:58,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:52:58,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:58,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:58,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:52:58,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:58,136 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 [2018-11-28 11:52:58,136 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 [2018-11-28 11:52:58,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 11:52:58,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:58,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1817939337, now seen corresponding path program 1 times [2018-11-28 11:52:58,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:58,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:58,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:58,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:58,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:58,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:52:58,175 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:52:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:52:58,176 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 11:52:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:58,195 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-28 11:52:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:52:58,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-28 11:52:58,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:52:58,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2018-11-28 11:52:58,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:52:58,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:52:58,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2018-11-28 11:52:58,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:58,196 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-28 11:52:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2018-11-28 11:52:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-11-28 11:52:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 11:52:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-11-28 11:52:58,197 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-28 11:52:58,197 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-28 11:52:58,198 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:52:58,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2018-11-28 11:52:58,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:52:58,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:58,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:58,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:52:58,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:58,198 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 [2018-11-28 11:52:58,198 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 [2018-11-28 11:52:58,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-28 11:52:58,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:58,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:58,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:58,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:58,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1818401082, now seen corresponding path program 1 times [2018-11-28 11:52:58,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash 669111751, now seen corresponding path program 1 times [2018-11-28 11:52:58,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:58,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:58,292 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:52:58,293 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:52:58,293 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:52:58,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:52:58,293 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:52:58,294 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:52:58,294 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:52:58,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:52:58,294 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 11:52:58,294 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:52:58,294 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:52:58,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:58,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:58,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:58,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:52:58,420 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:52:58,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:52:58,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:52:58,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:52:58,442 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 /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:52:58,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:52:58,445 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:52:58,460 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:52:58,460 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 /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:52:58,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:52:58,462 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:52:58,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:52:58,485 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:02,398 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:02,400 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:02,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:02,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:02,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:02,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:02,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:02,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:02,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:02,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 11:53:02,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:02,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:02,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:02,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:02,460 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 [2018-11-28 11:53:02,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:02,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:02,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:02,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:02,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:02,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:02,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:02,470 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 [2018-11-28 11:53:02,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:02,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:02,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:02,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:02,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:02,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:02,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:02,479 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 [2018-11-28 11:53:02,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:02,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:02,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:02,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:02,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:02,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:02,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:02,491 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:02,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:53:02,499 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:53:02,500 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:02,500 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:53:02,500 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:02,501 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-28 11:53:02,501 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:53:02,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:02,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:02,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:02,597 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 [2018-11-28 11:53:02,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-28 11:53:02,656 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. [2018-11-28 11:53:02,656 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 [2018-11-28 11:53:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 11:53:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 11:53:02,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 7 letters. [2018-11-28 11:53:02,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:02,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 7 letters. [2018-11-28 11:53:02,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:02,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 14 letters. [2018-11-28 11:53:02,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:02,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-28 11:53:02,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 11:53:02,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2018-11-28 11:53:02,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 11:53:02,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 11:53:02,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-28 11:53:02,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:02,663 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 11:53:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-28 11:53:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-28 11:53:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:53:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-28 11:53:02,665 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-28 11:53:02,665 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-28 11:53:02,665 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:53:02,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-28 11:53:02,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:53:02,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:02,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:02,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:53:02,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:53:02,667 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 [2018-11-28 11:53:02,667 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 [2018-11-28 11:53:02,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:02,667 INFO L82 PathProgramCache]: Analyzing trace with hash 925834904, now seen corresponding path program 1 times [2018-11-28 11:53:02,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:02,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:02,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:02,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:02,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:02,679 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2018-11-28 11:53:02,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:02,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:02,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:02,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:02,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889015, now seen corresponding path program 2 times [2018-11-28 11:53:02,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:02,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:02,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:02,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:02,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:02,815 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:02,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:02,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:02,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:02,815 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:02,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:02,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:02,815 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:02,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-28 11:53:02,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:02,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:02,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:02,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:02,883 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:02,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:02,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:02,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:53:02,902 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 /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:02,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:02,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:02,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:53:02,907 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 /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:02,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:02,923 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:02,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:02,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:03,057 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:03,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:03,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:03,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:03,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:03,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:03,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:03,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:03,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:03,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-28 11:53:03,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:03,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:03,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:03,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:03,131 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 [2018-11-28 11:53:03,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:03,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:03,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:03,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:03,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:03,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:03,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:03,138 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 [2018-11-28 11:53:03,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:03,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:03,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:03,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:03,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:03,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:03,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:03,167 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:53:03,167 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 11:53:03,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:03,170 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 11:53:03,170 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:03,170 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] [2018-11-28 11:53:03,178 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 11:53:03,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:03,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:03,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:03,222 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 [2018-11-28 11:53:03,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 11:53:03,255 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. [2018-11-28 11:53:03,256 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 [2018-11-28 11:53:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:53:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 11:53:03,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-28 11:53:03,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:03,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-28 11:53:03,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:03,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 11:53:03,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:03,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-28 11:53:03,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:53:03,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2018-11-28 11:53:03,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 11:53:03,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 11:53:03,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2018-11-28 11:53:03,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:03,260 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 11:53:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2018-11-28 11:53:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 11:53:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 11:53:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-28 11:53:03,265 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 11:53:03,265 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 11:53:03,265 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:53:03,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-28 11:53:03,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:53:03,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:03,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:03,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:03,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:03,267 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 [2018-11-28 11:53:03,267 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 [2018-11-28 11:53:03,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 1 times [2018-11-28 11:53:03,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:03,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:03,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:03,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1776384388, now seen corresponding path program 2 times [2018-11-28 11:53:03,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:03,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:03,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190014, now seen corresponding path program 1 times [2018-11-28 11:53:03,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:03,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:03,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:53:03,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:03,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:03,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:53:03,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:03,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 11:53:03,413 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:03,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:03,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:03,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:03,413 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:03,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:03,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:03,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:03,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 11:53:03,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:03,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:03,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:03,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:03,466 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:03,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:03,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:03,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:53:03,483 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 /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:03,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:03,487 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:03,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:03,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:09,152 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:09,155 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:09,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:09,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:09,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:09,155 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:09,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:09,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:09,155 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:09,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 11:53:09,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:09,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:09,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:09,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:09,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:09,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:09,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:09,199 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 [2018-11-28 11:53:09,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:09,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:09,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:09,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:09,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:09,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:09,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:09,204 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 [2018-11-28 11:53:09,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:09,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:09,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:09,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:09,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:09,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:09,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:09,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:09,216 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:53:09,216 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:53:09,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:09,217 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:53:09,217 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:09,217 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2018-11-28 11:53:09,217 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:53:09,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:09,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:09,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:09,254 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 [2018-11-28 11:53:09,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 11:53:09,280 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. [2018-11-28 11:53:09,281 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 [2018-11-28 11:53:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:53:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-28 11:53:09,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 7 letters. [2018-11-28 11:53:09,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:09,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-28 11:53:09,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:09,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 14 letters. [2018-11-28 11:53:09,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:09,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2018-11-28 11:53:09,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:09,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 67 transitions. [2018-11-28 11:53:09,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 11:53:09,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 11:53:09,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2018-11-28 11:53:09,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:09,285 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2018-11-28 11:53:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2018-11-28 11:53:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2018-11-28 11:53:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 11:53:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-28 11:53:09,288 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 11:53:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:53:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:53:09,289 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2018-11-28 11:53:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:09,383 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-28 11:53:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:53:09,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2018-11-28 11:53:09,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:09,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 37 transitions. [2018-11-28 11:53:09,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 11:53:09,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 11:53:09,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2018-11-28 11:53:09,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:09,385 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-28 11:53:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2018-11-28 11:53:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-28 11:53:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 11:53:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 11:53:09,387 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 11:53:09,387 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 11:53:09,387 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:53:09,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-28 11:53:09,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:09,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:09,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:09,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:09,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:09,389 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 [2018-11-28 11:53:09,389 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 [2018-11-28 11:53:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 2 times [2018-11-28 11:53:09,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:09,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:09,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash -766658727, now seen corresponding path program 1 times [2018-11-28 11:53:09,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:09,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:09,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1189119455, now seen corresponding path program 2 times [2018-11-28 11:53:09,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:09,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:09,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:09,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:09,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:09,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:09,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:09,456 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:09,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:09,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:09,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:09,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 11:53:09,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:09,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:09,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:09,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:09,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:09,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:09,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:09,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:09,497 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:09,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:09,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:14,615 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:14,618 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:14,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:14,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:14,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:14,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:14,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:14,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:14,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:14,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 11:53:14,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:14,619 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:14,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:14,664 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:14,664 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 [2018-11-28 11:53:14,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:14,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:14,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:14,670 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:53:14,671 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:53:14,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:14,671 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:53:14,671 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:14,671 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2018-11-28 11:53:14,671 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:53:14,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:14,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:14,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:53:14,710 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 [2018-11-28 11:53:14,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 11:53:14,735 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. [2018-11-28 11:53:14,735 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 [2018-11-28 11:53:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:53:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 11:53:14,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-28 11:53:14,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:14,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-28 11:53:14,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:14,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 16 letters. [2018-11-28 11:53:14,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:14,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2018-11-28 11:53:14,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:53:14,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 45 transitions. [2018-11-28 11:53:14,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:53:14,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:53:14,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2018-11-28 11:53:14,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:14,737 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-28 11:53:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2018-11-28 11:53:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-11-28 11:53:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 11:53:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-28 11:53:14,739 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 11:53:14,739 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 11:53:14,739 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:53:14,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-28 11:53:14,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:53:14,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:14,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:14,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:53:14,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:53:14,740 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 [2018-11-28 11:53:14,740 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 [2018-11-28 11:53:14,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash -521667071, now seen corresponding path program 3 times [2018-11-28 11:53:14,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:14,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:14,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:14,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:14,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:14,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2018-11-28 11:53:14,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:14,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:14,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190016, now seen corresponding path program 4 times [2018-11-28 11:53:14,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:14,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:14,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:14,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:14,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:14,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:14,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:14,817 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:14,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:14,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:14,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:14,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration7_Lasso [2018-11-28 11:53:14,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:14,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:14,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:14,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:14,866 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:14,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:14,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:14,872 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:53:14,872 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 /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:14,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:14,887 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b52e8-04f1-4976-92fe-79546ce0398a/bin-2019/uautomizer/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 [2018-11-28 11:53:14,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:14,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:15,012 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:15,014 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:15,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:15,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:15,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:15,014 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:15,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:15,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:15,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:15,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration7_Lasso [2018-11-28 11:53:15,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:15,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:15,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:15,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:15,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:15,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:15,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:15,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:15,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:15,056 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:15,056 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 [2018-11-28 11:53:15,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:15,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:15,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:15,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:15,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:15,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:15,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:15,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:15,058 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 [2018-11-28 11:53:15,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:15,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:15,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:15,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:15,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:15,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:15,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:15,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:15,059 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 [2018-11-28 11:53:15,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:15,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:15,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:15,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:15,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:15,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:15,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:15,061 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 [2018-11-28 11:53:15,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:15,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:15,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:15,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:15,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:15,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:15,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:15,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:15,063 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 [2018-11-28 11:53:15,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:15,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:15,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:15,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:15,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:15,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:15,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:15,067 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 [2018-11-28 11:53:15,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:15,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:15,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:15,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:15,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:15,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:15,077 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:15,081 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:53:15,081 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 11:53:15,082 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:15,082 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 11:53:15,083 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:15,083 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] [2018-11-28 11:53:15,089 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 11:53:15,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:15,127 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 [2018-11-28 11:53:15,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 11:53:15,146 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. [2018-11-28 11:53:15,148 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 [2018-11-28 11:53:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:53:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-28 11:53:15,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2018-11-28 11:53:15,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:15,148 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:53:15,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:15,177 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 [2018-11-28 11:53:15,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 11:53:15,195 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. [2018-11-28 11:53:15,195 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 [2018-11-28 11:53:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:53:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-28 11:53:15,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2018-11-28 11:53:15,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:15,196 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:53:15,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:15,221 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 [2018-11-28 11:53:15,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 11:53:15,245 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. [2018-11-28 11:53:15,245 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 [2018-11-28 11:53:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:53:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 11:53:15,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2018-11-28 11:53:15,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:15,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 1 letters. [2018-11-28 11:53:15,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:15,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 11:53:15,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:15,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-28 11:53:15,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:15,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2018-11-28 11:53:15,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:53:15,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:53:15,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:53:15,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:15,249 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:15,249 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:15,249 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:15,249 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:53:15,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:53:15,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:15,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:53:15,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:53:15 BoogieIcfgContainer [2018-11-28 11:53:15,254 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:53:15,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:53:15,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:53:15,254 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:53:15,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:57" (3/4) ... [2018-11-28 11:53:15,256 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:53:15,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:53:15,257 INFO L168 Benchmark]: Toolchain (without parser) took 17746.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 952.6 MB in the beginning and 1.0 GB in the end (delta: -81.2 MB). Peak memory consumption was 142.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:15,258 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:15,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.75 ms. Allocated memory is still 1.0 GB. Free memory was 952.6 MB in the beginning and 941.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:15,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.19 ms. Allocated memory is still 1.0 GB. Free memory is still 941.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:15,259 INFO L168 Benchmark]: Boogie Preprocessor took 11.79 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 939.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:15,260 INFO L168 Benchmark]: RCFGBuilder took 173.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:15,261 INFO L168 Benchmark]: BuchiAutomizer took 17394.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.7 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 116.2 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:15,261 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:15,264 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.75 ms. Allocated memory is still 1.0 GB. Free memory was 952.6 MB in the beginning and 941.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.19 ms. Allocated memory is still 1.0 GB. Free memory is still 941.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.79 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 939.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17394.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.7 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 116.2 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.3 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 17.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 16.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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.1s 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: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 15.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...