./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/GCD4.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/GCD4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e1a6e72adfb4c8fee6c8faa90b8bdc807e2f6147 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:29:57,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:57,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:57,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:57,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:57,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:57,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:57,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:57,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:57,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:57,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:57,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:57,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:57,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:57,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:57,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:57,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:57,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:57,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:57,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:57,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:57,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:57,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:57,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:57,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:57,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:57,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:57,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:57,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:57,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:57,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:57,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:57,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:57,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:57,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:57,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:57,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:57,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:57,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:57,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:57,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:57,306 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:57,340 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:57,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:57,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:57,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:57,342 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:57,343 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:57,343 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:57,343 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:57,343 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:57,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:57,344 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:57,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:57,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:57,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:57,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:57,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:57,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:57,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:57,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:57,347 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:57,347 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:57,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:57,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:57,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:57,348 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:57,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:57,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:57,348 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:57,349 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:57,350 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:57,350 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 -> e1a6e72adfb4c8fee6c8faa90b8bdc807e2f6147 [2020-07-29 01:29:57,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:57,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:57,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:57,680 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:57,680 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:57,681 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/GCD4.c [2020-07-29 01:29:57,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15f6de34/82a425187bc84eaaa0a18984f83c9253/FLAG2363601bf [2020-07-29 01:29:58,159 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:58,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/GCD4.c [2020-07-29 01:29:58,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15f6de34/82a425187bc84eaaa0a18984f83c9253/FLAG2363601bf [2020-07-29 01:29:58,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15f6de34/82a425187bc84eaaa0a18984f83c9253 [2020-07-29 01:29:58,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:58,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:58,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:58,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:58,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:58,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:58" (1/1) ... [2020-07-29 01:29:58,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7544ab95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:58, skipping insertion in model container [2020-07-29 01:29:58,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:58" (1/1) ... [2020-07-29 01:29:58,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:58,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:58,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:58,765 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:58,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:58,796 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:58,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:58 WrapperNode [2020-07-29 01:29:58,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:58,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:58,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:58,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:58,806 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:58" (1/1) ... [2020-07-29 01:29:58,811 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:58" (1/1) ... [2020-07-29 01:29:58,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:58,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:58,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:58,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:58,898 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:58" (1/1) ... [2020-07-29 01:29:58,899 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:58" (1/1) ... [2020-07-29 01:29:58,899 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:58" (1/1) ... [2020-07-29 01:29:58,899 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:58" (1/1) ... [2020-07-29 01:29:58,902 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:58" (1/1) ... [2020-07-29 01:29:58,907 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:58" (1/1) ... [2020-07-29 01:29:58,908 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:58" (1/1) ... [2020-07-29 01:29:58,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:58,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:58,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:58,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:58,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:58" (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:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:58,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:59,165 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:59,166 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:29:59,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:59 BoogieIcfgContainer [2020-07-29 01:29:59,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:59,171 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:59,171 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:59,175 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:59,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:59,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:58" (1/3) ... [2020-07-29 01:29:59,178 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f79cfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:59, skipping insertion in model container [2020-07-29 01:29:59,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:59,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:58" (2/3) ... [2020-07-29 01:29:59,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f79cfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:59, skipping insertion in model container [2020-07-29 01:29:59,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:59,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:59" (3/3) ... [2020-07-29 01:29:59,181 INFO L371 chiAutomizerObserver]: Analyzing ICFG GCD4.c [2020-07-29 01:29:59,266 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:59,266 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:59,267 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:59,267 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:59,267 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:59,267 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:59,267 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:59,268 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:59,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:29:59,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:59,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:59,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:59,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:59,358 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:59,358 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:59,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:29:59,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:59,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:59,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:59,361 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:59,361 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:59,369 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L13-2true [2020-07-29 01:29:59,369 INFO L796 eck$LassoCheckResult]: Loop: 6#L13-2true assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 3#L17-2true assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 9#L17-3true main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 6#L13-2true [2020-07-29 01:29:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:29:59,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:59,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883337674] [2020-07-29 01:29:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:59,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:59,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:59,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:29:59,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:59,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788925926] [2020-07-29 01:29:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:59,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:59,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:59,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2020-07-29 01:29:59,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:59,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515658190] [2020-07-29 01:29:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:59,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:59,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:59,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:59,655 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:59,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:59,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:59,657 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:59,657 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:59,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:59,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:59,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:59,658 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration1_Loop [2020-07-29 01:29:59,658 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:59,658 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:59,702 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,730 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,737 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,909 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:59,910 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,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:59,926 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 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) [2020-07-29 01:29:59,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 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,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:01,915 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:01,918 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:01,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:01,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:01,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:01,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:01,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:01,920 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:01,920 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:01,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration1_Loop [2020-07-29 01:30:01,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:01,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:01,936 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:01,944 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:01,969 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:02,128 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:02,134 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:02,142 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:02,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:02,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:02,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:02,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:02,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:02,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:02,163 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 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:30:02,202 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:02,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:02,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:02,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:02,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:02,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:02,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:02,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:02,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:02,229 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:02,229 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:02,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:02,243 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:02,244 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:02,245 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:02,285 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:02,289 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 !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);" "main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0;" [2020-07-29 01:30:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:02,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:02,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:02,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#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; {18#unseeded} is VALID [2020-07-29 01:30:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:02,356 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:02,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:02,480 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:30:02,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= 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; {36#(and (<= 1 ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:02,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (<= 1 ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {40#(and (<= 1 ULTIMATE.start_main_~xtmp~0) (<= (+ ULTIMATE.start_main_~xtmp~0 1) oldRank0))} is VALID [2020-07-29 01:30:02,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#(and (<= 1 ULTIMATE.start_main_~xtmp~0) (<= (+ ULTIMATE.start_main_~xtmp~0 1) oldRank0))} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {31#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:30:02,551 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:02,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:02,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:02,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,598 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:02,600 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2020-07-29 01:30:02,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 33 states and 49 transitions. Complement of second has 10 states. [2020-07-29 01:30:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:02,777 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:02,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:02,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:02,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:02,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:02,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:02,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:02,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:02,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:02,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2020-07-29 01:30:02,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:02,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:02,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:02,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:02,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:02,792 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:02,793 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:02,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:02,796 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:02,797 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 49 transitions. cyclomatic complexity: 21 [2020-07-29 01:30:02,798 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:02,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:02,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:02,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:02,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:02,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:02,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:02,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:02,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:02,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:02,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:02,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:02,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:02,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:02,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:02,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:02,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:02,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:02,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:02,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:02,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:02,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:02,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:02,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:02,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:02,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:02,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:02,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:02,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:02,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:02,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 49 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:02,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,825 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-29 01:30:02,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:02,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:02,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:02,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:02,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 49 transitions. cyclomatic complexity: 21 [2020-07-29 01:30:02,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:02,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 11 states and 16 transitions. [2020-07-29 01:30:02,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:30:02,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:30:02,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-07-29 01:30:02,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:02,847 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:30:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-07-29 01:30:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:30:02,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:02,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 16 transitions. Second operand 10 states. [2020-07-29 01:30:02,879 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 16 transitions. Second operand 10 states. [2020-07-29 01:30:02,884 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 10 states. [2020-07-29 01:30:02,890 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:02,896 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:30:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:30:02,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:02,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:02,899 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 16 transitions. [2020-07-29 01:30:02,899 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 16 transitions. [2020-07-29 01:30:02,900 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:02,912 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:30:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:30:02,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:02,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:02,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:02,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:30:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-29 01:30:02,917 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:30:02,918 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:30:02,918 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:30:02,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2020-07-29 01:30:02,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:02,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:02,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:02,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:30:02,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:30:02,922 INFO L794 eck$LassoCheckResult]: Stem: 96#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; 97#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 92#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 93#L17-2 [2020-07-29 01:30:02,922 INFO L796 eck$LassoCheckResult]: Loop: 93#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 93#L17-2 [2020-07-29 01:30:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:30:02,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642633086] [2020-07-29 01:30:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:30:02,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245710855] [2020-07-29 01:30:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2020-07-29 01:30:03,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:03,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316207068] [2020-07-29 01:30:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:03,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:03,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:03,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:03,079 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:03,079 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:03,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:03,080 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:03,080 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:03,080 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:03,081 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:03,081 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration2_Loop [2020-07-29 01:30:03,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:03,081 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:03,091 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,100 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,106 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,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:03,234 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:03,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:03,256 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:03,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,307 INFO L160 nArgumentSynthesizer]: Using integer mode. 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,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:03,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:03,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,430 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:03,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:03,495 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,579 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:03,581 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:03,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:03,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:03,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:03,581 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:03,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:03,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:03,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration2_Loop [2020-07-29 01:30:03,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:03,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:03,597 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,602 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,608 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,703 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:03,706 INFO L489 LassoAnalysis]: Using template 'affine'. 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:03,711 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,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:03,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:03,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:03,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:03,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:03,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:03,727 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 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:03,770 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,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:03,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:03,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:03,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:03,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:03,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:03,792 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:03,842 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,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:03,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:03,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:03,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:03,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:03,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:03,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:03,860 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:30:03,860 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 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:03,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:03,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:03,873 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:03,873 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,918 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:03,925 INFO L393 LassoCheck]: Loop: "assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0;" [2020-07-29 01:30:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:03,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {160#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; {160#unseeded} is VALID [2020-07-29 01:30:03,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {160#unseeded} is VALID [2020-07-29 01:30:03,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#unseeded} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {160#unseeded} is VALID [2020-07-29 01:30:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,963 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:03,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:03,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {173#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:03,969 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,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:03,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:03,975 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:03,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 8 Second operand 2 states. [2020-07-29 01:30:04,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 8. Second operand 2 states. Result 15 states and 22 transitions. Complement of second has 5 states. [2020-07-29 01:30:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:04,010 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:04,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:04,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:04,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:04,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2020-07-29 01:30:04,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:04,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,018 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 15 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:04,019 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:04,019 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:04,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:04,020 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:04,020 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 22 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:04,021 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:04,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,042 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:30:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:30:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:04,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:04,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2020-07-29 01:30:04,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:30:04,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:30:04,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2020-07-29 01:30:04,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:04,055 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:30:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2020-07-29 01:30:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-07-29 01:30:04,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:04,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 19 transitions. Second operand 11 states. [2020-07-29 01:30:04,059 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 19 transitions. Second operand 11 states. [2020-07-29 01:30:04,059 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 11 states. [2020-07-29 01:30:04,059 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:04,061 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:30:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:30:04,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:04,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:04,063 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 13 states and 19 transitions. [2020-07-29 01:30:04,063 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 13 states and 19 transitions. [2020-07-29 01:30:04,063 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:04,067 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:30:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:30:04,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:04,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:04,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:04,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:30:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-29 01:30:04,077 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-29 01:30:04,077 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-29 01:30:04,078 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:30:04,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2020-07-29 01:30:04,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:04,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:30:04,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:04,080 INFO L794 eck$LassoCheckResult]: Stem: 209#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; 210#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 213#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 216#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 207#L17-3 [2020-07-29 01:30:04,081 INFO L796 eck$LassoCheckResult]: Loop: 207#L17-3 main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 211#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 206#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 207#L17-3 [2020-07-29 01:30:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 963528, now seen corresponding path program 1 times [2020-07-29 01:30:04,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42552805] [2020-07-29 01:30:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 52221, now seen corresponding path program 2 times [2020-07-29 01:30:04,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359988584] [2020-07-29 01:30:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285994, now seen corresponding path program 1 times [2020-07-29 01:30:04,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151265480] [2020-07-29 01:30:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {280#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; {280#true} is VALID [2020-07-29 01:30:04,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {280#true} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {282#(and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:30:04,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#(and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {282#(and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:30:04,364 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#(and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {283#(<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0)} is VALID [2020-07-29 01:30:04,365 INFO L280 TraceCheckUtils]: 4: Hoare triple {283#(<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0)} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {284#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:04,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {284#(<= (+ 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; {285#(and (<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:30:04,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {285#(and (<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {281#false} is VALID [2020-07-29 01:30:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:04,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151265480] [2020-07-29 01:30:04,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565850604] [2020-07-29 01:30:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:30:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:04,450 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:30:04,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {280#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; {280#true} is VALID [2020-07-29 01:30:04,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {280#true} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {292#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:30:04,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {292#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {292#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:30:04,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {292#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~tmp~0) (< 0 ULTIMATE.start_main_~y~0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {299#(and (<= 1 ULTIMATE.start_main_~tmp~0) (<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0))} is VALID [2020-07-29 01:30:04,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {299#(and (<= 1 ULTIMATE.start_main_~tmp~0) (<= (+ ULTIMATE.start_main_~xtmp~0 1) ULTIMATE.start_main_~tmp~0))} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {303#(and (<= 1 ULTIMATE.start_main_~x~0) (<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:04,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(and (<= 1 ULTIMATE.start_main_~x~0) (<= (+ 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; {285#(and (<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:30:04,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {285#(and (<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {281#false} is VALID [2020-07-29 01:30:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:04,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:30:04,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-29 01:30:04,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992358581] [2020-07-29 01:30:04,666 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:04,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:04,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:04,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:04,666 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:04,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:04,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:04,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration3_Loop [2020-07-29 01:30:04,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:04,668 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:04,677 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,691 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,696 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,822 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:04,822 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:04,838 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:04,905 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,682 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:08,685 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:08,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:08,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:08,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:08,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:08,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:08,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:08,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration3_Loop [2020-07-29 01:30:08,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:08,686 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:08,702 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:08,708 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:08,723 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:08,849 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:08,849 INFO L489 LassoAnalysis]: Using template 'affine'. 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:08,853 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:08,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:08,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:08,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:08,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:08,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:08,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:08,867 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 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:08,900 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:08,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:08,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:08,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:08,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:08,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:08,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:08,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:08,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:08,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:08,921 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:08,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:08,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:08,927 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:08,927 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,954 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:08,957 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 !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);" [2020-07-29 01:30:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:08,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#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; {307#unseeded} is VALID [2020-07-29 01:30:08,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {307#unseeded} is VALID [2020-07-29 01:30:08,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#unseeded} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {307#unseeded} is VALID [2020-07-29 01:30:08,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {307#unseeded} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {307#unseeded} is VALID [2020-07-29 01:30:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,995 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:09,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {310#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {334#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:09,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#(<= 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; {338#(and (<= 1 ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:09,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {338#(and (<= 1 ULTIMATE.start_main_~xtmp~0) (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {320#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:09,079 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:09,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:09,089 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:09,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,090 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:09,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 17 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:30:09,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 17 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 33 states and 52 transitions. Complement of second has 10 states. [2020-07-29 01:30:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:09,176 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:09,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:09,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:09,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:09,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 52 transitions. [2020-07-29 01:30:09,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:09,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,179 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 17 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:09,180 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:09,180 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:09,181 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:09,181 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:09,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 52 transitions. cyclomatic complexity: 28 [2020-07-29 01:30:09,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:09,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:09,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:09,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:09,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:09,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:09,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:09,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:09,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:09,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:09,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:09,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:09,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:09,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:09,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:09,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:09,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:09,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:09,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:09,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:09,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:09,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:09,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:30:09,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:30:09,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:30:09,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:09,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:09,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:09,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:09,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:09,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:09,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:30:09,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:30:09,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:30:09,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:30:09,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:30:09,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:30:09,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:09,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:09,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 52 transitions. cyclomatic complexity: 28 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:09,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,203 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-29 01:30:09,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:09,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:09,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:30:09,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 52 transitions. cyclomatic complexity: 28 [2020-07-29 01:30:09,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:09,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 35 transitions. [2020-07-29 01:30:09,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:30:09,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:30:09,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2020-07-29 01:30:09,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:09,209 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-07-29 01:30:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2020-07-29 01:30:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-29 01:30:09,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:09,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 35 transitions. Second operand 22 states. [2020-07-29 01:30:09,212 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 35 transitions. Second operand 22 states. [2020-07-29 01:30:09,212 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 22 states. [2020-07-29 01:30:09,212 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:09,214 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-07-29 01:30:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:30:09,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:09,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:09,215 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states and 35 transitions. [2020-07-29 01:30:09,215 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states and 35 transitions. [2020-07-29 01:30:09,215 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:09,217 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-07-29 01:30:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:30:09,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:09,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:09,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:09,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:30:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2020-07-29 01:30:09,220 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-29 01:30:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:30:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:30:09,223 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 9 states. [2020-07-29 01:30:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:09,452 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 01:30:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:30:09,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:30:09,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:09,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-07-29 01:30:09,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:30:09,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 26 transitions. [2020-07-29 01:30:09,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:30:09,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:30:09,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-07-29 01:30:09,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:09,475 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:30:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-07-29 01:30:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2020-07-29 01:30:09,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:09,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand 12 states. [2020-07-29 01:30:09,477 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand 12 states. [2020-07-29 01:30:09,478 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 12 states. [2020-07-29 01:30:09,478 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:09,479 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:30:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:30:09,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:09,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:09,480 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 19 states and 26 transitions. [2020-07-29 01:30:09,480 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 19 states and 26 transitions. [2020-07-29 01:30:09,481 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:09,482 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:30:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:30:09,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:09,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:09,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:09,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:30:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:30:09,485 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:30:09,485 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:30:09,485 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:30:09,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:30:09,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:09,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:30:09,487 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:30:09,487 INFO L794 eck$LassoCheckResult]: Stem: 544#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; 545#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 548#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 547#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 543#L17-3 [2020-07-29 01:30:09,487 INFO L796 eck$LassoCheckResult]: Loop: 543#L17-3 main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 546#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 540#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 541#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 543#L17-3 [2020-07-29 01:30:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash 963528, now seen corresponding path program 2 times [2020-07-29 01:30:09,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:09,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416983487] [2020-07-29 01:30:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1618930, now seen corresponding path program 1 times [2020-07-29 01:30:09,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:09,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014098144] [2020-07-29 01:30:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash 780807225, now seen corresponding path program 2 times [2020-07-29 01:30:09,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:09,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444136532] [2020-07-29 01:30:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:09,592 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:09,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:09,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:09,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:09,593 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:09,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:09,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:09,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration4_Loop [2020-07-29 01:30:09,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:09,594 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:09,605 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,610 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,614 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,763 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:09,763 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:09,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:09,772 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:09,772 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:09,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:09,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:09,800 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:09,825 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:09,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:12,362 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:12,367 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:12,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:12,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:12,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:12,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:12,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:12,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:12,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration4_Loop [2020-07-29 01:30:12,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:12,368 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:12,376 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:12,393 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:12,404 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:12,521 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:12,521 INFO L489 LassoAnalysis]: Using template 'affine'. 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:12,526 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:12,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:12,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:12,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:12,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:12,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:12,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:12,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:12,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:12,543 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:12,543 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:12,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:12,546 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:12,546 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:12,546 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,567 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:12,569 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 !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0;" "assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);" [2020-07-29 01:30:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#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; {637#unseeded} is VALID [2020-07-29 01:30:12,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {637#unseeded} is VALID [2020-07-29 01:30:12,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#unseeded} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {637#unseeded} is VALID [2020-07-29 01:30:12,604 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#unseeded} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {637#unseeded} is VALID [2020-07-29 01:30:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {640#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {664#(<= ULTIMATE.start_main_~y~0 oldRank0)} is VALID [2020-07-29 01:30:12,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {664#(<= 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; {668#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:12,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {668#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:30:12,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {668#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {650#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:12,682 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:12,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:12,696 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:12,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,697 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:12,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:30:12,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2020-07-29 01:30:12,755 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:12,755 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:12,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:12,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:12,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:30:12,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:12,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:12,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:12,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:12,767 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:12,767 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 32 transitions. cyclomatic complexity: 14 [2020-07-29 01:30:12,767 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:12,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:12,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:12,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:12,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:12,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:12,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:30:12,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:30:12,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:30:12,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:30:12,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:30:12,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:30:12,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:12,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:12,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:12,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:12,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:12,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:12,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:12,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,788 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-07-29 01:30:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:30:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:30:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. cyclomatic complexity: 14 [2020-07-29 01:30:12,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:12,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 27 transitions. [2020-07-29 01:30:12,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:30:12,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:30:12,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2020-07-29 01:30:12,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:12,800 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-29 01:30:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2020-07-29 01:30:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2020-07-29 01:30:12,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:12,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 27 transitions. Second operand 14 states. [2020-07-29 01:30:12,808 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 27 transitions. Second operand 14 states. [2020-07-29 01:30:12,808 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 14 states. [2020-07-29 01:30:12,808 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:12,820 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2020-07-29 01:30:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2020-07-29 01:30:12,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:12,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:12,821 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 19 states and 27 transitions. [2020-07-29 01:30:12,821 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 19 states and 27 transitions. [2020-07-29 01:30:12,822 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:12,824 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2020-07-29 01:30:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2020-07-29 01:30:12,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:12,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:12,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:12,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:30:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-07-29 01:30:12,826 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-29 01:30:12,826 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-29 01:30:12,826 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:30:12,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:30:12,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:12,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:30:12,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:30:12,828 INFO L794 eck$LassoCheckResult]: Stem: 711#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; 712#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 721#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 718#L17-2 assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); 717#L17-3 main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; 713#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 708#L17-2 [2020-07-29 01:30:12,829 INFO L796 eck$LassoCheckResult]: Loop: 708#L17-2 assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 708#L17-2 [2020-07-29 01:30:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 3 times [2020-07-29 01:30:12,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:12,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134710466] [2020-07-29 01:30:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:12,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:12,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:12,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:30:12,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:12,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36060412] [2020-07-29 01:30:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:12,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:12,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:12,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 4 times [2020-07-29 01:30:12,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:12,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823772243] [2020-07-29 01:30:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:12,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:12,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:12,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:12,888 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:12,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:12,889 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:12,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:12,889 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:12,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:12,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:12,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration5_Loop [2020-07-29 01:30:12,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:12,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:12,897 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:12,902 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:12,907 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:13,014 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:13,014 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:13,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:13,022 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:13,022 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:13,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:13,046 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:13,049 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:13,049 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:13,073 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:13,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:13,194 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:13,195 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:13,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:13,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:13,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:13,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:13,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:13,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:13,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: GCD4.c_Iteration5_Loop [2020-07-29 01:30:13,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:13,197 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:13,206 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:13,242 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:13,264 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:13,346 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:13,347 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:13,349 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:13,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:13,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:13,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:13,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:13,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:13,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:13,357 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:13,379 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:13,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:13,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:13,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:13,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:13,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:13,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:13,388 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:13,413 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:13,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:13,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:13,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:13,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:13,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:13,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:13,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:13,418 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:13,432 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:30:13,432 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 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:13,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:13,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:13,435 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:13,435 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:13,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:13,459 INFO L393 LassoCheck]: Loop: "assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0;" [2020-07-29 01:30:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#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; {806#unseeded} is VALID [2020-07-29 01:30:13,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {806#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {806#unseeded} is VALID [2020-07-29 01:30:13,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {806#unseeded} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {806#unseeded} is VALID [2020-07-29 01:30:13,496 INFO L280 TraceCheckUtils]: 3: Hoare triple {806#unseeded} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {806#unseeded} is VALID [2020-07-29 01:30:13,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {806#unseeded} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {806#unseeded} is VALID [2020-07-29 01:30:13,499 INFO L280 TraceCheckUtils]: 5: Hoare triple {806#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {806#unseeded} is VALID [2020-07-29 01:30:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,504 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {809#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {819#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:13,509 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:13,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:13,520 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:13,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,521 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:13,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2020-07-29 01:30:13,551 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9. Second operand 2 states. Result 20 states and 28 transitions. Complement of second has 5 states. [2020-07-29 01:30:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:13,552 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:13,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:13,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-07-29 01:30:13,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:13,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:13,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:13,557 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:30:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:30:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:30:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,564 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,565 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:13,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#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; {806#unseeded} is VALID [2020-07-29 01:30:13,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {806#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {806#unseeded} is VALID [2020-07-29 01:30:13,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {806#unseeded} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {806#unseeded} is VALID [2020-07-29 01:30:13,603 INFO L280 TraceCheckUtils]: 3: Hoare triple {806#unseeded} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {806#unseeded} is VALID [2020-07-29 01:30:13,604 INFO L280 TraceCheckUtils]: 4: Hoare triple {806#unseeded} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {806#unseeded} is VALID [2020-07-29 01:30:13,611 INFO L280 TraceCheckUtils]: 5: Hoare triple {806#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {806#unseeded} is VALID [2020-07-29 01:30:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,615 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {809#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {819#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:13,619 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:13,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:13,625 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:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,626 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:13,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2020-07-29 01:30:13,649 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9. Second operand 2 states. Result 20 states and 28 transitions. Complement of second has 5 states. [2020-07-29 01:30:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:13,649 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:13,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:13,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-07-29 01:30:13,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,654 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:13,654 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:13,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,655 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:13,658 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:30:13,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:30:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:30:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,669 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:13,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,670 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#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; {806#unseeded} is VALID [2020-07-29 01:30:13,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {806#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {806#unseeded} is VALID [2020-07-29 01:30:13,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {806#unseeded} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {806#unseeded} is VALID [2020-07-29 01:30:13,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {806#unseeded} assume !(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0); {806#unseeded} is VALID [2020-07-29 01:30:13,699 INFO L280 TraceCheckUtils]: 4: Hoare triple {806#unseeded} main_~y~0 := main_~xtmp~0;main_~x~0 := main_~tmp~0; {806#unseeded} is VALID [2020-07-29 01:30:13,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {806#unseeded} assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; {806#unseeded} is VALID [2020-07-29 01:30:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,704 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {809#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 >= main_~y~0 && main_~y~0 > 0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; {819#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:13,709 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:13,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:13,714 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:13,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,714 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:13,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand 2 states. [2020-07-29 01:30:13,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 9. Second operand 2 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2020-07-29 01:30:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:13,741 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:13,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:13,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-07-29 01:30:13,743 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:13,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:13,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:13,744 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:13,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:13,744 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:13,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:13,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:13,745 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:30:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:30:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:30:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:30:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,752 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:30:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:13,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:13,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2020-07-29 01:30:13,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:30:13,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:30:13,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:30:13,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:13,755 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:13,755 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:13,755 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:13,755 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:30:13,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:30:13,756 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:13,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:13,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:30:13 BoogieIcfgContainer [2020-07-29 01:30:13,763 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:30:13,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:30:13,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:30:13,764 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:30:13,765 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:59" (3/4) ... [2020-07-29 01:30:13,769 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:30:13,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:30:13,773 INFO L168 Benchmark]: Toolchain (without parser) took 15216.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.5 MB). Free memory was 962.9 MB in the beginning and 1.2 GB in the end (delta: -237.0 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:13,773 INFO L168 Benchmark]: CDTParser took 0.17 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:13,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.56 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 950.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:13,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.51 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:13,775 INFO L168 Benchmark]: Boogie Preprocessor took 75.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:13,776 INFO L168 Benchmark]: RCFGBuilder took 260.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:13,777 INFO L168 Benchmark]: BuchiAutomizer took 14592.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.8 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:13,778 INFO L168 Benchmark]: Witness Printer took 5.58 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:13,782 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.17 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 238.56 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 950.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.51 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14592.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.8 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.58 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y and consists of 6 locations. One deterministic module has affine ranking function xtmp and consists of 3 locations. One deterministic module has affine ranking function xtmp and consists of 6 locations. One deterministic module has affine ranking function xtmp and consists of 4 locations. One nondeterministic module has affine ranking function xtmp and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 12.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 33 SDtfs, 58 SDslu, 9 SDs, 0 SdLazy, 100 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax165 hnf95 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf108 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...