./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/GCD3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/GCD3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aae625cda61f26fa063b78c3d3a58aff5ded8a89 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:29:56,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:56,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:56,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:56,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:56,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:56,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:56,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:56,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:56,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:56,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:56,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:56,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:56,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:56,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:56,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:56,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:56,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:56,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:56,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:56,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:56,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:56,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:56,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:56,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:56,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:56,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:56,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:56,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:56,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:56,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:56,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:56,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:56,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:56,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:56,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:56,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:56,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:56,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:56,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:56,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:56,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:29:56,118 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:56,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:56,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:56,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:56,120 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:56,120 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:56,121 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:56,121 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:56,121 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:56,121 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:56,122 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:56,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:56,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:56,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:56,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:56,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:56,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:56,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:56,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:56,124 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:56,124 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:56,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:56,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:56,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:56,125 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:56,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:56,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:56,125 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:56,126 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:56,126 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:56,127 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aae625cda61f26fa063b78c3d3a58aff5ded8a89 [2020-07-29 01:29:56,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:56,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:56,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:56,466 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:56,467 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:56,468 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/GCD3.c [2020-07-29 01:29:56,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b591497c7/5b7550e52a774c2e81563de72e4f2b78/FLAGabac4b0cf [2020-07-29 01:29:56,957 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:56,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/GCD3.c [2020-07-29 01:29:56,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b591497c7/5b7550e52a774c2e81563de72e4f2b78/FLAGabac4b0cf [2020-07-29 01:29:57,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b591497c7/5b7550e52a774c2e81563de72e4f2b78 [2020-07-29 01:29:57,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:57,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:57,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:57,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:57,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:57,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1baa51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57, skipping insertion in model container [2020-07-29 01:29:57,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:57,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:57,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:57,527 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:57,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:57,557 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:57,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57 WrapperNode [2020-07-29 01:29:57,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:57,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:57,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:57,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:57,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:57,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:57,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:57,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:57,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... [2020-07-29 01:29:57,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:57,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:57,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:57,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:57,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:58,046 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:58,047 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:29:58,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:58 BoogieIcfgContainer [2020-07-29 01:29:58,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:58,051 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:58,051 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:58,054 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:58,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:58,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:57" (1/3) ... [2020-07-29 01:29:58,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d482e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:58, skipping insertion in model container [2020-07-29 01:29:58,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:58,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:57" (2/3) ... [2020-07-29 01:29:58,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d482e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:58, skipping insertion in model container [2020-07-29 01:29:58,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:58,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:58" (3/3) ... [2020-07-29 01:29:58,059 INFO L371 chiAutomizerObserver]: Analyzing ICFG GCD3.c [2020-07-29 01:29:58,114 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:58,114 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:58,115 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:58,115 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:58,115 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:58,115 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:58,115 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:58,115 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:58,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:29:58,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:29:58,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:58,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:58,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:58,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:29:58,160 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:58,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:29:58,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:29:58,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:58,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:58,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:58,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:29:58,170 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 [2020-07-29 01:29:58,170 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 [2020-07-29 01:29:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:29:58,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702475467] [2020-07-29 01:29:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,260 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1187012529, now seen corresponding path program 1 times [2020-07-29 01:29:58,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634012917] [2020-07-29 01:29:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:58,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#true} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {22#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:58,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#(<= 1 ULTIMATE.start_main_~y~0)} assume 0 == main_~y~0;main_~y~0 := main_~y~0; {21#false} is VALID [2020-07-29 01:29:58,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#false} assume !(main_~xtmp~0 > 0); {21#false} is VALID [2020-07-29 01:29:58,351 INFO L280 TraceCheckUtils]: 3: Hoare triple {21#false} assume !true; {21#false} is VALID [2020-07-29 01:29:58,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {21#false} main_~y~0 := main_~xtmp~0; {21#false} is VALID [2020-07-29 01:29:58,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#false} main_~x~0 := main_~tmp~0; {21#false} is VALID [2020-07-29 01:29:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:58,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634012917] [2020-07-29 01:29:58,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:58,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:29:58,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802803545] [2020-07-29 01:29:58,362 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:58,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:29:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:29:58,376 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2020-07-29 01:29:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:58,455 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-29 01:29:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:29:58,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:58,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:58,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2020-07-29 01:29:58,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:29:58,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2020-07-29 01:29:58,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:29:58,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:29:58,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:29:58,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:58,495 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:29:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:29:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:29:58,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:58,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:29:58,519 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:29:58,521 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:29:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:58,522 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:29:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:29:58,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:58,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:58,524 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:29:58,524 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:29:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:58,526 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:29:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:29:58,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:58,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:58,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:58,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:29:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:29:58,530 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:29:58,530 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:29:58,530 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:58,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:29:58,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:29:58,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:58,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:58,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:58,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:58,532 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 [2020-07-29 01:29:58,532 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 [2020-07-29 01:29:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:29:58,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801821508] [2020-07-29 01:29:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1817939337, now seen corresponding path program 1 times [2020-07-29 01:29:58,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628615379] [2020-07-29 01:29:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:58,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#true} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {74#(<= 1 ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:29:58,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(<= 1 ULTIMATE.start_main_~xtmp~0)} assume !(0 == main_~y~0); {74#(<= 1 ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:29:58,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#(<= 1 ULTIMATE.start_main_~xtmp~0)} assume !(main_~y~0 < 0); {74#(<= 1 ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:29:58,585 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#(<= 1 ULTIMATE.start_main_~xtmp~0)} assume !(main_~xtmp~0 > 0); {73#false} is VALID [2020-07-29 01:29:58,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#false} assume !(main_~xtmp~0 < 0); {73#false} is VALID [2020-07-29 01:29:58,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#false} main_~y~0 := main_~xtmp~0; {73#false} is VALID [2020-07-29 01:29:58,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {73#false} main_~x~0 := main_~tmp~0; {73#false} is VALID [2020-07-29 01:29:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:58,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628615379] [2020-07-29 01:29:58,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:58,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:29:58,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818373848] [2020-07-29 01:29:58,589 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:58,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:29:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:29:58,590 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:29:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:58,628 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:29:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:29:58,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:58,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:58,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-07-29 01:29:58,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:29:58,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2020-07-29 01:29:58,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:29:58,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:29:58,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2020-07-29 01:29:58,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:58,645 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:29:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2020-07-29 01:29:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2020-07-29 01:29:58,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:58,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 14 transitions. Second operand 8 states. [2020-07-29 01:29:58,647 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 14 transitions. Second operand 8 states. [2020-07-29 01:29:58,647 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 8 states. [2020-07-29 01:29:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:58,648 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:29:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:29:58,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:58,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:58,650 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states and 14 transitions. [2020-07-29 01:29:58,650 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states and 14 transitions. [2020-07-29 01:29:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:58,652 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:29:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:29:58,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:58,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:58,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:58,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:29:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 01:29:58,655 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:29:58,655 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:29:58,655 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:58,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:29:58,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:29:58,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:58,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:58,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:58,657 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:58,657 INFO L794 eck$LassoCheckResult]: Stem: 89#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; 90#L13-2 [2020-07-29 01:29:58,658 INFO L796 eck$LassoCheckResult]: Loop: 90#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 91#L17 assume !(0 == main_~y~0); 87#L21 assume !(main_~y~0 < 0); 88#L21-2 assume main_~xtmp~0 > 0; 94#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 92#L26-3 main_~y~0 := main_~xtmp~0; 93#L25-1 main_~x~0 := main_~tmp~0; 90#L13-2 [2020-07-29 01:29:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-07-29 01:29:58,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805610393] [2020-07-29 01:29:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,667 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1818401082, now seen corresponding path program 1 times [2020-07-29 01:29:58,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426897874] [2020-07-29 01:29:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 669111751, now seen corresponding path program 1 times [2020-07-29 01:29:58,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:58,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050534563] [2020-07-29 01:29:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:58,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:58,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:58,801 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:58,802 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:58,802 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:58,802 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:58,803 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:58,803 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:58,803 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:58,803 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:58,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration3_Loop [2020-07-29 01:29:58,804 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:58,805 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:58,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:58,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:58,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:59,099 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:59,100 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:59,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:59,121 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:59,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:59,139 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 01:29:59,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:59,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:59,179 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:59,179 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 01:29:59,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:59,202 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:59,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:59,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:03,148 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:03,151 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:03,151 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:03,151 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:03,151 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:03,151 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:03,151 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:03,152 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:03,152 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration3_Loop [2020-07-29 01:30:03,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:03,152 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:03,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:03,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:03,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:03,337 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:03,342 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,355 INFO L120 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 [2020-07-29 01:30:03,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:03,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:03,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:03,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:03,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:03,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:03,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,393 INFO L120 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 [2020-07-29 01:30:03,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:03,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:03,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:03,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:03,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:03,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:03,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,432 INFO L120 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 [2020-07-29 01:30:03,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:03,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:03,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:03,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:03,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:03,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:03,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:03,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:03,469 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:03,469 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:03,474 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:03,474 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:03,474 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:30:03,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:03,504 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0;" "assume !(0 == main_~y~0);" "assume !(main_~y~0 < 0);" "assume main_~xtmp~0 > 0;" "assume !(main_~xtmp~0 >= main_~y~0);" "main_~y~0 := main_~xtmp~0;" "main_~x~0 := main_~tmp~0;" [2020-07-29 01:30:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:03,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#unseeded} 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; {128#unseeded} is VALID [2020-07-29 01:30:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:03,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:30:03,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(0 == main_~y~0); {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:30:03,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~y~0 < 0); {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:30:03,741 INFO L280 TraceCheckUtils]: 3: Hoare triple {131#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume main_~xtmp~0 > 0; {155#(and (< 0 ULTIMATE.start_main_~xtmp~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:03,742 INFO L280 TraceCheckUtils]: 4: Hoare triple {155#(and (< 0 ULTIMATE.start_main_~xtmp~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~xtmp~0 >= main_~y~0); {159#(and (<= (+ ULTIMATE.start_main_~xtmp~0 1) oldRank0) (< 0 ULTIMATE.start_main_~xtmp~0))} is VALID [2020-07-29 01:30:03,743 INFO L280 TraceCheckUtils]: 5: Hoare triple {159#(and (<= (+ ULTIMATE.start_main_~xtmp~0 1) oldRank0) (< 0 ULTIMATE.start_main_~xtmp~0))} main_~y~0 := main_~xtmp~0; {163#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 2 oldRank0))} is VALID [2020-07-29 01:30:03,745 INFO L280 TraceCheckUtils]: 6: Hoare triple {163#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 2 oldRank0))} main_~x~0 := main_~tmp~0; {141#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:30:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:03,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:30:03,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:03,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,763 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 [2020-07-29 01:30:03,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:30:03,901 INFO L75 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. [2020-07-29 01:30:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:03,901 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:03,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:03,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:03,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:03,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:30:03,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:03,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:03,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:03,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2020-07-29 01:30:03,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:30:03,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:03,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:03,911 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:03,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:03,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:30:03,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:03,915 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:03,915 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 32 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:03,919 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:30:03,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:03,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:03,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:30:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:30:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:30:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:03,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:03,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:30:03,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:30:03,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:30:03,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:30:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:30:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:30:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:30:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:30:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:30:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:30:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:30:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:30:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:03,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:30:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:30:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:30:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:03,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:03,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:03,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,957 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:30:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-29 01:30:03,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 7 letters. [2020-07-29 01:30:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 14 letters. [2020-07-29 01:30:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:03,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:30:03,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2020-07-29 01:30:03,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:30:03,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:30:03,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-07-29 01:30:03,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:03,966 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:30:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-07-29 01:30:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2020-07-29 01:30:03,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:03,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 28 transitions. Second operand 21 states. [2020-07-29 01:30:03,969 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 28 transitions. Second operand 21 states. [2020-07-29 01:30:03,969 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 21 states. [2020-07-29 01:30:03,970 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:03,973 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-29 01:30:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-29 01:30:03,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:03,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:03,975 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states and 28 transitions. [2020-07-29 01:30:03,975 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states and 28 transitions. [2020-07-29 01:30:03,975 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:03,978 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-29 01:30:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-29 01:30:03,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:03,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:03,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:03,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:30:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-29 01:30:03,981 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-29 01:30:03,981 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-29 01:30:03,981 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:30:03,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2020-07-29 01:30:03,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:03,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:03,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:03,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:30:03,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:30:03,984 INFO L794 eck$LassoCheckResult]: Stem: 212#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; 213#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 215#L17 assume !(0 == main_~y~0); 228#L21 assume !(main_~y~0 < 0); 227#L21-2 assume main_~xtmp~0 > 0; 224#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 225#L26-2 [2020-07-29 01:30:03,984 INFO L796 eck$LassoCheckResult]: Loop: 225#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 225#L26-2 [2020-07-29 01:30:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 925834904, now seen corresponding path program 1 times [2020-07-29 01:30:03,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:03,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681461713] [2020-07-29 01:30:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:03,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:03,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2020-07-29 01:30:04,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649971881] [2020-07-29 01:30:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889015, now seen corresponding path program 2 times [2020-07-29 01:30:04,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753896389] [2020-07-29 01:30:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,031 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,117 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:04,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:04,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:04,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:04,118 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:04,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:04,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:04,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration4_Lasso [2020-07-29 01:30:04,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:04,119 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:04,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,356 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:04,356 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:04,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:04,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:04,369 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 01:30:04,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:04,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:04,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:04,410 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 01:30:04,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:04,436 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:04,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:04,649 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:04,651 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:04,651 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:04,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:04,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:04,652 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:04,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:04,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:04,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration4_Lasso [2020-07-29 01:30:04,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:04,652 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:04,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:04,869 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:04,869 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,887 INFO L120 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 [2020-07-29 01:30:04,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:04,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:04,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:04,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:04,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:04,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,947 INFO L120 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 [2020-07-29 01:30:04,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:04,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:04,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:04,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:04,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:04,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:04,994 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:30:04,994 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:05,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,010 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:30:05,010 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:05,011 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2020-07-29 01:30:05,055 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:30:05,059 INFO L393 LassoCheck]: Loop: "assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0;" [2020-07-29 01:30:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:30:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:05,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {330#unseeded} 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; {330#unseeded} is VALID [2020-07-29 01:30:05,125 INFO L280 TraceCheckUtils]: 1: Hoare triple {330#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:05,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(0 == main_~y~0); {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:05,126 INFO L280 TraceCheckUtils]: 3: Hoare triple {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(main_~y~0 < 0); {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:05,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume main_~xtmp~0 > 0; {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:05,127 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {349#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,132 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:05,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#(and (>= oldRank0 ULTIMATE.start_main_~xtmp~0) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {352#(and (or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0))) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:30:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:05,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:05,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:05,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,146 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 [2020-07-29 01:30:05,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:30:05,212 INFO L75 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. [2020-07-29 01:30:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:05,212 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:05,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:05,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:05,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 01:30:05,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:05,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,219 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 24 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:05,224 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:05,224 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:05,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,225 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:05,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:05,228 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:05,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:30:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:30:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:30:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,250 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:30:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:05,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:05,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2020-07-29 01:30:05,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:30:05,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:30:05,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2020-07-29 01:30:05,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:05,267 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-29 01:30:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2020-07-29 01:30:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-29 01:30:05,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:05,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 29 transitions. Second operand 23 states. [2020-07-29 01:30:05,270 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 29 transitions. Second operand 23 states. [2020-07-29 01:30:05,271 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 23 states. [2020-07-29 01:30:05,271 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:05,273 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-29 01:30:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-29 01:30:05,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:05,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:05,274 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states and 29 transitions. [2020-07-29 01:30:05,274 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states and 29 transitions. [2020-07-29 01:30:05,274 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:05,280 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-29 01:30:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-29 01:30:05,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:05,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:05,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:05,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:30:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-29 01:30:05,282 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-29 01:30:05,282 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-29 01:30:05,283 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:30:05,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2020-07-29 01:30:05,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:05,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,284 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:05,285 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:05,285 INFO L794 eck$LassoCheckResult]: Stem: 412#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; 413#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 427#L17 assume !(0 == main_~y~0); 430#L21 assume !(main_~y~0 < 0); 429#L21-2 assume main_~xtmp~0 > 0; 428#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 426#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 418#L26-3 [2020-07-29 01:30:05,285 INFO L796 eck$LassoCheckResult]: Loop: 418#L26-3 main_~y~0 := main_~xtmp~0; 419#L25-1 main_~x~0 := main_~tmp~0; 414#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 415#L17 assume !(0 == main_~y~0); 408#L21 assume !(main_~y~0 < 0); 409#L21-2 assume main_~xtmp~0 > 0; 422#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 418#L26-3 [2020-07-29 01:30:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 1 times [2020-07-29 01:30:05,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:05,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568175960] [2020-07-29 01:30:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:05,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:05,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:05,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1776384388, now seen corresponding path program 2 times [2020-07-29 01:30:05,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:05,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721735890] [2020-07-29 01:30:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:05,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:05,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:05,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190014, now seen corresponding path program 1 times [2020-07-29 01:30:05,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:05,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034396174] [2020-07-29 01:30:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {531#true} 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; {531#true} is VALID [2020-07-29 01:30:05,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {531#true} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !(0 == main_~y~0); {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,451 INFO L280 TraceCheckUtils]: 3: Hoare triple {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !(main_~y~0 < 0); {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume main_~xtmp~0 > 0; {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {533#(= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !(main_~xtmp~0 >= main_~y~0); {534#(<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {534#(<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0)} main_~y~0 := main_~xtmp~0; {535#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {535#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~tmp~0)} main_~x~0 := main_~tmp~0; {536#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:05,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {536#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume !(0 == main_~y~0); {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume !(main_~y~0 < 0); {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume main_~xtmp~0 > 0; {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,458 INFO L280 TraceCheckUtils]: 13: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume !(main_~xtmp~0 >= main_~y~0); {532#false} is VALID [2020-07-29 01:30:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:05,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034396174] [2020-07-29 01:30:05,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508644618] [2020-07-29 01:30:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:30:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:30:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:05,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {531#true} 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; {531#true} is VALID [2020-07-29 01:30:05,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {531#true} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !(0 == main_~y~0); {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !(main_~y~0 < 0); {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume main_~xtmp~0 > 0; {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {544#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0)} assume !(main_~xtmp~0 >= main_~y~0); {534#(<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {534#(<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0)} main_~y~0 := main_~xtmp~0; {535#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:05,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {535#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~tmp~0)} main_~x~0 := main_~tmp~0; {536#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:05,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {536#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume !(0 == main_~y~0); {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,619 INFO L280 TraceCheckUtils]: 11: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume !(main_~y~0 < 0); {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume main_~xtmp~0 > 0; {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:05,620 INFO L280 TraceCheckUtils]: 13: Hoare triple {537#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0)} assume !(main_~xtmp~0 >= main_~y~0); {532#false} is VALID [2020-07-29 01:30:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:05,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:30:05,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:30:05,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031788352] [2020-07-29 01:30:05,667 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:05,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:05,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:05,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:05,668 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:05,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:05,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:05,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration5_Loop [2020-07-29 01:30:05,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:05,669 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:05,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:05,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:05,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:05,809 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:05,809 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:05,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:05,819 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:05,819 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:05,842 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:05,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:09,842 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:09,844 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:09,844 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:09,845 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:09,845 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:09,845 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:09,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:09,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:09,845 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration5_Loop [2020-07-29 01:30:09,845 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:09,846 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:09,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:09,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:09,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:09,987 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:09,988 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:09,999 INFO L120 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 [2020-07-29 01:30:10,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:10,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:10,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:10,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:10,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:10,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:10,042 INFO L120 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 [2020-07-29 01:30:10,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:10,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:10,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:10,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:10,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:10,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:10,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,051 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:10,057 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:10,058 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,061 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:10,062 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:10,062 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:10,062 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2020-07-29 01:30:10,084 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:10,086 INFO L393 LassoCheck]: Loop: "main_~y~0 := main_~xtmp~0;" "main_~x~0 := main_~tmp~0;" "assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0;" "assume !(0 == main_~y~0);" "assume !(main_~y~0 < 0);" "assume main_~xtmp~0 > 0;" "assume !(main_~xtmp~0 >= main_~y~0);" [2020-07-29 01:30:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {578#unseeded} 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; {578#unseeded} is VALID [2020-07-29 01:30:10,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {578#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {578#unseeded} is VALID [2020-07-29 01:30:10,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#unseeded} assume !(0 == main_~y~0); {578#unseeded} is VALID [2020-07-29 01:30:10,123 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#unseeded} assume !(main_~y~0 < 0); {578#unseeded} is VALID [2020-07-29 01:30:10,124 INFO L280 TraceCheckUtils]: 4: Hoare triple {578#unseeded} assume main_~xtmp~0 > 0; {578#unseeded} is VALID [2020-07-29 01:30:10,125 INFO L280 TraceCheckUtils]: 5: Hoare triple {578#unseeded} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {578#unseeded} is VALID [2020-07-29 01:30:10,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {578#unseeded} assume !(main_~xtmp~0 >= main_~y~0); {578#unseeded} is VALID [2020-07-29 01:30:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {581#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} main_~y~0 := main_~xtmp~0; {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:10,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} main_~x~0 := main_~tmp~0; {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:10,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:10,193 INFO L280 TraceCheckUtils]: 3: Hoare triple {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} assume !(0 == main_~y~0); {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:10,194 INFO L280 TraceCheckUtils]: 4: Hoare triple {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} assume !(main_~y~0 < 0); {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:10,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {614#(<= ULTIMATE.start_main_~y~0 oldRank0)} assume main_~xtmp~0 > 0; {630#(and (< 0 ULTIMATE.start_main_~xtmp~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:10,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {630#(and (< 0 ULTIMATE.start_main_~xtmp~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~xtmp~0 >= main_~y~0); {591#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:10,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:10,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:10,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,206 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 [2020-07-29 01:30:10,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:30:10,317 INFO L75 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. [2020-07-29 01:30:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:10,317 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:10,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:10,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 72 transitions. [2020-07-29 01:30:10,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:10,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,321 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:10,322 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:10,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:10,324 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:10,324 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 72 transitions. cyclomatic complexity: 20 [2020-07-29 01:30:10,325 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:30:10,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:30:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:30:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:30:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:30:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:10,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:10,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:10,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:10,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:30:10,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:30:10,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:30:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:30:10,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:30:10,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:30:10,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:30:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:30:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:30:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:10,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:10,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,344 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-29 01:30:10,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:10,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 14 letters. [2020-07-29 01:30:10,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. cyclomatic complexity: 20 [2020-07-29 01:30:10,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:10,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 67 transitions. [2020-07-29 01:30:10,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 01:30:10,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 01:30:10,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2020-07-29 01:30:10,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:10,352 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2020-07-29 01:30:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2020-07-29 01:30:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2020-07-29 01:30:10,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:10,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states and 67 transitions. Second operand 46 states. [2020-07-29 01:30:10,355 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states and 67 transitions. Second operand 46 states. [2020-07-29 01:30:10,356 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 46 states. [2020-07-29 01:30:10,356 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,359 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-29 01:30:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-29 01:30:10,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,360 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 53 states and 67 transitions. [2020-07-29 01:30:10,360 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 53 states and 67 transitions. [2020-07-29 01:30:10,360 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,363 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2020-07-29 01:30:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2020-07-29 01:30:10,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:10,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:30:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2020-07-29 01:30:10,366 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2020-07-29 01:30:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:30:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:30:10,367 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2020-07-29 01:30:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:10,618 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-07-29 01:30:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:30:10,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:30:10,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:10,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2020-07-29 01:30:10,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:10,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 37 transitions. [2020-07-29 01:30:10,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:30:10,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 01:30:10,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2020-07-29 01:30:10,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:10,651 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-07-29 01:30:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2020-07-29 01:30:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2020-07-29 01:30:10,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:10,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 37 transitions. Second operand 23 states. [2020-07-29 01:30:10,656 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 37 transitions. Second operand 23 states. [2020-07-29 01:30:10,656 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 23 states. [2020-07-29 01:30:10,659 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,660 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-29 01:30:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-29 01:30:10,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,663 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states and 37 transitions. [2020-07-29 01:30:10,663 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states and 37 transitions. [2020-07-29 01:30:10,664 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,667 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-29 01:30:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-29 01:30:10,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:10,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:30:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-29 01:30:10,673 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-29 01:30:10,673 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-29 01:30:10,674 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:30:10,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-07-29 01:30:10,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:10,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,676 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:10,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:10,676 INFO L794 eck$LassoCheckResult]: Stem: 988#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; 989#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 1005#L17 assume !(0 == main_~y~0); 1004#L21 assume !(main_~y~0 < 0); 1003#L21-2 assume main_~xtmp~0 > 0; 1002#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 1001#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 992#L26-3 [2020-07-29 01:30:10,676 INFO L796 eck$LassoCheckResult]: Loop: 992#L26-3 main_~y~0 := main_~xtmp~0; 993#L25-1 main_~x~0 := main_~tmp~0; 990#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 991#L17 assume !(0 == main_~y~0); 986#L21 assume !(main_~y~0 < 0); 987#L21-2 assume main_~xtmp~0 > 0; 994#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 995#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 992#L26-3 [2020-07-29 01:30:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 2 times [2020-07-29 01:30:10,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633073594] [2020-07-29 01:30:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash -766658727, now seen corresponding path program 1 times [2020-07-29 01:30:10,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683136076] [2020-07-29 01:30:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1189119455, now seen corresponding path program 2 times [2020-07-29 01:30:10,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916014539] [2020-07-29 01:30:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,749 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,809 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:10,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:10,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:10,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:10,809 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:10,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:10,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:10,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration6_Loop [2020-07-29 01:30:10,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:10,810 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:10,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:10,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:10,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:10,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:10,968 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:10,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:10,971 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:10,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:20,450 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:20,453 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:20,453 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:20,453 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:20,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:20,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:20,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:20,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:20,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration6_Loop [2020-07-29 01:30:20,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:20,454 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:20,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:20,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:20,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:20,665 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-29 01:30:20,684 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:20,684 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:20,692 INFO L120 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 [2020-07-29 01:30:20,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:20,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:20,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:20,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:20,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:20,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:20,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:20,711 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:20,711 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:20,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:20,717 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:20,717 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:20,717 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,751 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:20,754 INFO L393 LassoCheck]: Loop: "main_~y~0 := main_~xtmp~0;" "main_~x~0 := main_~tmp~0;" "assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0;" "assume !(0 == main_~y~0);" "assume !(main_~y~0 < 0);" "assume main_~xtmp~0 > 0;" "assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0;" "assume !(main_~xtmp~0 >= main_~y~0);" [2020-07-29 01:30:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:20,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#unseeded} 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; {1138#unseeded} is VALID [2020-07-29 01:30:20,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1138#unseeded} is VALID [2020-07-29 01:30:20,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#unseeded} assume !(0 == main_~y~0); {1138#unseeded} is VALID [2020-07-29 01:30:20,789 INFO L280 TraceCheckUtils]: 3: Hoare triple {1138#unseeded} assume !(main_~y~0 < 0); {1138#unseeded} is VALID [2020-07-29 01:30:20,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {1138#unseeded} assume main_~xtmp~0 > 0; {1138#unseeded} is VALID [2020-07-29 01:30:20,790 INFO L280 TraceCheckUtils]: 5: Hoare triple {1138#unseeded} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1138#unseeded} is VALID [2020-07-29 01:30:20,791 INFO L280 TraceCheckUtils]: 6: Hoare triple {1138#unseeded} assume !(main_~xtmp~0 >= main_~y~0); {1138#unseeded} is VALID [2020-07-29 01:30:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:20,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {1141#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} main_~y~0 := main_~xtmp~0; {1174#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:20,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#(<= ULTIMATE.start_main_~y~0 oldRank0)} main_~x~0 := main_~tmp~0; {1174#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:20,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#(<= ULTIMATE.start_main_~y~0 oldRank0)} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:20,858 INFO L280 TraceCheckUtils]: 3: Hoare triple {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(0 == main_~y~0); {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:20,858 INFO L280 TraceCheckUtils]: 4: Hoare triple {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~y~0 < 0); {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:20,859 INFO L280 TraceCheckUtils]: 5: Hoare triple {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume main_~xtmp~0 > 0; {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:20,860 INFO L280 TraceCheckUtils]: 6: Hoare triple {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:20,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {1181#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~xtmp~0 >= main_~y~0); {1151#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:20,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:20,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:20,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:20,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:30:20,946 INFO L75 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. [2020-07-29 01:30:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:20,947 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:20,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:20,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:20,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:20,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2020-07-29 01:30:20,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:20,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,950 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:20,956 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:30:20,960 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:20,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:20,961 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:20,961 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 14 [2020-07-29 01:30:20,962 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:20,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:20,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:20,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:20,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:20,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:20,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:20,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:20,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:20,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:20,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:20,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:20,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:20,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:30:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:30:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:30:20,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:30:20,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:30:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:30:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:20,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:20,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:30:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:20,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,987 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:30:20,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:30:20,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:20,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 16 letters. [2020-07-29 01:30:20,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. cyclomatic complexity: 14 [2020-07-29 01:30:21,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:21,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 45 transitions. [2020-07-29 01:30:21,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 01:30:21,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:30:21,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2020-07-29 01:30:21,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:21,004 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-07-29 01:30:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2020-07-29 01:30:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2020-07-29 01:30:21,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:21,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 45 transitions. Second operand 28 states. [2020-07-29 01:30:21,009 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 45 transitions. Second operand 28 states. [2020-07-29 01:30:21,009 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 28 states. [2020-07-29 01:30:21,009 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:21,011 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-29 01:30:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-29 01:30:21,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:21,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:21,012 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 37 states and 45 transitions. [2020-07-29 01:30:21,012 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 37 states and 45 transitions. [2020-07-29 01:30:21,013 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:21,018 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-29 01:30:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-29 01:30:21,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:21,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:21,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:21,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:30:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-29 01:30:21,024 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-29 01:30:21,024 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-29 01:30:21,024 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:30:21,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2020-07-29 01:30:21,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:21,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:21,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:21,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-29 01:30:21,025 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:30:21,026 INFO L794 eck$LassoCheckResult]: Stem: 1256#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; 1257#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 1279#L17 assume !(0 == main_~y~0); 1277#L21 assume !(main_~y~0 < 0); 1275#L21-2 assume main_~xtmp~0 > 0; 1273#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 1270#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 1269#L26-3 main_~y~0 := main_~xtmp~0; 1265#L25-1 main_~x~0 := main_~tmp~0; 1258#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 1259#L17 assume !(0 == main_~y~0); 1252#L21 assume !(main_~y~0 < 0); 1253#L21-2 assume main_~xtmp~0 > 0; 1266#L26-2 [2020-07-29 01:30:21,026 INFO L796 eck$LassoCheckResult]: Loop: 1266#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 1266#L26-2 [2020-07-29 01:30:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -521667071, now seen corresponding path program 3 times [2020-07-29 01:30:21,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:21,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394662839] [2020-07-29 01:30:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:21,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:21,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:21,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2020-07-29 01:30:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:21,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887358292] [2020-07-29 01:30:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:21,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:21,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:21,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190016, now seen corresponding path program 4 times [2020-07-29 01:30:21,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:21,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56509543] [2020-07-29 01:30:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:21,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:21,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:21,091 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:21,208 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:21,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:21,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:21,209 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:21,209 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:21,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:21,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:21,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration7_Lasso [2020-07-29 01:30:21,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:21,209 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:21,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,438 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:21,438 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:21,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:21,445 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,453 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:21,453 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:21,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:21,489 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:21,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:21,529 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,710 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:21,712 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:21,712 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:21,712 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:21,712 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:21,712 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:21,712 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,713 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:21,713 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:21,713 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration7_Lasso [2020-07-29 01:30:21,713 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:21,713 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:21,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:21,919 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:21,919 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,922 INFO L120 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 [2020-07-29 01:30:21,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:21,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:21,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:21,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:21,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:21,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:21,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:21,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,955 INFO L120 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 [2020-07-29 01:30:21,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:21,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:21,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:21,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:21,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:21,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:21,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:21,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:21,981 INFO L120 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 [2020-07-29 01:30:21,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:21,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:21,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:21,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:21,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:21,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:21,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:22,015 INFO L120 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 [2020-07-29 01:30:22,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:22,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:22,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:22,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:22,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:22,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:22,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:22,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:22,041 INFO L120 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 [2020-07-29 01:30:22,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:22,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:22,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:22,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:22,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:22,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:22,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:22,070 INFO L120 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 [2020-07-29 01:30:22,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:22,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:22,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:22,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:22,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:22,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:22,082 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:22,089 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:30:22,089 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:22,091 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:22,093 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-07-29 01:30:22,093 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:22,093 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~xtmp~0 >= 0, 1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2020-07-29 01:30:22,130 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 01:30:22,134 INFO L393 LassoCheck]: Loop: "assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0;" [2020-07-29 01:30:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {1422#unseeded} 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; {1422#unseeded} is VALID [2020-07-29 01:30:22,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {1422#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {1422#unseeded} assume !(0 == main_~y~0); {1422#unseeded} is VALID [2020-07-29 01:30:22,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {1422#unseeded} assume !(main_~y~0 < 0); {1422#unseeded} is VALID [2020-07-29 01:30:22,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {1422#unseeded} assume main_~xtmp~0 > 0; {1422#unseeded} is VALID [2020-07-29 01:30:22,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {1422#unseeded} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {1422#unseeded} assume !(main_~xtmp~0 >= main_~y~0); {1422#unseeded} is VALID [2020-07-29 01:30:22,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {1422#unseeded} main_~y~0 := main_~xtmp~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {1422#unseeded} main_~x~0 := main_~tmp~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {1422#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(0 == main_~y~0); {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(main_~y~0 < 0); {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume main_~xtmp~0 > 0; {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,216 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {1447#(and (>= oldRank0 (+ (* 2 ULTIMATE.start_main_~xtmp~0) 1)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1449#(and (or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~xtmp~0) 1)) (>= oldRank0 0))) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:30:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:22,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:22,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:22,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,229 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 [2020-07-29 01:30:22,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:30:22,270 INFO L75 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. [2020-07-29 01:30:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:22,271 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:22,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:22,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2020-07-29 01:30:22,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:22,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:22,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,275 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 37 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:22,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:30:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:30:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:30:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,285 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:30:22,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,286 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {1422#unseeded} 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; {1422#unseeded} is VALID [2020-07-29 01:30:22,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {1422#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {1422#unseeded} assume !(0 == main_~y~0); {1422#unseeded} is VALID [2020-07-29 01:30:22,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {1422#unseeded} assume !(main_~y~0 < 0); {1422#unseeded} is VALID [2020-07-29 01:30:22,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {1422#unseeded} assume main_~xtmp~0 > 0; {1422#unseeded} is VALID [2020-07-29 01:30:22,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {1422#unseeded} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {1422#unseeded} assume !(main_~xtmp~0 >= main_~y~0); {1422#unseeded} is VALID [2020-07-29 01:30:22,344 INFO L280 TraceCheckUtils]: 7: Hoare triple {1422#unseeded} main_~y~0 := main_~xtmp~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {1422#unseeded} main_~x~0 := main_~tmp~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {1422#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(0 == main_~y~0); {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(main_~y~0 < 0); {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume main_~xtmp~0 > 0; {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,351 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {1447#(and (>= oldRank0 (+ (* 2 ULTIMATE.start_main_~xtmp~0) 1)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1449#(and (or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~xtmp~0) 1)) (>= oldRank0 0))) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:30:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:22,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:22,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:22,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,363 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 [2020-07-29 01:30:22,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:30:22,401 INFO L75 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. [2020-07-29 01:30:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:22,402 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:22,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:22,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2020-07-29 01:30:22,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,404 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:22,404 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,404 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:22,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 37 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:22,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:30:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:30:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:30:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,411 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:30:22,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,412 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {1422#unseeded} 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; {1422#unseeded} is VALID [2020-07-29 01:30:22,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {1422#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {1422#unseeded} assume !(0 == main_~y~0); {1422#unseeded} is VALID [2020-07-29 01:30:22,466 INFO L280 TraceCheckUtils]: 3: Hoare triple {1422#unseeded} assume !(main_~y~0 < 0); {1422#unseeded} is VALID [2020-07-29 01:30:22,466 INFO L280 TraceCheckUtils]: 4: Hoare triple {1422#unseeded} assume main_~xtmp~0 > 0; {1422#unseeded} is VALID [2020-07-29 01:30:22,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {1422#unseeded} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,467 INFO L280 TraceCheckUtils]: 6: Hoare triple {1422#unseeded} assume !(main_~xtmp~0 >= main_~y~0); {1422#unseeded} is VALID [2020-07-29 01:30:22,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {1422#unseeded} main_~y~0 := main_~xtmp~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,475 INFO L280 TraceCheckUtils]: 8: Hoare triple {1422#unseeded} main_~x~0 := main_~tmp~0; {1422#unseeded} is VALID [2020-07-29 01:30:22,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {1422#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(0 == main_~y~0); {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume !(main_~y~0 < 0); {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} assume main_~xtmp~0 > 0; {1446#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:30:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,480 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {1447#(and (>= oldRank0 (+ (* 2 ULTIMATE.start_main_~xtmp~0) 1)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {1449#(and (or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~xtmp~0) 1)) (>= oldRank0 0))) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:30:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:22,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:22,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,492 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 [2020-07-29 01:30:22,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:30:22,552 INFO L75 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. [2020-07-29 01:30:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:22,553 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:22,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:22,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2020-07-29 01:30:22,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:22,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:22,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:22,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:22,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:22,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 39 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:22,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:22,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:22,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:22,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:30:22,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:30:22,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:30:22,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:22,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:22,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 39 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:22,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,561 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:30:22,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:30:22,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:30:22,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:30:22,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:22,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:22,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2020-07-29 01:30:22,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:30:22,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:30:22,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:30:22,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:22,563 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:22,563 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:22,564 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:22,564 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:30:22,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:30:22,564 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:22,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:22,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:30:22 BoogieIcfgContainer [2020-07-29 01:30:22,571 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:30:22,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:30:22,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:30:22,571 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:30:22,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:58" (3/4) ... [2020-07-29 01:30:22,575 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:30:22,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:30:22,577 INFO L168 Benchmark]: Toolchain (without parser) took 25255.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.5 MB). Free memory was 957.5 MB in the beginning and 973.9 MB in the end (delta: -16.4 MB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:22,578 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:22,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.12 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:22,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:22,580 INFO L168 Benchmark]: Boogie Preprocessor took 78.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:22,580 INFO L168 Benchmark]: RCFGBuilder took 377.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:22,581 INFO L168 Benchmark]: BuchiAutomizer took 24519.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 973.9 MB in the end (delta: 90.2 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:22,582 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.3 GB. Free memory is still 973.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:22,585 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.12 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 377.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24519.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 973.9 MB in the end (delta: 90.2 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.3 GB. Free memory is still 973.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 xtmp 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 * 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 24.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 22.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.1s 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, 114 SDslu, 16 SDs, 0 SdLazy, 185 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax148 hnf93 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp93 dnf100 smp100 tf103 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 17.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...