./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1.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-crafted-lit/BradleyMannaSipma-CAV2005-Fig1.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 6c09c2a46ed7454ea61f3b2ddb99e3e2ba9fd4da ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:31,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:31,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:31,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:31,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:31,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:31,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:31,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:31,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:31,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:31,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:31,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:31,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:31,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:31,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:31,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:31,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:31,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:31,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:31,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:31,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:31,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:31,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:31,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:31,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:31,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:31,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:31,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:31,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:31,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:31,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:31,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:31,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:31,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:31,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:31,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:31,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:31,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:31,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:31,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:31,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:31,319 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:28:31,336 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:31,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:31,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:31,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:31,338 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:31,338 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:31,338 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:31,338 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:31,339 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:31,339 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:31,339 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:31,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:31,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:31,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:31,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:31,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:31,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:31,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:31,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:31,341 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:31,341 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:31,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:31,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:31,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:31,342 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:31,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:31,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:31,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:31,343 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:31,344 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:31,344 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 -> 6c09c2a46ed7454ea61f3b2ddb99e3e2ba9fd4da [2020-07-29 01:28:31,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:31,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:31,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:31,646 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:31,647 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:31,647 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1.c [2020-07-29 01:28:31,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c79bb2d/29bd0435121f46abb2e6626877556d88/FLAGaefb9afae [2020-07-29 01:28:32,124 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:32,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1.c [2020-07-29 01:28:32,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c79bb2d/29bd0435121f46abb2e6626877556d88/FLAGaefb9afae [2020-07-29 01:28:32,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c79bb2d/29bd0435121f46abb2e6626877556d88 [2020-07-29 01:28:32,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:32,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:32,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:32,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:32,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:32,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39164952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32, skipping insertion in model container [2020-07-29 01:28:32,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:32,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:32,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:32,831 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:32,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:32,866 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:32,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32 WrapperNode [2020-07-29 01:28:32,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:32,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:32,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:32,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:32,880 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:28:32" (1/1) ... [2020-07-29 01:28:32,886 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:28:32" (1/1) ... [2020-07-29 01:28:32,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:32,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:32,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:32,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:32,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:32,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:32,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:32,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:32,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (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:28:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:33,217 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:33,217 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:33,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:33 BoogieIcfgContainer [2020-07-29 01:28:33,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:33,221 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:33,221 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:33,225 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:33,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:33,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:32" (1/3) ... [2020-07-29 01:28:33,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c964c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:33, skipping insertion in model container [2020-07-29 01:28:33,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:33,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (2/3) ... [2020-07-29 01:28:33,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c964c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:33, skipping insertion in model container [2020-07-29 01:28:33,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:33,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:33" (3/3) ... [2020-07-29 01:28:33,229 INFO L371 chiAutomizerObserver]: Analyzing ICFG BradleyMannaSipma-CAV2005-Fig1.c [2020-07-29 01:28:33,281 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:33,281 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:33,282 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:33,282 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:33,282 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:33,282 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:33,282 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:33,282 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:33,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:33,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:33,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:33,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:33,327 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:33,327 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:33,327 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:33,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:33,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:33,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:33,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:33,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:33,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:33,339 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 7#L18true assume main_~y1~0 > 0 && main_~y2~0 > 0; 8#L20-2true [2020-07-29 01:28:33,339 INFO L796 eck$LassoCheckResult]: Loop: 8#L20-2true assume !!(main_~y1~0 != main_~y2~0); 10#L20true assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 8#L20-2true [2020-07-29 01:28:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2020-07-29 01:28:33,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:33,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949548914] [2020-07-29 01:28:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,440 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:33,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2020-07-29 01:28:33,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:33,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425743403] [2020-07-29 01:28:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2020-07-29 01:28:33,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:33,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275947877] [2020-07-29 01:28:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:33,612 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2020-07-29 01:28:33,717 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:33,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:33,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:33,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:33,719 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:33,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:33,720 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:33,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:33,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration1_Lasso [2020-07-29 01:28:33,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:33,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:33,754 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:28:33,766 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:28:33,792 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:28:33,800 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:28:33,805 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:28:33,810 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:28:34,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:34,057 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:28:34,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:34,066 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,074 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:34,074 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:34,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:34,119 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:34,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:34,325 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:34,327 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:34,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:34,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:34,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:34,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:34,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:34,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:34,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration1_Lasso [2020-07-29 01:28:34,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:34,329 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:34,341 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:28:34,356 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:28:34,362 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:28:34,367 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:28:34,371 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:28:34,375 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:28:34,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:34,551 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:28:34,556 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:28:34,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:34,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:34,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:34,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:34,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:34,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:34,620 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:28:34,620 INFO L444 ModelExtractionUtils]: 4 out of 10 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:28:34,629 INFO L435 nArgumentSynthesizer]: Simplifying 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:28:34,635 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:28:34,636 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:34,637 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0, ULTIMATE.start_main_~y1~0) = -1*ULTIMATE.start_main_~y2~0 + 1*ULTIMATE.start_main_~y1~0 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] [2020-07-29 01:28:34,680 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:28:34,687 INFO L393 LassoCheck]: Loop: "assume !!(main_~y1~0 != main_~y2~0);" "assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0;" [2020-07-29 01:28:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:28:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:34,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {18#unseeded} is VALID [2020-07-29 01:28:34,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {37#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,787 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:34,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume !!(main_~y1~0 != main_~y2~0); {38#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} is VALID [2020-07-29 01:28:34,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {40#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0))) unseeded))} is VALID [2020-07-29 01:28:34,803 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:28:34,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:34,830 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:28:34,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:34,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,841 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:28:34,843 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:28:34,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2020-07-29 01:28:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:34,963 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:34,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:34,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:34,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:34,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:34,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:34,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:34,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:34,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:34,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 01:28:34,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:34,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:34,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:34,984 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:34,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:34,988 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:34,988 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:34,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:34,992 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:34,993 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:34,994 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:34,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:34,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:34,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:34,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:34,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:34,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:34,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:34,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:34,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:34,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:34,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:35,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:35,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:35,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:35,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:35,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:35,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:35,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:35,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:35,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:35,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:35,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:35,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:35,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:35,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:35,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:35,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:35,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:35,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:35,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:35,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:35,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:35,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:35,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,022 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:28:35,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:35,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:35,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:35,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:35,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:35,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2020-07-29 01:28:35,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:35,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:28:35,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2020-07-29 01:28:35,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:35,062 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2020-07-29 01:28:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:28:35,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:35,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:35,092 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:35,095 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:35,099 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:35,102 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:28:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:35,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:35,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:35,104 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 11 transitions. [2020-07-29 01:28:35,104 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 11 transitions. [2020-07-29 01:28:35,105 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:35,106 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:28:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:35,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:35,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:35,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:35,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:28:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:28:35,110 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:35,110 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:35,110 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:35,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:35,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:35,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,112 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:28:35,112 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:35,112 INFO L794 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 90#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 91#L20-2 assume !!(main_~y1~0 != main_~y2~0); 95#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 92#L20-2 [2020-07-29 01:28:35,113 INFO L796 eck$LassoCheckResult]: Loop: 92#L20-2 assume !!(main_~y1~0 != main_~y2~0); 93#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 92#L20-2 [2020-07-29 01:28:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2020-07-29 01:28:35,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228458231] [2020-07-29 01:28:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2020-07-29 01:28:35,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727659651] [2020-07-29 01:28:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2020-07-29 01:28:35,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551296425] [2020-07-29 01:28:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,160 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,247 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:35,247 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:35,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:35,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:35,248 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:35,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:35,249 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:35,249 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration2_Lasso [2020-07-29 01:28:35,249 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:35,249 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:35,259 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:28:35,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:28:35,268 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:28:35,282 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:28:35,286 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:28:35,290 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:28:35,437 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:35,437 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) [2020-07-29 01:28:35,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:35,449 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,454 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:35,454 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:28:35,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:35,493 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:28:35,498 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:35,498 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:35,532 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:35,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:35,679 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:35,681 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:35,682 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:35,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:35,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:35,682 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:35,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,683 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:35,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:35,683 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration2_Lasso [2020-07-29 01:28:35,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:35,683 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:35,697 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:28:35,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:28:35,706 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:28:35,719 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:28:35,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:35,728 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:28:35,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:35,870 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) [2020-07-29 01:28:35,878 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 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:35,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:35,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:35,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:35,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:35,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:35,887 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) [2020-07-29 01:28:35,924 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 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:35,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:35,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:35,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:35,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:35,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:35,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:35,930 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,957 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:28:35,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:35,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:35,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:35,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:35,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:35,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:35,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:36,000 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:28:36,001 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:36,010 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:28:36,010 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:36,010 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y1~0) = 1*ULTIMATE.start_main_~y1~0 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] [2020-07-29 01:28:36,034 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:28:36,038 INFO L393 LassoCheck]: Loop: "assume !!(main_~y1~0 != main_~y2~0);" "assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0;" [2020-07-29 01:28:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:36,111 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {146#unseeded} is VALID [2020-07-29 01:28:36,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {146#unseeded} is VALID [2020-07-29 01:28:36,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {146#unseeded} assume !!(main_~y1~0 != main_~y2~0); {180#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} is VALID [2020-07-29 01:28:36,114 INFO L280 TraceCheckUtils]: 3: Hoare triple {180#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {165#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,118 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:36,125 INFO L280 TraceCheckUtils]: 0: Hoare triple {166#(and (>= oldRank0 ULTIMATE.start_main_~y1~0) (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0))} assume !!(main_~y1~0 != main_~y2~0); {166#(and (>= oldRank0 ULTIMATE.start_main_~y1~0) (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0))} is VALID [2020-07-29 01:28:36,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {166#(and (>= oldRank0 ULTIMATE.start_main_~y1~0) (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0))} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {168#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y1~0)) unseeded))} is VALID [2020-07-29 01:28:36,127 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:28:36,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:36,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:36,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,137 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:28:36,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:28:36,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 17 transitions. Complement of second has 6 states. [2020-07-29 01:28:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:36,192 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:36,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:36,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:36,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:36,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:36,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:36,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,210 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:36,211 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:36,211 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:36,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:36,212 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:36,212 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:36,212 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:36,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:36,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:36,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:36,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:36,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:36,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:36,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:36,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,244 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:28:36,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:36,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:36,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:36,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:36,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:28:36,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:28:36,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:28:36,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-07-29 01:28:36,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:36,253 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-07-29 01:28:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:28:36,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:36,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:36,255 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:36,256 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:36,256 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:36,257 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:28:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:36,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:36,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:36,258 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:28:36,258 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:28:36,259 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:36,261 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:28:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:36,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:36,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:36,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:36,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:28:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:28:36,266 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:36,266 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:36,266 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:36,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:36,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:36,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,268 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2020-07-29 01:28:36,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:36,268 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 210#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 216#L20-2 assume !!(main_~y1~0 != main_~y2~0); 215#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 217#L20-2 assume !!(main_~y1~0 != main_~y2~0); 218#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 211#L20-2 [2020-07-29 01:28:36,269 INFO L796 eck$LassoCheckResult]: Loop: 211#L20-2 assume !!(main_~y1~0 != main_~y2~0); 212#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 211#L20-2 [2020-07-29 01:28:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash 920231918, now seen corresponding path program 2 times [2020-07-29 01:28:36,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:36,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428092617] [2020-07-29 01:28:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2020-07-29 01:28:36,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:36,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109183965] [2020-07-29 01:28:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash -420389359, now seen corresponding path program 2 times [2020-07-29 01:28:36,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:36,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020066483] [2020-07-29 01:28:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,383 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:36,459 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:36,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:36,460 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:36,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:36,460 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:36,460 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:36,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:36,460 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration3_Lasso [2020-07-29 01:28:36,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:36,461 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:36,469 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:28:36,473 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:28:36,477 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:28:36,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,496 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:28:36,618 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:36,619 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:36,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,630 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,633 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,634 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:36,669 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,669 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:36,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,694 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:36,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:36,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,744 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:36,779 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:36,876 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:36,878 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:36,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:36,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:36,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:36,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:36,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:36,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:36,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration3_Lasso [2020-07-29 01:28:36,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:36,879 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:36,888 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:28:36,892 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:28:36,896 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:28:36,900 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:28:36,903 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:28:36,920 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:28:37,067 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:37,068 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,081 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:28:37,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:37,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:37,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:37,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,114 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:28:37,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:37,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:37,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:37,118 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:37,140 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 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:37,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:37,148 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:37,170 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:28:37,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:37,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,178 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 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:28:37,200 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:28:37,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:37,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:37,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:37,232 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:28:37,232 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 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:28:37,244 INFO L435 nArgumentSynthesizer]: Simplifying 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:28:37,253 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:28:37,253 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:37,253 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0, ULTIMATE.start_main_~y1~0) = -1*ULTIMATE.start_main_~y2~0 + 1*ULTIMATE.start_main_~y1~0 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] [2020-07-29 01:28:37,282 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:28:37,289 INFO L393 LassoCheck]: Loop: "assume !!(main_~y1~0 != main_~y2~0);" "assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0;" [2020-07-29 01:28:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {284#unseeded} is VALID [2020-07-29 01:28:37,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {284#unseeded} is VALID [2020-07-29 01:28:37,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {284#unseeded} assume !!(main_~y1~0 != main_~y2~0); {284#unseeded} is VALID [2020-07-29 01:28:37,354 INFO L280 TraceCheckUtils]: 3: Hoare triple {284#unseeded} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {284#unseeded} is VALID [2020-07-29 01:28:37,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {284#unseeded} assume !!(main_~y1~0 != main_~y2~0); {324#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} is VALID [2020-07-29 01:28:37,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {324#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {303#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,360 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume !!(main_~y1~0 != main_~y2~0); {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} is VALID [2020-07-29 01:28:37,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {306#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0))) unseeded))} is VALID [2020-07-29 01:28:37,369 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:28:37,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:37,377 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:28:37,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:28:37,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:28:37,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 14 states and 21 transitions. Complement of second has 6 states. [2020-07-29 01:28:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:37,433 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:37,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:37,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:28:37,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,436 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:37,437 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:37,437 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:37,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:37,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,451 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:28:37,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,452 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:37,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {284#unseeded} is VALID [2020-07-29 01:28:37,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {284#unseeded} is VALID [2020-07-29 01:28:37,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {284#unseeded} assume !!(main_~y1~0 != main_~y2~0); {284#unseeded} is VALID [2020-07-29 01:28:37,522 INFO L280 TraceCheckUtils]: 3: Hoare triple {284#unseeded} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {284#unseeded} is VALID [2020-07-29 01:28:37,522 INFO L280 TraceCheckUtils]: 4: Hoare triple {284#unseeded} assume !!(main_~y1~0 != main_~y2~0); {372#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} is VALID [2020-07-29 01:28:37,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {372#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {303#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,527 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume !!(main_~y1~0 != main_~y2~0); {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} is VALID [2020-07-29 01:28:37,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {306#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0))) unseeded))} is VALID [2020-07-29 01:28:37,536 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:28:37,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:37,545 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:28:37,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,546 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:28:37,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:28:37,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 14 states and 21 transitions. Complement of second has 6 states. [2020-07-29 01:28:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:37,609 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:37,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:37,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:28:37,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:37,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:37,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:37,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,613 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,613 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:37,614 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:37,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,627 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:28:37,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,628 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {284#unseeded} is VALID [2020-07-29 01:28:37,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {284#unseeded} is VALID [2020-07-29 01:28:37,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {284#unseeded} assume !!(main_~y1~0 != main_~y2~0); {284#unseeded} is VALID [2020-07-29 01:28:37,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {284#unseeded} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {284#unseeded} is VALID [2020-07-29 01:28:37,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {284#unseeded} assume !!(main_~y1~0 != main_~y2~0); {420#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} is VALID [2020-07-29 01:28:37,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#(and unseeded (not (= ULTIMATE.start_main_~y1~0 ULTIMATE.start_main_~y2~0)))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {303#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,686 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume !!(main_~y1~0 != main_~y2~0); {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} is VALID [2020-07-29 01:28:37,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0)))} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {306#(and (>= (+ ULTIMATE.start_main_~y2~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y2~0) ULTIMATE.start_main_~y1~0))) unseeded))} is VALID [2020-07-29 01:28:37,695 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:28:37,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:37,703 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:28:37,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,704 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:28:37,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:28:37,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 16 states and 24 transitions. Complement of second has 5 states. [2020-07-29 01:28:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:37,760 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:37,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:37,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2020-07-29 01:28:37,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,763 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:37,763 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:37,763 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:37,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:37,764 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 24 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:37,765 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:37,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:37,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:37,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:37,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,777 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-07-29 01:28:37,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:37,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:37,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:37,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:37,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2020-07-29 01:28:37,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:37,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:28:37,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2020-07-29 01:28:37,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:37,783 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-29 01:28:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2020-07-29 01:28:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2020-07-29 01:28:37,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:37,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 20 transitions. Second operand 6 states. [2020-07-29 01:28:37,785 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 20 transitions. Second operand 6 states. [2020-07-29 01:28:37,785 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 6 states. [2020-07-29 01:28:37,786 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:37,787 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-07-29 01:28:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:28:37,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,788 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 14 states and 20 transitions. [2020-07-29 01:28:37,788 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 14 states and 20 transitions. [2020-07-29 01:28:37,788 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:37,790 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-07-29 01:28:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:28:37,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:37,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-29 01:28:37,792 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:28:37,792 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:28:37,793 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:37,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-29 01:28:37,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:37,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:37,794 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 453#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 454#L20-2 [2020-07-29 01:28:37,794 INFO L796 eck$LassoCheckResult]: Loop: 454#L20-2 assume !!(main_~y1~0 != main_~y2~0); 455#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 454#L20-2 [2020-07-29 01:28:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 2 times [2020-07-29 01:28:37,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447139764] [2020-07-29 01:28:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1382, now seen corresponding path program 1 times [2020-07-29 01:28:37,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678203878] [2020-07-29 01:28:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,814 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 3 times [2020-07-29 01:28:37,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001426289] [2020-07-29 01:28:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,865 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:37,866 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:37,866 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:37,866 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:37,866 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:37,866 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,866 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:37,866 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:37,867 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration4_Lasso [2020-07-29 01:28:37,867 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:37,867 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:37,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,881 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:28:37,885 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:28:37,889 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:28:37,892 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:28:37,905 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:28:38,051 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:38,051 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) [2020-07-29 01:28:38,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,061 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:38,064 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:38,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:38,088 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:38,118 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:38,118 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 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:28:38,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:38,143 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:38,143 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:38,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,166 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:28:38,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:38,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:38,328 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:38,330 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:38,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:38,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:38,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:38,330 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:38,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:38,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:38,330 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration4_Lasso [2020-07-29 01:28:38,330 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:38,330 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:38,339 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:28:38,349 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:28:38,352 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:28:38,355 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:28:38,359 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:28:38,369 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:28:38,508 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:38,508 INFO L489 LassoAnalysis]: Using template 'affine'. 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:28:38,511 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:28:38,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:38,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:38,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:38,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,537 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:28:38,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:38,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:38,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:38,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,562 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:28:38,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:38,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:38,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:38,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,592 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:28:38,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:38,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:38,604 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,632 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:28:38,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:38,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:38,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:38,660 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:38,661 INFO L444 ModelExtractionUtils]: 4 out of 10 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:38,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,667 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:28:38,667 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:38,668 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_~y2~0) = -1*ULTIMATE.start_main_~y1~0 + 1*ULTIMATE.start_main_~y2~0 Supporting invariants [1*ULTIMATE.start_main_~y1~0 - 1 >= 0] [2020-07-29 01:28:38,702 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:28:38,706 INFO L393 LassoCheck]: Loop: "assume !!(main_~y1~0 != main_~y2~0);" "assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0;" [2020-07-29 01:28:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:28:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:38,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {521#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {521#unseeded} is VALID [2020-07-29 01:28:38,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {540#(and unseeded (>= (+ ULTIMATE.start_main_~y1~0 (- 1)) 0))} is VALID [2020-07-29 01:28:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,745 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:38,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y1~0) ULTIMATE.start_main_~y2~0)) (>= (+ ULTIMATE.start_main_~y1~0 (- 1)) 0))} assume !!(main_~y1~0 != main_~y2~0); {541#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y1~0) ULTIMATE.start_main_~y2~0)) (>= (+ ULTIMATE.start_main_~y1~0 (- 1)) 0))} is VALID [2020-07-29 01:28:38,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y1~0) ULTIMATE.start_main_~y2~0)) (>= (+ ULTIMATE.start_main_~y1~0 (- 1)) 0))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {543#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y1~0) ULTIMATE.start_main_~y2~0)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_main_~y1~0 (- 1)) 0))} is VALID [2020-07-29 01:28:38,753 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:28:38,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:38,759 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:28:38,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,760 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:28:38,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:38,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 12 states and 18 transitions. Complement of second has 5 states. [2020-07-29 01:28:38,806 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:28:38,806 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:38,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:38,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:38,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:38,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:38,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:38,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:38,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:38,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2020-07-29 01:28:38,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:38,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:38,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:38,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:38,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:38,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:38,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:38,811 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:38,811 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:38,811 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:38,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:38,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:38,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:38,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:38,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:38,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:38,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:38,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:38,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:38,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:38,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:38,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:38,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:38,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:38,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:38,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:38,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:38,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:38,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:38,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,826 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:28:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:38,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:38,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 14 transitions. [2020-07-29 01:28:38,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:38,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:38,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2020-07-29 01:28:38,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:38,830 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:28:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2020-07-29 01:28:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-07-29 01:28:38,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:38,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 14 transitions. Second operand 9 states. [2020-07-29 01:28:38,831 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 14 transitions. Second operand 9 states. [2020-07-29 01:28:38,831 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 9 states. [2020-07-29 01:28:38,831 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:38,832 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:28:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:38,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:38,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:38,833 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states and 14 transitions. [2020-07-29 01:28:38,833 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states and 14 transitions. [2020-07-29 01:28:38,834 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:38,835 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:28:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:38,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:38,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:38,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:38,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:28:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-07-29 01:28:38,837 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-29 01:28:38,837 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-29 01:28:38,838 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:38,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:28:38,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:38,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:38,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:38,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:28:38,839 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:38,839 INFO L794 eck$LassoCheckResult]: Stem: 575#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 576#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 577#L20-2 assume !!(main_~y1~0 != main_~y2~0); 579#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 583#L20-2 assume !!(main_~y1~0 != main_~y2~0); 581#L20 [2020-07-29 01:28:38,840 INFO L796 eck$LassoCheckResult]: Loop: 581#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 582#L20-2 assume !!(main_~y1~0 != main_~y2~0); 581#L20 [2020-07-29 01:28:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 2 times [2020-07-29 01:28:38,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:38,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001019347] [2020-07-29 01:28:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:38,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:38,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:38,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 2 times [2020-07-29 01:28:38,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:38,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232194149] [2020-07-29 01:28:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:38,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:38,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:38,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1537641183, now seen corresponding path program 3 times [2020-07-29 01:28:38,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:38,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722191954] [2020-07-29 01:28:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:38,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:38,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:38,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:38,957 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:38,957 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:38,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:38,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:38,958 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:38,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:38,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:38,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration5_Lasso [2020-07-29 01:28:38,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:38,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:38,970 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:28:38,973 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:28:38,984 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:28:38,987 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:28:38,991 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:28:38,995 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:28:39,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:39,181 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:39,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,193 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,197 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,222 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,223 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:39,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,247 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,249 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,249 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:39,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,275 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 42 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,299 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,299 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,321 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:39,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,612 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:39,614 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:39,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:39,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:39,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:39,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:39,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:39,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:39,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration5_Lasso [2020-07-29 01:28:39,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:39,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:39,626 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:28:39,629 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:28:39,632 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:28:39,636 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:28:39,639 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:28:39,642 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:28:39,835 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:39,835 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:39,843 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:28:39,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:39,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:39,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:39,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:39,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:39,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,851 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,882 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:28:39,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:39,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:39,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:39,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:39,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:39,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:39,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:39,886 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:39,915 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 Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:39,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:39,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:39,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:39,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:39,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:39,920 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:39,942 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 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:39,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:39,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:39,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:39,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:39,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:39,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:39,945 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,967 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:28:39,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:39,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:39,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:39,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:39,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:39,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:39,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:39,975 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:40,004 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:28:40,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:40,005 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:28:40,005 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:40,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:40,014 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:28:40,014 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:28:40,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:40,068 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:28:40,069 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:40,071 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:40,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2020-07-29 01:28:40,075 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:40,075 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0, ULTIMATE.start_main_~y1~0) = 3*ULTIMATE.start_main_~y2~0 - 2*ULTIMATE.start_main_~y1~0 Supporting invariants [3*ULTIMATE.start_main_~y1~0 - 2 >= 0, 1*ULTIMATE.start_main_~y2~0 >= 0] [2020-07-29 01:28:40,104 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 01:28:40,108 INFO L393 LassoCheck]: Loop: "assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0;" "assume !!(main_~y1~0 != main_~y2~0);" [2020-07-29 01:28:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {639#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {639#unseeded} is VALID [2020-07-29 01:28:40,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {639#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {639#unseeded} is VALID [2020-07-29 01:28:40,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {639#unseeded} assume !!(main_~y1~0 != main_~y2~0); {639#unseeded} is VALID [2020-07-29 01:28:40,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {639#unseeded} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} is VALID [2020-07-29 01:28:40,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} assume !!(main_~y1~0 != main_~y2~0); {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} is VALID [2020-07-29 01:28:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,213 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,296 INFO L280 TraceCheckUtils]: 0: Hoare triple {664#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) (>= oldRank0 (+ (* 3 ULTIMATE.start_main_~y2~0) (* (- 2) ULTIMATE.start_main_~y1~0))))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {684#(and (<= (+ ULTIMATE.start_main_~y2~0 ULTIMATE.start_main_~y1~0) (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)) (<= 2 (* 3 ULTIMATE.start_main_~y1~0)) (<= ULTIMATE.start_main_~y1~0 (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)))} is VALID [2020-07-29 01:28:40,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#(and (<= (+ ULTIMATE.start_main_~y2~0 ULTIMATE.start_main_~y1~0) (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)) (<= 2 (* 3 ULTIMATE.start_main_~y1~0)) (<= ULTIMATE.start_main_~y1~0 (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)))} assume !!(main_~y1~0 != main_~y2~0); {666#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) (or (and (> oldRank0 (+ (* 3 ULTIMATE.start_main_~y2~0) (* (- 2) ULTIMATE.start_main_~y1~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:28:40,298 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:28:40,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:40,306 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:28:40,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,307 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:28:40,307 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:28:40,356 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 14 states and 18 transitions. Complement of second has 6 states. [2020-07-29 01:28:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:40,357 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:40,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:40,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:28:40,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:40,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,359 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 13 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,360 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:40,360 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:40,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:40,362 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,362 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,363 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:40,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:40,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:40,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:40,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,380 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2020-07-29 01:28:40,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,384 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:40,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {639#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {639#unseeded} is VALID [2020-07-29 01:28:40,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {639#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {639#unseeded} is VALID [2020-07-29 01:28:40,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {639#unseeded} assume !!(main_~y1~0 != main_~y2~0); {639#unseeded} is VALID [2020-07-29 01:28:40,477 INFO L280 TraceCheckUtils]: 3: Hoare triple {639#unseeded} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} is VALID [2020-07-29 01:28:40,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} assume !!(main_~y1~0 != main_~y2~0); {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} is VALID [2020-07-29 01:28:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,481 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {664#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) (>= oldRank0 (+ (* 3 ULTIMATE.start_main_~y2~0) (* (- 2) ULTIMATE.start_main_~y1~0))))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {729#(and (<= (+ ULTIMATE.start_main_~y2~0 ULTIMATE.start_main_~y1~0) (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)) (<= 2 (* 3 ULTIMATE.start_main_~y1~0)) (<= ULTIMATE.start_main_~y1~0 (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)))} is VALID [2020-07-29 01:28:40,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {729#(and (<= (+ ULTIMATE.start_main_~y2~0 ULTIMATE.start_main_~y1~0) (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)) (<= 2 (* 3 ULTIMATE.start_main_~y1~0)) (<= ULTIMATE.start_main_~y1~0 (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)))} assume !!(main_~y1~0 != main_~y2~0); {666#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) (or (and (> oldRank0 (+ (* 3 ULTIMATE.start_main_~y2~0) (* (- 2) ULTIMATE.start_main_~y1~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:28:40,554 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:28:40,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:40,568 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:28:40,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:28:40,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:28:40,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 11 states and 15 transitions. Complement of second has 6 states. [2020-07-29 01:28:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:40,634 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:40,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:40,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2020-07-29 01:28:40,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:40,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 13 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:40,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:40,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:40,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:40,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:40,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:40,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:40,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:40,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:40,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:40,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:40,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:40,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,647 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-07-29 01:28:40,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,647 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {639#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {639#unseeded} is VALID [2020-07-29 01:28:40,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {639#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {639#unseeded} is VALID [2020-07-29 01:28:40,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {639#unseeded} assume !!(main_~y1~0 != main_~y2~0); {639#unseeded} is VALID [2020-07-29 01:28:40,725 INFO L280 TraceCheckUtils]: 3: Hoare triple {639#unseeded} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} is VALID [2020-07-29 01:28:40,726 INFO L280 TraceCheckUtils]: 4: Hoare triple {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} assume !!(main_~y1~0 != main_~y2~0); {663#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) unseeded)} is VALID [2020-07-29 01:28:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,729 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {664#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) (>= oldRank0 (+ (* 3 ULTIMATE.start_main_~y2~0) (* (- 2) ULTIMATE.start_main_~y1~0))))} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {771#(and (<= (+ ULTIMATE.start_main_~y2~0 ULTIMATE.start_main_~y1~0) (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)) (<= 2 (* 3 ULTIMATE.start_main_~y1~0)) (<= ULTIMATE.start_main_~y1~0 (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)))} is VALID [2020-07-29 01:28:40,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#(and (<= (+ ULTIMATE.start_main_~y2~0 ULTIMATE.start_main_~y1~0) (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)) (<= 2 (* 3 ULTIMATE.start_main_~y1~0)) (<= ULTIMATE.start_main_~y1~0 (div (+ (* ULTIMATE.start_main_~y1~0 2) oldRank0) 3)))} assume !!(main_~y1~0 != main_~y2~0); {666#(and (>= (+ (* 3 ULTIMATE.start_main_~y1~0) (- 2)) 0) (or (and (> oldRank0 (+ (* 3 ULTIMATE.start_main_~y2~0) (* (- 2) ULTIMATE.start_main_~y1~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:28:40,812 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:28:40,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:40,819 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:28:40,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,820 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:28:40,820 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:28:40,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 17 states and 21 transitions. Complement of second has 5 states. [2020-07-29 01:28:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:40,874 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:40,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:40,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-07-29 01:28:40,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:40,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,877 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 13 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,877 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:40,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:40,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:40,879 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,879 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,879 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:40,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:40,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:40,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:40,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:40,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 13 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,890 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:28:40,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:40,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:40,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:40,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:40,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:40,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2020-07-29 01:28:40,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:40,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:28:40,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:28:40,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:40,895 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:28:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:28:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2020-07-29 01:28:40,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:40,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 8 states. [2020-07-29 01:28:40,897 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 8 states. [2020-07-29 01:28:40,897 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 8 states. [2020-07-29 01:28:40,898 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:40,899 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 01:28:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:28:40,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:40,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:40,900 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 13 states and 17 transitions. [2020-07-29 01:28:40,900 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 13 states and 17 transitions. [2020-07-29 01:28:40,900 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:40,901 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 01:28:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:28:40,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:40,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:40,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:40,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:28:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:28:40,904 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:40,904 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:40,904 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:28:40,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:40,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:40,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,905 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:28:40,905 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-29 01:28:40,906 INFO L794 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 802#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 803#L20-2 assume !!(main_~y1~0 != main_~y2~0); 805#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 808#L20-2 assume !!(main_~y1~0 != main_~y2~0); 807#L20 [2020-07-29 01:28:40,906 INFO L796 eck$LassoCheckResult]: Loop: 807#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 806#L20-2 assume !!(main_~y1~0 != main_~y2~0); 805#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 808#L20-2 assume !!(main_~y1~0 != main_~y2~0); 807#L20 [2020-07-29 01:28:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 3 times [2020-07-29 01:28:40,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:40,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976326977] [2020-07-29 01:28:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1472761, now seen corresponding path program 1 times [2020-07-29 01:28:40,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:40,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087062253] [2020-07-29 01:28:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -204426530, now seen corresponding path program 4 times [2020-07-29 01:28:40,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:40,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246026293] [2020-07-29 01:28:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:40,983 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:40,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:40,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:40,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:40,983 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:40,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:40,984 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:40,984 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:40,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration6_Loop [2020-07-29 01:28:40,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:40,984 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:40,990 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:28:40,994 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:28:40,997 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:28:41,169 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:41,169 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:41,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:41,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:41,174 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:41,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:41,198 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:41,198 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:41,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:41,221 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:41,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:41,694 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:41,696 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:41,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:41,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:41,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:41,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:41,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:41,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:41,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1.c_Iteration6_Loop [2020-07-29 01:28:41,697 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:41,697 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:41,705 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:28:41,712 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:28:41,716 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:28:41,876 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:41,877 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,881 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:28:41,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:41,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:41,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:41,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:41,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:41,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:41,888 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,908 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:28:41,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:41,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:41,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:41,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:41,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:41,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:41,915 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:41,938 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 Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:41,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:41,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:41,940 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:41,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:41,942 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:41,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:41,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:41,954 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:41,954 INFO L444 ModelExtractionUtils]: 1 out of 4 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:41,957 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:41,957 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:41,957 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0) = 1*ULTIMATE.start_main_~y2~0 Supporting invariants [] [2020-07-29 01:28:41,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:41,980 INFO L393 LassoCheck]: Loop: "assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0;" "assume !!(main_~y1~0 != main_~y2~0);" "assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0;" "assume !!(main_~y1~0 != main_~y2~0);" [2020-07-29 01:28:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {873#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; {873#unseeded} is VALID [2020-07-29 01:28:42,011 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#unseeded} assume main_~y1~0 > 0 && main_~y2~0 > 0; {873#unseeded} is VALID [2020-07-29 01:28:42,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#unseeded} assume !!(main_~y1~0 != main_~y2~0); {873#unseeded} is VALID [2020-07-29 01:28:42,014 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#unseeded} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {873#unseeded} is VALID [2020-07-29 01:28:42,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {873#unseeded} assume !!(main_~y1~0 != main_~y2~0); {873#unseeded} is VALID [2020-07-29 01:28:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,021 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(>= oldRank0 ULTIMATE.start_main_~y2~0)} assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; {903#(and (<= ULTIMATE.start_main_~y1~0 oldRank0) (<= 0 ULTIMATE.start_main_~y2~0))} is VALID [2020-07-29 01:28:42,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {903#(and (<= ULTIMATE.start_main_~y1~0 oldRank0) (<= 0 ULTIMATE.start_main_~y2~0))} assume !!(main_~y1~0 != main_~y2~0); {903#(and (<= ULTIMATE.start_main_~y1~0 oldRank0) (<= 0 ULTIMATE.start_main_~y2~0))} is VALID [2020-07-29 01:28:42,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {903#(and (<= ULTIMATE.start_main_~y1~0 oldRank0) (<= 0 ULTIMATE.start_main_~y2~0))} assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; {910#(and (<= (+ ULTIMATE.start_main_~y2~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y2~0))} is VALID [2020-07-29 01:28:42,125 INFO L280 TraceCheckUtils]: 3: Hoare triple {910#(and (<= (+ ULTIMATE.start_main_~y2~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y2~0))} assume !!(main_~y1~0 != main_~y2~0); {886#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y2~0)) unseeded)} is VALID [2020-07-29 01:28:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:42,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:42,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,137 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:28:42,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:28:42,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 27 states and 41 transitions. Complement of second has 6 states. [2020-07-29 01:28:42,185 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:28:42,185 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:42,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:42,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:42,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. [2020-07-29 01:28:42,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:42,188 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:42,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:42,189 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:42,189 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 41 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:42,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:42,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,190 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:42,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:42,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:42,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:42,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:28:42,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:28:42,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:28:42,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:42,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:42,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:42,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:42,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:42,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 41 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:42,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,196 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:28:42,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:42,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:42,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:28:42,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:42,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2020-07-29 01:28:42,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:42,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:42,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:42,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:42,200 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:42,201 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:42,201 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:42,201 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:28:42,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:42,201 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:42 BoogieIcfgContainer [2020-07-29 01:28:42,208 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:42,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:42,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:42,209 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:42,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:33" (3/4) ... [2020-07-29 01:28:42,212 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:42,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:42,214 INFO L168 Benchmark]: Toolchain (without parser) took 9666.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 957.5 MB in the beginning and 842.2 MB in the end (delta: 115.3 MB). Peak memory consumption was 413.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:42,214 INFO L168 Benchmark]: CDTParser took 0.22 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:28:42,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.40 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:42,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:42,216 INFO L168 Benchmark]: Boogie Preprocessor took 17.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:42,217 INFO L168 Benchmark]: RCFGBuilder took 241.20 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:42,218 INFO L168 Benchmark]: BuchiAutomizer took 8986.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 842.2 MB in the end (delta: 268.2 MB). Peak memory consumption was 432.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:42,218 INFO L168 Benchmark]: Witness Printer took 3.42 ms. Allocated memory is still 1.3 GB. Free memory is still 842.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:42,221 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.22 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 317.40 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.20 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8986.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 842.2 MB in the end (delta: 268.2 MB). Peak memory consumption was 432.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.42 ms. Allocated memory is still 1.3 GB. Free memory is still 842.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * y2 + y1 and consists of 4 locations. One deterministic module has affine ranking function y1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + y2 and consists of 3 locations. One deterministic module has affine ranking function y2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 and consists of 4 locations. One nondeterministic module has affine ranking function 3 * y2 + -2 * y1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 32 SDtfs, 56 SDslu, 3 SDs, 0 SdLazy, 97 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax150 hnf89 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf96 smp87 dnf123 smp96 tf100 neg95 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 72ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...