./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.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/Urban-WST2013-Fig2.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 31d0c4253184c01eb9f9573658b07bed7aa94585 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:29:01,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:01,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:01,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:01,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:01,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:01,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:01,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:01,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:01,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:01,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:01,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:01,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:01,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:01,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:01,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:01,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:01,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:01,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:01,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:01,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:01,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:01,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:01,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:01,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:01,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:01,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:01,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:01,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:01,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:01,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:01,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:01,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:01,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:01,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:01,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:01,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:01,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:01,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:01,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:01,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:01,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:29:01,530 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:01,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:01,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:01,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:01,532 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:01,536 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:01,537 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:01,537 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:01,537 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:01,537 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:01,537 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:01,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:01,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:01,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:01,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:01,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:01,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:01,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:01,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:01,539 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:01,539 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:01,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:01,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:01,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:01,540 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:01,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:01,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:01,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:01,545 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:01,546 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:01,546 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 -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2020-07-29 01:29:01,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:01,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:01,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:01,879 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:01,879 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:01,880 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2020-07-29 01:29:01,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dbcb376/280d7e2cf2044d6aa4ef58e4ebcb2be2/FLAG781676555 [2020-07-29 01:29:02,385 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:02,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2020-07-29 01:29:02,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dbcb376/280d7e2cf2044d6aa4ef58e4ebcb2be2/FLAG781676555 [2020-07-29 01:29:02,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dbcb376/280d7e2cf2044d6aa4ef58e4ebcb2be2 [2020-07-29 01:29:02,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:02,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:02,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:02,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:02,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:02,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:02,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4155f3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02, skipping insertion in model container [2020-07-29 01:29:02,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:02,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:02,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:02,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:02,955 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:02,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:02,988 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:02,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02 WrapperNode [2020-07-29 01:29:02,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:02,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:02,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:02,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:03,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:03,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:03,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:03,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:03,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... [2020-07-29 01:29:03,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:03,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:03,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:03,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:03,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:03,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:03,390 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:03,391 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:29:03,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:03 BoogieIcfgContainer [2020-07-29 01:29:03,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:03,396 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:03,396 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:03,400 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:03,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:03,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:02" (1/3) ... [2020-07-29 01:29:03,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8a59e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:03, skipping insertion in model container [2020-07-29 01:29:03,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:03,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:02" (2/3) ... [2020-07-29 01:29:03,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8a59e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:03, skipping insertion in model container [2020-07-29 01:29:03,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:03,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:03" (3/3) ... [2020-07-29 01:29:03,414 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2020-07-29 01:29:03,488 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:03,489 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:03,489 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:03,489 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:03,489 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:03,489 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:03,490 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:03,490 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:03,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:29:03,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:03,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,534 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:03,534 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:03,534 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:03,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:29:03,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:03,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,538 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:03,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:03,547 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L19-2true [2020-07-29 01:29:03,548 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 9#L21-2true assume !(main_~x2~0 > 1); 8#L21-3true main_~x1~0 := 1 + main_~x1~0; 6#L19-2true [2020-07-29 01:29:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:29:03,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024876199] [2020-07-29 01:29:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:29:03,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110966844] [2020-07-29 01:29:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:03,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {16#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:03,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#(<= 10 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {15#false} is VALID [2020-07-29 01:29:03,783 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} main_~x1~0 := 1 + main_~x1~0; {15#false} is VALID [2020-07-29 01:29:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:03,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110966844] [2020-07-29 01:29:03,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:03,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:29:03,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128237394] [2020-07-29 01:29:03,810 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:03,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:29:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:29:03,859 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-07-29 01:29:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:03,903 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:29:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:29:03,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:03,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:03,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:29:03,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:03,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2020-07-29 01:29:03,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:29:03,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:29:03,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-07-29 01:29:03,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:03,927 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:29:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-07-29 01:29:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-29 01:29:03,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:03,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:29:03,952 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:29:03,953 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:29:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:03,955 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:29:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:29:03,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:03,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:03,957 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:29:03,957 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:29:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:03,959 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:29:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:29:03,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:03,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:03,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:03,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-07-29 01:29:03,964 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:29:03,964 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:29:03,964 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:03,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:29:03,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:03,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:03,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:29:03,967 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 27#L19-2 [2020-07-29 01:29:03,967 INFO L796 eck$LassoCheckResult]: Loop: 27#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 28#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 30#L21-2 assume !(main_~x2~0 > 1); 29#L21-3 main_~x1~0 := 1 + main_~x1~0; 27#L19-2 [2020-07-29 01:29:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:29:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674888073] [2020-07-29 01:29:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2020-07-29 01:29:03,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244386011] [2020-07-29 01:29:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {48#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {49#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= 9 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {47#false} is VALID [2020-07-29 01:29:04,042 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#false} main_~x1~0 := 1 + main_~x1~0; {47#false} is VALID [2020-07-29 01:29:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244386011] [2020-07-29 01:29:04,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40435985] [2020-07-29 01:29:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:29:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:04,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {48#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {49#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= 9 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {47#false} is VALID [2020-07-29 01:29:04,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#false} main_~x1~0 := 1 + main_~x1~0; {47#false} is VALID [2020-07-29 01:29:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:04,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:29:04,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741062120] [2020-07-29 01:29:04,220 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:04,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:04,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:29:04,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:29:04,222 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 01:29:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,260 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-07-29 01:29:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:29:04,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:04,269 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:29:04,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2020-07-29 01:29:04,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:04,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:29:04,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:29:04,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:29:04,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2020-07-29 01:29:04,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:04,274 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:29:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2020-07-29 01:29:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-07-29 01:29:04,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:04,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states and 7 transitions. Second operand 6 states. [2020-07-29 01:29:04,276 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states and 7 transitions. Second operand 6 states. [2020-07-29 01:29:04,276 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 6 states. [2020-07-29 01:29:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,278 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-07-29 01:29:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:29:04,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:04,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:04,279 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states and 7 transitions. [2020-07-29 01:29:04,279 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states and 7 transitions. [2020-07-29 01:29:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,280 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-07-29 01:29:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:29:04,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:04,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:04,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:04,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:29:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:29:04,283 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:29:04,283 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:29:04,284 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:04,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:29:04,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:04,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:04,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:04,285 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:04,286 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2020-07-29 01:29:04,286 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 66#L19-2 [2020-07-29 01:29:04,286 INFO L796 eck$LassoCheckResult]: Loop: 66#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 67#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 69#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 70#L21-2 assume !(main_~x2~0 > 1); 68#L21-3 main_~x1~0 := 1 + main_~x1~0; 66#L19-2 [2020-07-29 01:29:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-07-29 01:29:04,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:04,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345944463] [2020-07-29 01:29:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:04,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:04,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:04,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2020-07-29 01:29:04,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:04,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940539590] [2020-07-29 01:29:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,358 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {90#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {91#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {92#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#(<= 8 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {89#false} is VALID [2020-07-29 01:29:04,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {89#false} main_~x1~0 := 1 + main_~x1~0; {89#false} is VALID [2020-07-29 01:29:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940539590] [2020-07-29 01:29:04,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160099074] [2020-07-29 01:29:04,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:04,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:29:04,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:04,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:04,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {90#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {91#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {92#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#(<= 8 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {89#false} is VALID [2020-07-29 01:29:04,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {89#false} main_~x1~0 := 1 + main_~x1~0; {89#false} is VALID [2020-07-29 01:29:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:04,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-29 01:29:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042567698] [2020-07-29 01:29:04,519 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:04,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:04,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:29:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:29:04,520 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-07-29 01:29:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,561 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:29:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:29:04,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:04,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:04,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2020-07-29 01:29:04,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:04,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:29:04,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:29:04,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:29:04,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:29:04,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:04,575 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:29:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:29:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:29:04,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:04,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:29:04,577 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:29:04,577 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:29:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,579 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:29:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:29:04,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:04,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:04,580 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:29:04,580 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:29:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,581 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:29:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:29:04,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:04,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:04,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:04,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:29:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:29:04,584 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:29:04,584 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:29:04,584 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:04,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:29:04,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:04,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:04,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:04,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:04,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2020-07-29 01:29:04,587 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 113#L19-2 [2020-07-29 01:29:04,587 INFO L796 eck$LassoCheckResult]: Loop: 113#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 114#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 116#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 118#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 117#L21-2 assume !(main_~x2~0 > 1); 115#L21-3 main_~x1~0 := 1 + main_~x1~0; 113#L19-2 [2020-07-29 01:29:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2020-07-29 01:29:04,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:04,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679633585] [2020-07-29 01:29:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:04,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:04,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:04,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2020-07-29 01:29:04,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:04,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385987948] [2020-07-29 01:29:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {138#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {140#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {141#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {141#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {142#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,682 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {143#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {143#(<= 7 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {139#false} is VALID [2020-07-29 01:29:04,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {139#false} main_~x1~0 := 1 + main_~x1~0; {139#false} is VALID [2020-07-29 01:29:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385987948] [2020-07-29 01:29:04,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735701858] [2020-07-29 01:29:04,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:04,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:29:04,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:04,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:04,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {138#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {140#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {141#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {141#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {142#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {143#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:04,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {143#(<= 7 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {139#false} is VALID [2020-07-29 01:29:04,849 INFO L280 TraceCheckUtils]: 5: Hoare triple {139#false} main_~x1~0 := 1 + main_~x1~0; {139#false} is VALID [2020-07-29 01:29:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:04,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-29 01:29:04,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311507430] [2020-07-29 01:29:04,851 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:04,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:29:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:29:04,852 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:29:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,904 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:29:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:29:04,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:29:04,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:04,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-07-29 01:29:04,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:29:04,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 01:29:04,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:29:04,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:29:04,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-07-29 01:29:04,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:04,917 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:29:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-07-29 01:29:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:29:04,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:04,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:29:04,919 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:29:04,919 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:29:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,920 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:29:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:29:04,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:04,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:04,921 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 9 transitions. [2020-07-29 01:29:04,921 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 9 transitions. [2020-07-29 01:29:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:04,923 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:29:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:29:04,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:04,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:04,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:04,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:29:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 01:29:04,925 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:29:04,925 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:29:04,925 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:04,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:29:04,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:29:04,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:04,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:04,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:04,926 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2020-07-29 01:29:04,927 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 168#L19-2 [2020-07-29 01:29:04,927 INFO L796 eck$LassoCheckResult]: Loop: 168#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 169#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 171#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 174#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 173#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 172#L21-2 assume !(main_~x2~0 > 1); 170#L21-3 main_~x1~0 := 1 + main_~x1~0; 168#L19-2 [2020-07-29 01:29:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2020-07-29 01:29:04,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:04,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622856085] [2020-07-29 01:29:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:04,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:04,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:04,936 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2020-07-29 01:29:04,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:04,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461052563] [2020-07-29 01:29:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:05,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {198#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {199#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {199#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {200#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,036 INFO L280 TraceCheckUtils]: 3: Hoare triple {200#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {201#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {201#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {202#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {202#(<= 6 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {197#false} is VALID [2020-07-29 01:29:05,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#false} main_~x1~0 := 1 + main_~x1~0; {197#false} is VALID [2020-07-29 01:29:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:05,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461052563] [2020-07-29 01:29:05,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415423872] [2020-07-29 01:29:05,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:05,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:29:05,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:05,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:05,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:05,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {198#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {199#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {199#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {200#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {200#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {201#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {201#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {202#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {202#(<= 6 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {197#false} is VALID [2020-07-29 01:29:05,266 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#false} main_~x1~0 := 1 + main_~x1~0; {197#false} is VALID [2020-07-29 01:29:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:05,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:05,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-29 01:29:05,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816256851] [2020-07-29 01:29:05,268 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:05,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:29:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:29:05,270 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-07-29 01:29:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:05,324 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:29:05,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:29:05,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:29:05,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:05,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:29:05,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:29:05,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:29:05,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:29:05,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:29:05,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-07-29 01:29:05,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:05,340 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:29:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-07-29 01:29:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-29 01:29:05,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:05,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand 9 states. [2020-07-29 01:29:05,343 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand 9 states. [2020-07-29 01:29:05,344 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 9 states. [2020-07-29 01:29:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:05,346 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:29:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:29:05,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:05,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:05,351 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states and 10 transitions. [2020-07-29 01:29:05,351 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states and 10 transitions. [2020-07-29 01:29:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:05,353 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:29:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:29:05,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:05,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:05,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:05,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:29:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:29:05,356 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:29:05,356 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:29:05,357 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:05,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:29:05,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:29:05,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:05,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:05,359 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:05,359 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2020-07-29 01:29:05,359 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 231#L19-2 [2020-07-29 01:29:05,359 INFO L796 eck$LassoCheckResult]: Loop: 231#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 232#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 234#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 238#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 237#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 236#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 235#L21-2 assume !(main_~x2~0 > 1); 233#L21-3 main_~x1~0 := 1 + main_~x1~0; 231#L19-2 [2020-07-29 01:29:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2020-07-29 01:29:05,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:05,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880390602] [2020-07-29 01:29:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:05,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:05,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:05,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2020-07-29 01:29:05,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:05,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334715203] [2020-07-29 01:29:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:05,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {264#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {265#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {266#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {267#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {268#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {269#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {269#(<= 5 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {263#false} is VALID [2020-07-29 01:29:05,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#false} main_~x1~0 := 1 + main_~x1~0; {263#false} is VALID [2020-07-29 01:29:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:05,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334715203] [2020-07-29 01:29:05,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330676861] [2020-07-29 01:29:05,540 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:05,568 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-29 01:29:05,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:05,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:05,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:05,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {264#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {265#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {266#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,754 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {267#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {268#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {269#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {269#(<= 5 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {263#false} is VALID [2020-07-29 01:29:05,758 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#false} main_~x1~0 := 1 + main_~x1~0; {263#false} is VALID [2020-07-29 01:29:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:05,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:05,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-29 01:29:05,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985538895] [2020-07-29 01:29:05,760 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:05,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:05,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:29:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:29:05,761 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-07-29 01:29:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:05,812 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:29:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:29:05,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:29:05,822 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:29:05,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-07-29 01:29:05,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:29:05,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 01:29:05,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:29:05,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:29:05,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-07-29 01:29:05,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:05,825 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:29:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-07-29 01:29:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:29:05,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:05,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:29:05,827 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:29:05,827 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:29:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:05,828 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:29:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:29:05,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:05,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:05,829 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 11 transitions. [2020-07-29 01:29:05,829 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 11 transitions. [2020-07-29 01:29:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:05,831 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:29:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:29:05,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:05,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:05,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:05,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:29:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 01:29:05,833 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:29:05,833 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:29:05,833 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:29:05,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:29:05,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:29:05,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:05,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:05,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:05,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2020-07-29 01:29:05,835 INFO L794 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 302#L19-2 [2020-07-29 01:29:05,835 INFO L796 eck$LassoCheckResult]: Loop: 302#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 303#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 305#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 310#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 309#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 308#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 307#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 306#L21-2 assume !(main_~x2~0 > 1); 304#L21-3 main_~x1~0 := 1 + main_~x1~0; 302#L19-2 [2020-07-29 01:29:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2020-07-29 01:29:05,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:05,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767982920] [2020-07-29 01:29:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:05,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:05,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:05,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:05,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2020-07-29 01:29:05,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:05,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904403585] [2020-07-29 01:29:05,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:05,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {338#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {338#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {339#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {339#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {340#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,945 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {341#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,946 INFO L280 TraceCheckUtils]: 4: Hoare triple {341#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {342#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {342#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {343#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {343#(<= 5 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {344#(<= 4 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:05,950 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#(<= 4 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {337#false} is VALID [2020-07-29 01:29:05,950 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#false} main_~x1~0 := 1 + main_~x1~0; {337#false} is VALID [2020-07-29 01:29:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:05,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904403585] [2020-07-29 01:29:05,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168786424] [2020-07-29 01:29:05,952 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:05,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-07-29 01:29:05,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:05,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:05,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:06,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {338#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {338#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {339#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {339#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {340#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,205 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {341#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,206 INFO L280 TraceCheckUtils]: 4: Hoare triple {341#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {342#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {342#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {343#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {343#(<= 5 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {344#(<= 4 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#(<= 4 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {337#false} is VALID [2020-07-29 01:29:06,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#false} main_~x1~0 := 1 + main_~x1~0; {337#false} is VALID [2020-07-29 01:29:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:06,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:06,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-29 01:29:06,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531390264] [2020-07-29 01:29:06,212 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:06,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:29:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:29:06,218 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-07-29 01:29:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:06,302 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:29:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:29:06,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:29:06,312 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:29:06,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-07-29 01:29:06,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:29:06,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:29:06,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:29:06,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:29:06,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-07-29 01:29:06,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:06,318 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:29:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-07-29 01:29:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:29:06,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:06,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 12 transitions. Second operand 11 states. [2020-07-29 01:29:06,320 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 12 transitions. Second operand 11 states. [2020-07-29 01:29:06,320 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 11 states. [2020-07-29 01:29:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:06,324 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:29:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:29:06,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:06,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:06,325 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 12 transitions. [2020-07-29 01:29:06,325 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 12 transitions. [2020-07-29 01:29:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:06,326 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:29:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:29:06,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:06,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:06,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:06,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:29:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:29:06,328 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:29:06,328 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:29:06,328 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:29:06,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:29:06,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:29:06,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:06,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:06,331 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:06,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2020-07-29 01:29:06,331 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 381#L19-2 [2020-07-29 01:29:06,331 INFO L796 eck$LassoCheckResult]: Loop: 381#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 382#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 384#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 390#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 389#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 388#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 387#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 386#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 385#L21-2 assume !(main_~x2~0 > 1); 383#L21-3 main_~x1~0 := 1 + main_~x1~0; 381#L19-2 [2020-07-29 01:29:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2020-07-29 01:29:06,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:06,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925967946] [2020-07-29 01:29:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:06,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:06,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:06,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2020-07-29 01:29:06,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:06,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388171933] [2020-07-29 01:29:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:06,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {418#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {420#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {421#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {421#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {422#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {423#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {423#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {424#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {424#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {425#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {425#(<= 5 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {426#(<= 4 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {426#(<= 4 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {427#(<= 3 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {427#(<= 3 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {419#false} is VALID [2020-07-29 01:29:06,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#false} main_~x1~0 := 1 + main_~x1~0; {419#false} is VALID [2020-07-29 01:29:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:06,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388171933] [2020-07-29 01:29:06,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439214467] [2020-07-29 01:29:06,456 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:06,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:29:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:06,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:06,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {418#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {420#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {421#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {421#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {422#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,719 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {423#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {423#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {424#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,722 INFO L280 TraceCheckUtils]: 5: Hoare triple {424#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {425#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,723 INFO L280 TraceCheckUtils]: 6: Hoare triple {425#(<= 5 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {426#(<= 4 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {426#(<= 4 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {427#(<= 3 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {427#(<= 3 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {419#false} is VALID [2020-07-29 01:29:06,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#false} main_~x1~0 := 1 + main_~x1~0; {419#false} is VALID [2020-07-29 01:29:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:06,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:06,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-29 01:29:06,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336107486] [2020-07-29 01:29:06,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:06,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:29:06,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:29:06,728 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-07-29 01:29:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:06,801 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:29:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:29:06,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:29:06,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:06,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-07-29 01:29:06,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:29:06,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:29:06,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:29:06,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:29:06,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-07-29 01:29:06,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:06,820 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:29:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-07-29 01:29:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:29:06,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:06,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:29:06,822 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:29:06,822 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:29:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:06,824 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:29:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:29:06,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:06,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:06,824 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 01:29:06,825 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 01:29:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:06,826 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:29:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:29:06,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:06,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:06,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:06,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:29:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:29:06,828 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:29:06,828 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:29:06,828 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:29:06,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:29:06,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:29:06,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:06,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:06,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:06,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2020-07-29 01:29:06,830 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 468#L19-2 [2020-07-29 01:29:06,831 INFO L796 eck$LassoCheckResult]: Loop: 468#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 469#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 471#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 478#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 477#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 476#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 475#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 474#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 473#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 472#L21-2 assume !(main_~x2~0 > 1); 470#L21-3 main_~x1~0 := 1 + main_~x1~0; 468#L19-2 [2020-07-29 01:29:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2020-07-29 01:29:06,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:06,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545011312] [2020-07-29 01:29:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:06,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:06,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:06,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2020-07-29 01:29:06,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:06,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566314511] [2020-07-29 01:29:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:06,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {510#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {510#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {511#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {512#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,981 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {513#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {514#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,983 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {515#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(<= 5 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {516#(<= 4 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(<= 4 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {517#(<= 3 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,986 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= 3 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {518#(<= 2 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:06,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= 2 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {509#false} is VALID [2020-07-29 01:29:06,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#false} main_~x1~0 := 1 + main_~x1~0; {509#false} is VALID [2020-07-29 01:29:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:06,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566314511] [2020-07-29 01:29:06,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689794282] [2020-07-29 01:29:06,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:07,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:29:07,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:07,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:29:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:07,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:07,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {510#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {510#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {511#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(<= 9 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {512#(<= 8 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#(<= 8 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {513#(<= 7 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#(<= 7 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {514#(<= 6 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(<= 6 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {515#(<= 5 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(<= 5 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {516#(<= 4 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,263 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(<= 4 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {517#(<= 3 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,282 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= 3 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {518#(<= 2 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:29:07,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= 2 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {509#false} is VALID [2020-07-29 01:29:07,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#false} main_~x1~0 := 1 + main_~x1~0; {509#false} is VALID [2020-07-29 01:29:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:07,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:07,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-29 01:29:07,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462900374] [2020-07-29 01:29:07,285 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:07,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:29:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:29:07,286 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2020-07-29 01:29:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:07,357 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:29:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:29:07,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:29:07,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:07,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-07-29 01:29:07,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:29:07,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:29:07,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:29:07,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:29:07,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-07-29 01:29:07,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:07,377 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:29:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-07-29 01:29:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:29:07,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:07,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 14 transitions. Second operand 13 states. [2020-07-29 01:29:07,383 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 14 transitions. Second operand 13 states. [2020-07-29 01:29:07,383 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 13 states. [2020-07-29 01:29:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:07,384 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:29:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:29:07,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:07,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:07,387 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 14 transitions. [2020-07-29 01:29:07,388 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 14 transitions. [2020-07-29 01:29:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:07,389 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:29:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:29:07,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:07,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:07,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:07,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:29:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:29:07,393 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:29:07,393 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:29:07,393 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:29:07,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:29:07,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:29:07,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:07,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:07,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:07,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2020-07-29 01:29:07,396 INFO L794 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 563#L19-2 [2020-07-29 01:29:07,396 INFO L796 eck$LassoCheckResult]: Loop: 563#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 564#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 566#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 574#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 573#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 572#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 571#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 570#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 569#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 568#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 567#L21-2 assume !(main_~x2~0 > 1); 565#L21-3 main_~x1~0 := 1 + main_~x1~0; 563#L19-2 [2020-07-29 01:29:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2020-07-29 01:29:07,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:07,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95077776] [2020-07-29 01:29:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:07,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:07,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:07,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2020-07-29 01:29:07,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:07,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720317605] [2020-07-29 01:29:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:07,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:07,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:07,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2020-07-29 01:29:07,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:07,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250238203] [2020-07-29 01:29:07,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:07,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:07,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:07,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:07,619 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:07,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:07,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:07,620 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:07,620 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:07,621 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:07,621 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:07,621 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:07,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2020-07-29 01:29:07,621 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:07,621 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:07,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:07,798 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:07,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:07,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:07,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:07,816 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:07,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:07,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:07,846 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:07,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:07,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:07,876 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 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 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:29:07,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:07,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:07,952 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:07,956 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:07,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:07,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:07,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:07,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:07,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:07,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:07,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:07,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2020-07-29 01:29:07,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:07,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:07,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:07,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:08,099 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:08,104 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:08,118 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:29:08,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:08,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:08,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:08,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:08,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:08,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,168 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:29:08,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:08,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:08,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:08,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:08,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:08,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:08,183 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 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:29:08,225 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:29:08,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:08,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:08,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:08,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:08,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:08,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:08,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:08,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:08,239 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:08,240 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:08,262 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:08,262 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:08,262 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:08,263 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:08,299 INFO L393 LassoCheck]: Loop: "assume !!(main_~x1~0 <= 10);main_~x2~0 := 10;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" "assume !(main_~x2~0 > 1);" "main_~x1~0 := 1 + main_~x1~0;" [2020-07-29 01:29:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:08,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:08,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {610#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {610#unseeded} is VALID [2020-07-29 01:29:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:08,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:08,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:08,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {613#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x1~0) 21))} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,421 INFO L280 TraceCheckUtils]: 3: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,430 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,432 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,433 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,434 INFO L280 TraceCheckUtils]: 10: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} assume !(main_~x2~0 > 1); {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} is VALID [2020-07-29 01:29:08,435 INFO L280 TraceCheckUtils]: 11: Hoare triple {628#(and (<= 21 (+ (* 2 ULTIMATE.start_main_~x1~0) oldRank0)) (<= ULTIMATE.start_main_~x1~0 10))} main_~x1~0 := 1 + main_~x1~0; {623#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x1~0) 21))) unseeded)} is VALID [2020-07-29 01:29:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-07-29 01:29:08,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:08,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:08,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,454 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:29:08,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-07-29 01:29:08,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:29:08,516 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:29:08,516 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:08,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2020-07-29 01:29:08,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:08,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:08,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:08,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:08,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:08,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:08,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-07-29 01:29:08,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:08,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:08,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:08,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2020-07-29 01:29:08,530 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:29:08,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:08,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:08,532 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:08,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 28 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:08,533 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:08,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:08,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:08,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:08,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:29:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:29:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:29:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:08,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:08,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:29:08,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:29:08,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:29:08,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:29:08,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:29:08,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:29:08,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:29:08,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:29:08,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:29:08,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:29:08,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:29:08,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:29:08,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 12 letters. [2020-07-29 01:29:08,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 12 letters. [2020-07-29 01:29:08,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 12 letters. [2020-07-29 01:29:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 12 letters. [2020-07-29 01:29:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 12 letters. [2020-07-29 01:29:08,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 12 letters. [2020-07-29 01:29:08,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:29:08,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:29:08,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:29:08,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:29:08,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:29:08,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:29:08,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:08,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:08,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:08,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:08,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,578 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:08,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:29:08,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2020-07-29 01:29:08,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2020-07-29 01:29:08,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:08,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:08,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:08,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2020-07-29 01:29:08,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:29:08,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:29:08,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2020-07-29 01:29:08,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:08,586 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:29:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2020-07-29 01:29:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2020-07-29 01:29:08,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:08,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 01:29:08,590 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 01:29:08,590 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 01:29:08,591 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:08,595 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-29 01:29:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:29:08,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:08,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:08,596 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 24 states and 27 transitions. [2020-07-29 01:29:08,596 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 24 states and 27 transitions. [2020-07-29 01:29:08,597 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:08,600 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-29 01:29:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:29:08,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:08,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:08,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:08,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:29:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 01:29:08,603 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:29:08,603 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:29:08,603 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:29:08,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:29:08,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:08,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:08,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:08,608 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:29:08,608 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:08,608 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 694#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 696#L21-2 [2020-07-29 01:29:08,609 INFO L796 eck$LassoCheckResult]: Loop: 696#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 696#L21-2 [2020-07-29 01:29:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:29:08,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:08,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633422775] [2020-07-29 01:29:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:08,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:08,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:08,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:08,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:29:08,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:08,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180899792] [2020-07-29 01:29:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:08,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:08,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:08,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:29:08,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:08,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867089502] [2020-07-29 01:29:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:08,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:08,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:08,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:08,666 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:08,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:08,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:08,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:08,666 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:08,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:08,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:08,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2020-07-29 01:29:08,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:08,667 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:08,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:08,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:08,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:08,775 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:08,775 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:08,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:08,779 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:08,785 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:08,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:08,829 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,834 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:08,834 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:08,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:08,881 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:08,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:08,955 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,996 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:08,998 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:08,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:08,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:08,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:08,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:08,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:08,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:08,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:08,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2020-07-29 01:29:08,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:08,999 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:09,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,109 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:09,109 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:09,122 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:29:09,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:09,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:09,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:09,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:09,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:09,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,132 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:29:09,179 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:29:09,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:09,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:09,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:09,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:09,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:09,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:09,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 23 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,236 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:29:09,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:09,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:09,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:09,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:09,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:09,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:09,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:09,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:09,248 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:09,248 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2020-07-29 01:29:09,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:09,261 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:09,261 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:09,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,302 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:09,305 INFO L393 LassoCheck]: Loop: "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" [2020-07-29 01:29:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:09,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:09,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:09,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {801#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {801#unseeded} is VALID [2020-07-29 01:29:09,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {801#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {801#unseeded} is VALID [2020-07-29 01:29:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:09,339 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:09,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:09,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {804#(>= oldRank0 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {814#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~x2~0)) unseeded)} is VALID [2020-07-29 01:29:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:09,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:09,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,350 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:29:09,350 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:29:09,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2020-07-29 01:29:09,375 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:29:09,376 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:09,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:09,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:09,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:09,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:09,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:09,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:09,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:09,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-07-29 01:29:09,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:09,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:09,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:09,380 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:09,380 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:09,380 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:09,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:09,381 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:09,382 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 36 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:09,382 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:09,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:09,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:09,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:09,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:09,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:09,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:09,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:09,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:09,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:09,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:09,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:09,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:09,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:09,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:09,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:09,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:09,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:09,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:09,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:09,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:09,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:09,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,397 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:09,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:09,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:09,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:09,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:09,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:09,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:09,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2020-07-29 01:29:09,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:29:09,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:29:09,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-07-29 01:29:09,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:09,403 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:29:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-07-29 01:29:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2020-07-29 01:29:09,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:09,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 31 transitions. Second operand 15 states. [2020-07-29 01:29:09,406 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 31 transitions. Second operand 15 states. [2020-07-29 01:29:09,406 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 15 states. [2020-07-29 01:29:09,407 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:09,409 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 01:29:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-29 01:29:09,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:09,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:09,410 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 27 states and 31 transitions. [2020-07-29 01:29:09,410 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 27 states and 31 transitions. [2020-07-29 01:29:09,411 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:09,413 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 01:29:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-29 01:29:09,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:09,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:09,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:09,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:29:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 01:29:09,416 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:29:09,416 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:29:09,417 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:29:09,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:29:09,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:09,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:09,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:09,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2020-07-29 01:29:09,419 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:09,419 INFO L794 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 861#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 862#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 866#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 874#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 873#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 872#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 871#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 870#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 869#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 868#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 867#L21-2 assume !(main_~x2~0 > 1); 865#L21-3 main_~x1~0 := 1 + main_~x1~0; 863#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 864#L21-2 [2020-07-29 01:29:09,420 INFO L796 eck$LassoCheckResult]: Loop: 864#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 864#L21-2 [2020-07-29 01:29:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2020-07-29 01:29:09,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:09,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604927440] [2020-07-29 01:29:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:09,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:09,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:09,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:29:09,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:09,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482282022] [2020-07-29 01:29:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:09,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:09,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:09,447 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2020-07-29 01:29:09,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:09,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425711662] [2020-07-29 01:29:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:09,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:09,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:09,468 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:09,507 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:09,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:09,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:09,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:09,508 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:09,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:09,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:09,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2020-07-29 01:29:09,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:09,509 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:09,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,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:29:09,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:09,706 INFO L404 LassoAnalysis]: Checking for nontermination... 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:29:09,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:09,709 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,713 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:09,713 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:09,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:09,752 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 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:29:09,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:09,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:09,808 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:09,810 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:09,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:09,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:09,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:09,811 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:09,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:09,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:09,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2020-07-29 01:29:09,812 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:09,812 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:09,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:09,920 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:09,921 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:09,928 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:09,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:09,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:09,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:09,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:09,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:09,937 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:09,979 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:29:09,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:09,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:09,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:09,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:09,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:09,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:09,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:09,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:09,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:09,992 INFO L444 ModelExtractionUtils]: 0 out of 3 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:09,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:09,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:09,995 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:09,996 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:10,035 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:10,037 INFO L393 LassoCheck]: Loop: "assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1;" [2020-07-29 01:29:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:10,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {1038#unseeded} is VALID [2020-07-29 01:29:10,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {1038#unseeded} is VALID [2020-07-29 01:29:10,077 INFO L280 TraceCheckUtils]: 2: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,078 INFO L280 TraceCheckUtils]: 3: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,080 INFO L280 TraceCheckUtils]: 6: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,080 INFO L280 TraceCheckUtils]: 7: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,081 INFO L280 TraceCheckUtils]: 8: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,084 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#unseeded} assume !(main_~x2~0 > 1); {1038#unseeded} is VALID [2020-07-29 01:29:10,085 INFO L280 TraceCheckUtils]: 12: Hoare triple {1038#unseeded} main_~x1~0 := 1 + main_~x1~0; {1038#unseeded} is VALID [2020-07-29 01:29:10,086 INFO L280 TraceCheckUtils]: 13: Hoare triple {1038#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {1038#unseeded} is VALID [2020-07-29 01:29:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,089 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:10,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(>= oldRank0 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1051#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~x2~0)) unseeded)} is VALID [2020-07-29 01:29:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:10,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:10,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:10,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,105 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:29:10,105 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:29:10,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2020-07-29 01:29:10,126 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:29:10,126 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:10,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:10,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-07-29 01:29:10,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,129 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,130 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:10,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,130 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 33 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:10,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,142 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,143 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:10,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {1038#unseeded} is VALID [2020-07-29 01:29:10,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {1038#unseeded} is VALID [2020-07-29 01:29:10,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,179 INFO L280 TraceCheckUtils]: 7: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#unseeded} assume !(main_~x2~0 > 1); {1038#unseeded} is VALID [2020-07-29 01:29:10,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {1038#unseeded} main_~x1~0 := 1 + main_~x1~0; {1038#unseeded} is VALID [2020-07-29 01:29:10,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {1038#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {1038#unseeded} is VALID [2020-07-29 01:29:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,186 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:10,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(>= oldRank0 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1051#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~x2~0)) unseeded)} is VALID [2020-07-29 01:29:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:10,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:10,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:10,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,195 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:10,195 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:29:10,211 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2020-07-29 01:29:10,211 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:29:10,211 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:10,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:10,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-07-29 01:29:10,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,214 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,214 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,214 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:10,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,214 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,215 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 33 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:10,215 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:10,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:10,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:10,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,227 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:10,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,228 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:10,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {1038#unseeded} is VALID [2020-07-29 01:29:10,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {1038#unseeded} is VALID [2020-07-29 01:29:10,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,263 INFO L280 TraceCheckUtils]: 3: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,266 INFO L280 TraceCheckUtils]: 8: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,267 INFO L280 TraceCheckUtils]: 10: Hoare triple {1038#unseeded} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1038#unseeded} is VALID [2020-07-29 01:29:10,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#unseeded} assume !(main_~x2~0 > 1); {1038#unseeded} is VALID [2020-07-29 01:29:10,269 INFO L280 TraceCheckUtils]: 12: Hoare triple {1038#unseeded} main_~x1~0 := 1 + main_~x1~0; {1038#unseeded} is VALID [2020-07-29 01:29:10,269 INFO L280 TraceCheckUtils]: 13: Hoare triple {1038#unseeded} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {1038#unseeded} is VALID [2020-07-29 01:29:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,272 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:10,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(>= oldRank0 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; {1051#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~x2~0)) unseeded)} is VALID [2020-07-29 01:29:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:10,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:10,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:10,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,283 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:10,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:29:10,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2020-07-29 01:29:10,304 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:29:10,304 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:10,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:10,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:29:10,311 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:10,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:10,311 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,311 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,311 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:10,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:10,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:10,313 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 20 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:10,313 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:10,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:10,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:10,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:10,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:10,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:10,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,322 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:29:10,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:29:10,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:29:10,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:29:10,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:10,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:10,325 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:10,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-29 01:29:10,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:10,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:10,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:10,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:10,326 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:10,326 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:10,326 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:10,326 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 01:29:10,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:10,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:10,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:10,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:10 BoogieIcfgContainer [2020-07-29 01:29:10,334 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:10,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:10,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:10,335 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:10,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:03" (3/4) ... [2020-07-29 01:29:10,339 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:10,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:10,343 INFO L168 Benchmark]: Toolchain (without parser) took 7614.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:10,343 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:10,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.87 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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:29:10,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:10,345 INFO L168 Benchmark]: Boogie Preprocessor took 93.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:10,346 INFO L168 Benchmark]: RCFGBuilder took 269.62 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.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:10,346 INFO L168 Benchmark]: BuchiAutomizer took 6938.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.7 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:10,347 INFO L168 Benchmark]: Witness Printer took 5.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:10,349 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.87 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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 40.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.62 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.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6938.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.7 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 5.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 31 SDslu, 52 SDs, 0 SdLazy, 161 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...