./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/CookSeeZuleger-TACAS2013-Fig8a-modified.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 06c9e9e5fbbf1cc74be5b07da6214ee5470bdc6403e06237275b94d0a60c1592 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:53,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:53,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:53,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:53,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:53,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:53,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:53,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:53,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:53,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:53,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:53,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:53,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:53,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:53,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:53,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:53,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:53,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:53,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:53,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:53,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:53,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:53,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:53,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:53,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:53,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:53,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:53,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:53,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:53,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:53,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:53,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:53,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:53,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:53,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:53,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:53,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:53,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:53,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:53,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:53,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:53,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:24:53,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:53,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:53,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:53,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:53,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:53,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:53,731 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:53,732 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:53,732 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:53,732 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:53,733 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:53,733 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:53,733 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:53,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:53,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:53,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:53,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:53,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:53,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:53,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:53,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:53,734 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:53,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:53,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:53,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:53,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:53,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:53,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:53,736 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:53,736 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 06c9e9e5fbbf1cc74be5b07da6214ee5470bdc6403e06237275b94d0a60c1592 [2022-02-21 03:24:53,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:53,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:53,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:53,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:53,964 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:53,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c [2022-02-21 03:24:54,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0023b091/4766e963f0ce4f06a49bb8dee73e1b0a/FLAG138e9c028 [2022-02-21 03:24:54,378 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:54,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c [2022-02-21 03:24:54,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0023b091/4766e963f0ce4f06a49bb8dee73e1b0a/FLAG138e9c028 [2022-02-21 03:24:54,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0023b091/4766e963f0ce4f06a49bb8dee73e1b0a [2022-02-21 03:24:54,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:54,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:54,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:54,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:54,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:54,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:54" (1/1) ... [2022-02-21 03:24:54,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26061065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:54, skipping insertion in model container [2022-02-21 03:24:54,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:54" (1/1) ... [2022-02-21 03:24:54,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:54,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:55,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:55,033 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:55,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:55,071 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:55,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55 WrapperNode [2022-02-21 03:24:55,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:55,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:55,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:55,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:55,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,106 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2022-02-21 03:24:55,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:55,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:55,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:55,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:55,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:55,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:55,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:55,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:55,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (1/1) ... [2022-02-21 03:24:55,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:55,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:55,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:55,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:24:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:55,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:55,233 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:55,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:55,284 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:55,289 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:55,290 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:24:55,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:55 BoogieIcfgContainer [2022-02-21 03:24:55,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:55,292 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:55,292 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:55,294 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:55,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:55,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:54" (1/3) ... [2022-02-21 03:24:55,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430bbe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:55, skipping insertion in model container [2022-02-21 03:24:55,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:55,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:55" (2/3) ... [2022-02-21 03:24:55,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430bbe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:55, skipping insertion in model container [2022-02-21 03:24:55,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:55,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:55" (3/3) ... [2022-02-21 03:24:55,298 INFO L388 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig8a-modified.c [2022-02-21 03:24:55,332 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:55,333 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:55,333 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:55,333 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:55,333 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:55,333 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:55,333 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:55,334 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:55,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:55,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:55,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:55,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:55,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:55,364 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:55,364 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:55,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:55,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:55,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:55,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:55,366 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:55,367 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:55,371 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 7#L18-2true [2022-02-21 03:24:55,372 INFO L793 eck$LassoCheckResult]: Loop: 7#L18-2true assume !!(main_~x~0#1 != main_~K~0#1); 5#L18true assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; 7#L18-2true [2022-02-21 03:24:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:24:55,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:55,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255052858] [2022-02-21 03:24:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:55,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:55,451 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-02-21 03:24:55,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:55,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220028062] [2022-02-21 03:24:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:55,486 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:55,491 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-02-21 03:24:55,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:55,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104187963] [2022-02-21 03:24:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:55,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:55,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:55,509 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:55,603 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:55,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:55,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:55,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:55,605 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:55,605 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:55,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:55,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:55,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration1_Loop [2022-02-21 03:24:55,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:55,606 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:55,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:55,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:55,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:55,780 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:55,781 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:55,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:55,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:55,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:55,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:55,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:55,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:55,831 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:55,831 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: [] [2022-02-21 03:24:55,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:55,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:55,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:55,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:55,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:55,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:55,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:55,904 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:55,904 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: [] [2022-02-21 03:24:55,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:55,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:55,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:24:55,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:55,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:55,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:55,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:55,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:24:55,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:55,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:56,148 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:56,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:56,156 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:56,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:56,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:56,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:56,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:56,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:56,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:56,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:56,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration1_Loop [2022-02-21 03:24:56,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:56,157 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:56,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:56,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:56,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:56,272 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:56,276 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:56,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:56,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:56,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:56,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:56,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:56,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:56,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:56,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:56,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:24:56,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:56,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:56,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:56,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:56,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:56,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:24:56,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:56,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:56,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:56,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:56,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:56,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:56,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:56,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:56,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:56,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:56,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:24:56,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:56,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:56,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:56,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:56,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:56,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:56,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:56,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:56,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:56,463 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:56,463 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:56,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:56,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:56,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:56,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:24:56,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:56,512 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:56,512 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:56,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~K~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~K~0#1 Supporting invariants [] [2022-02-21 03:24:56,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:24:56,549 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:56,554 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 != main_~K~0#1);" "assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1;" [2022-02-21 03:24:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:56,585 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:56,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:56,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#unseeded} assume { :begin_inline_ULTIMATE.init } true; {18#unseeded} is VALID [2022-02-21 03:24:56,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {18#unseeded} is VALID [2022-02-21 03:24:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:56,605 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:56,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:56,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 != main_~K~0#1); {39#(and (not (= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:24:56,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (not (= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {31#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:24:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:56,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:56,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,694 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 [2022-02-21 03:24:56,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,742 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 8 states. [2022-02-21 03:24:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:56,743 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:56,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:56,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:56,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:56,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:56,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:56,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:56,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:24:56,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:56,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:56,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:56,749 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:56,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:56,750 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:56,751 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:56,752 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:56,752 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:56,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:56,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:56,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:56,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:56,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:56,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:56,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:56,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:56,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:56,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:56,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:56,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:56,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:56,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:56,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:56,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:56,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:56,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:56,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:56,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:56,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:56,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:56,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:56,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:56,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,763 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-02-21 03:24:56,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:56,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:56,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:24:56,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:56,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:56,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:56,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-02-21 03:24:56,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:56,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:56,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-02-21 03:24:56,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:56,776 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-02-21 03:24:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:24:56,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:56,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,795 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,799 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,802 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:56,804 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:24:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:56,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:56,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:56,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:24:56,806 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:24:56,806 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:56,807 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:24:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:56,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:56,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:56,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:56,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:24:56,811 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:56,811 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:56,811 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:56,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:56,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:56,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:56,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:56,812 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:56,812 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:56,813 INFO L791 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 85#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 78#L18 assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; 79#L18-2 [2022-02-21 03:24:56,813 INFO L793 eck$LassoCheckResult]: Loop: 79#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 84#L18 assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; 79#L18-2 [2022-02-21 03:24:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-02-21 03:24:56,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:56,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237575474] [2022-02-21 03:24:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:56,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:56,824 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2022-02-21 03:24:56,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:56,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001774133] [2022-02-21 03:24:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:56,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:56,859 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2022-02-21 03:24:56,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:56,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640511160] [2022-02-21 03:24:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:56,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#true} assume { :begin_inline_ULTIMATE.init } true; {133#true} is VALID [2022-02-21 03:24:56,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {133#true} is VALID [2022-02-21 03:24:56,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} assume !!(main_~x~0#1 != main_~K~0#1); {133#true} is VALID [2022-02-21 03:24:56,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#true} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {135#(<= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:24:56,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {135#(<= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 != main_~K~0#1); {136#(and (<= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:24:56,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#(and (<= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {134#false} is VALID [2022-02-21 03:24:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:56,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:56,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640511160] [2022-02-21 03:24:56,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640511160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:56,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:56,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:24:56,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217926814] [2022-02-21 03:24:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:56,960 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:56,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:56,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:56,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:56,961 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:56,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:56,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:56,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:56,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration2_Loop [2022-02-21 03:24:56,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:56,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:56,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:56,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:56,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,033 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:57,033 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:57,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,035 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:24:57,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:57,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:57,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:57,063 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: [] [2022-02-21 03:24:57,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:24:57,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:24:57,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:57,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:57,143 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:57,143 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: [] [2022-02-21 03:24:57,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:24:57,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:57,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:57,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,241 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:24:57,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:57,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:57,372 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:57,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,379 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:57,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:57,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:57,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:57,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:57,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:57,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:57,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration2_Loop [2022-02-21 03:24:57,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:57,380 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:57,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,448 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:57,448 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,450 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:24:57,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:57,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:57,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:57,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:57,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:57,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:57,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:57,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:57,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,504 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:24:57,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:57,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:57,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:57,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:57,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:57,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:57,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:57,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:57,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:57,564 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:57,564 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,576 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:24:57,581 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:57,581 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:57,581 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:57,581 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~K~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~K~0#1 Supporting invariants [] [2022-02-21 03:24:57,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,613 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:57,625 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 != main_~K~0#1);" "assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1;" [2022-02-21 03:24:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:57,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:57,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:57,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#unseeded} assume { :begin_inline_ULTIMATE.init } true; {137#unseeded} is VALID [2022-02-21 03:24:57,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {137#unseeded} is VALID [2022-02-21 03:24:57,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {137#unseeded} is VALID [2022-02-21 03:24:57,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {137#unseeded} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {137#unseeded} is VALID [2022-02-21 03:24:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:57,660 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:57,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:57,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#(>= oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 != main_~K~0#1); {164#(and (not (= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:24:57,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#(and (not (= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {150#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~K~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:24:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:57,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:57,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,687 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 [2022-02-21 03:24:57,687 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:24:57,704 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 [2022-02-21 03:24:57,704 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:57,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:57,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:57,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:57,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:57,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:57,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:57,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:24:57,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:57,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:57,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:57,706 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:57,706 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:57,713 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:57,714 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:57,714 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:57,715 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:57,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:57,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:57,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:57,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:57,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:57,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:57,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:57,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:57,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:57,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:57,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:57,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:57,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:57,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:57,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:57,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:57,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:57,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:57,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:57,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:57,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,723 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:24:57,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:57,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:57,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:57,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:57,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:57,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:57,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:24:57,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:24:57,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:24:57,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:24:57,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:57,730 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:24:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:24:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:24:57,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:57,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,732 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,732 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:57,734 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:24:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:24:57,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:57,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:57,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:24:57,735 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:24:57,736 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:57,737 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:24:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:24:57,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:57,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:57,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:57,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:24:57,740 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:24:57,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:24:57,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:57,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:24:57,807 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:57,833 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:24:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:24:57,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:57,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-02-21 03:24:57,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:57,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 12 transitions. [2022-02-21 03:24:57,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:24:57,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:24:57,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2022-02-21 03:24:57,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:57,846 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:24:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2022-02-21 03:24:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2022-02-21 03:24:57,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:57,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,847 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,848 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,848 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:57,849 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2022-02-21 03:24:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:57,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:57,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:57,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states and 12 transitions. [2022-02-21 03:24:57,850 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states and 12 transitions. [2022-02-21 03:24:57,850 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:57,851 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2022-02-21 03:24:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:57,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:57,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:57,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:57,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2022-02-21 03:24:57,852 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:24:57,852 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:24:57,852 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:57,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2022-02-21 03:24:57,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:57,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:57,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:57,853 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:57,853 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:57,854 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 272#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 266#L18 [2022-02-21 03:24:57,854 INFO L793 eck$LassoCheckResult]: Loop: 266#L18 assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; 267#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 266#L18 [2022-02-21 03:24:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:24:57,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:57,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261555954] [2022-02-21 03:24:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:57,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:57,865 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:57,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2022-02-21 03:24:57,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:57,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445631681] [2022-02-21 03:24:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:57,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:57,877 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 28699749, now seen corresponding path program 2 times [2022-02-21 03:24:57,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:57,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781111240] [2022-02-21 03:24:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:57,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:57,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:57,904 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:57,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:57,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:57,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:57,905 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:57,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:57,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:57,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration3_Loop [2022-02-21 03:24:57,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:57,906 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:57,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:57,973 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:57,973 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:57,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:57,975 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:57,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:24:57,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:57,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:57,996 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:57,996 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: [] [2022-02-21 03:24:58,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:58,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,017 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:24:58,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:58,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:58,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:58,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,060 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:24:58,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:58,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:58,293 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:58,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:58,297 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:58,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:58,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:58,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:58,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:58,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:58,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:58,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration3_Loop [2022-02-21 03:24:58,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:58,297 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:58,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:58,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:58,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:58,375 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:58,376 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:58,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,381 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:58,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:58,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:58,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:58,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:58,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:58,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:58,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:58,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:24:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:58,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,446 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:24:58,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:58,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:58,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:58,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:58,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:58,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:58,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:58,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:58,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:58,483 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:58,483 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:58,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,485 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:24:58,505 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:58,505 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:58,505 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:58,505 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~K~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~K~0#1 Supporting invariants [] [2022-02-21 03:24:58,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:58,537 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:58,543 INFO L390 LassoCheck]: Loop: "assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1;" "assume !!(main_~x~0#1 != main_~K~0#1);" [2022-02-21 03:24:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:58,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:58,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:58,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#unseeded} assume { :begin_inline_ULTIMATE.init } true; {328#unseeded} is VALID [2022-02-21 03:24:58,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {328#unseeded} is VALID [2022-02-21 03:24:58,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {328#unseeded} is VALID [2022-02-21 03:24:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:58,575 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:58,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:58,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#(>= oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {352#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} is VALID [2022-02-21 03:24:58,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} assume !!(main_~x~0#1 != main_~K~0#1); {341#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:58,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:58,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,636 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 [2022-02-21 03:24:58,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 14 transitions. Complement of second has 5 states. [2022-02-21 03:24:58,652 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 [2022-02-21 03:24:58,652 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:58,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:58,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:58,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:58,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:58,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:58,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:58,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:24:58,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:58,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:58,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:58,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:58,655 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:58,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:58,656 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:58,656 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:58,656 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:58,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:58,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:58,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:58,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:58,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:58,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:58,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:58,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:58,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:58,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:58,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:58,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:58,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:58,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:58,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:58,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:58,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:58,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:58,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:58,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:58,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:58,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,666 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:24:58,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:58,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:58,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:58,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:58,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:58,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:58,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-02-21 03:24:58,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:58,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:24:58,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-02-21 03:24:58,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:58,670 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:24:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-02-21 03:24:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2022-02-21 03:24:58,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:58,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,671 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,672 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,672 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:58,673 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:24:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:24:58,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:58,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:58,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 9 transitions. [2022-02-21 03:24:58,673 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 9 transitions. [2022-02-21 03:24:58,674 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:58,675 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:24:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:24:58,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:58,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:58,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:58,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:24:58,676 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:58,676 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:58,676 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:58,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:24:58,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:58,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:58,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:58,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-02-21 03:24:58,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:58,677 INFO L791 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 381#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 377#L18 assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; 378#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 375#L18 [2022-02-21 03:24:58,677 INFO L793 eck$LassoCheckResult]: Loop: 375#L18 assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; 376#L18-2 assume !!(main_~x~0#1 != main_~K~0#1); 375#L18 [2022-02-21 03:24:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:58,678 INFO L85 PathProgramCache]: Analyzing trace with hash 28699811, now seen corresponding path program 2 times [2022-02-21 03:24:58,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:58,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18318918] [2022-02-21 03:24:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:58,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:58,686 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2022-02-21 03:24:58,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:58,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908552417] [2022-02-21 03:24:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:58,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:58,695 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1810715040, now seen corresponding path program 2 times [2022-02-21 03:24:58,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:58,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220814478] [2022-02-21 03:24:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:58,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true; {437#true} is VALID [2022-02-21 03:24:58,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {437#true} is VALID [2022-02-21 03:24:58,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} assume !!(main_~x~0#1 != main_~K~0#1); {437#true} is VALID [2022-02-21 03:24:58,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#true} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {439#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~K~0#1| 1))} is VALID [2022-02-21 03:24:58,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {439#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~K~0#1| 1))} assume !!(main_~x~0#1 != main_~K~0#1); {439#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~K~0#1| 1))} is VALID [2022-02-21 03:24:58,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~K~0#1| 1))} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {440#(and (<= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~K~0#1| 1)))} is VALID [2022-02-21 03:24:58,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(and (<= |ULTIMATE.start_main_~K~0#1| |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~K~0#1| 1)))} assume !!(main_~x~0#1 != main_~K~0#1); {438#false} is VALID [2022-02-21 03:24:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:58,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:58,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220814478] [2022-02-21 03:24:58,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220814478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:58,729 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:58,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:24:58,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39171388] [2022-02-21 03:24:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:58,744 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:58,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:58,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:58,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:58,745 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:58,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:58,745 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:58,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration4_Loop [2022-02-21 03:24:58,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:58,745 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:58,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:58,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:58,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:58,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:58,794 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:58,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,795 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:58,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:58,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:24:58,824 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:58,824 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:58,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:58,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,884 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:24:58,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:58,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:58,925 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:58,926 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:58,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:24:58,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:58,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:58,972 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:58,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:24:58,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:58,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:59,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:59,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:59,022 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:59,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:24:59,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:59,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:59,341 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:59,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:59,348 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:59,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:59,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:59,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:59,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:59,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:59,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:59,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:59,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration4_Loop [2022-02-21 03:24:59,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:59,348 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:59,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:59,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:59,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:59,412 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:59,412 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:59,417 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:59,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:24:59,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:59,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:59,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:59,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:59,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:59,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:59,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:59,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:59,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:59,470 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:59,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:24:59,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:59,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:59,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:59,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:59,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:59,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:59,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:59,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:59,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:59,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:59,507 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:59,509 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:59,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:24:59,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:24:59,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:59,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:59,550 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:59,550 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~K~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~K~0#1 Supporting invariants [] [2022-02-21 03:24:59,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:59,570 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:59,573 INFO L390 LassoCheck]: Loop: "assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1;" "assume !!(main_~x~0#1 != main_~K~0#1);" [2022-02-21 03:24:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:59,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#unseeded} assume { :begin_inline_ULTIMATE.init } true; {441#unseeded} is VALID [2022-02-21 03:24:59,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {441#unseeded} is VALID [2022-02-21 03:24:59,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {441#unseeded} is VALID [2022-02-21 03:24:59,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#unseeded} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {441#unseeded} is VALID [2022-02-21 03:24:59,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {441#unseeded} is VALID [2022-02-21 03:24:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,604 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:59,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(>= oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {471#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} is VALID [2022-02-21 03:24:59,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} assume !!(main_~x~0#1 != main_~K~0#1); {454#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:59,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:59,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,644 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 [2022-02-21 03:24:59,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 9 transitions. Complement of second has 3 states. [2022-02-21 03:24:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:59,653 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:59,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:59,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:59,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:24:59,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:59,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:59,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:59,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,655 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:59,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:59,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,656 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:59,656 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,656 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:59,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:59,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:59,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:59,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:59,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:59,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:59,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,665 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2022-02-21 03:24:59,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,666 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:59,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#unseeded} assume { :begin_inline_ULTIMATE.init } true; {441#unseeded} is VALID [2022-02-21 03:24:59,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {441#unseeded} is VALID [2022-02-21 03:24:59,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {441#unseeded} is VALID [2022-02-21 03:24:59,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#unseeded} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {441#unseeded} is VALID [2022-02-21 03:24:59,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {441#unseeded} is VALID [2022-02-21 03:24:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,691 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:59,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(>= oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {503#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} is VALID [2022-02-21 03:24:59,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} assume !!(main_~x~0#1 != main_~K~0#1); {454#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:59,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:59,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:59,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 9 transitions. Complement of second has 3 states. [2022-02-21 03:24:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:59,738 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:59,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:59,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:59,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:24:59,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:59,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:59,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:59,740 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,740 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:59,740 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:59,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,741 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:59,741 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,741 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:59,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:59,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:59,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:59,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,748 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2022-02-21 03:24:59,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,749 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:59,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#unseeded} assume { :begin_inline_ULTIMATE.init } true; {441#unseeded} is VALID [2022-02-21 03:24:59,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~K~0#1, main_~x~0#1;havoc main_~K~0#1;havoc main_~x~0#1;main_~K~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {441#unseeded} is VALID [2022-02-21 03:24:59,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {441#unseeded} is VALID [2022-02-21 03:24:59,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#unseeded} assume !(main_~x~0#1 > main_~K~0#1);main_~x~0#1 := 1 + main_~x~0#1; {441#unseeded} is VALID [2022-02-21 03:24:59,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#unseeded} assume !!(main_~x~0#1 != main_~K~0#1); {441#unseeded} is VALID [2022-02-21 03:24:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,778 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:59,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:59,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(>= oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))} assume main_~x~0#1 > main_~K~0#1;main_~x~0#1 := main_~x~0#1 - 1; {535#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} is VALID [2022-02-21 03:24:59,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~K~0#1| oldRank0)))} assume !!(main_~x~0#1 != main_~K~0#1); {454#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~K~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:59,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:59,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,826 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 2 loop predicates [2022-02-21 03:24:59,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 10 transitions. Complement of second has 4 states. [2022-02-21 03:24:59,842 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 [2022-02-21 03:24:59,842 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:59,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:59,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:59,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:59,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:59,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:59,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:24:59,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,844 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,844 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:59,844 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:59,845 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:59,845 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,845 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:59,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:59,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:59,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:59,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:59,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:59,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:59,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:59,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:59,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:59,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:59,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:59,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:59,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:59,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:59,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,850 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:59,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:59,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:59,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:59,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:59,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:59,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2022-02-21 03:24:59,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:59,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:59,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:59,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:59,853 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:59,853 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:59,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:59,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:24:59,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:24:59,854 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:59,854 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:24:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:24:59,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:59,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:59,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:24:59,859 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:24:59,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:59,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:59,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:59,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:59,859 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:59,860 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:59,860 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:59,860 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:59,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:59,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:59,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:59,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:59 BoogieIcfgContainer [2022-02-21 03:24:59,865 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:59,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:59,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:59,866 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:59,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:55" (3/4) ... [2022-02-21 03:24:59,868 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:59,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:59,869 INFO L158 Benchmark]: Toolchain (without parser) took 5071.41ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 98.1MB in the beginning and 84.9MB in the end (delta: 13.2MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-02-21 03:24:59,869 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:59,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.70ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 98.1MB in the beginning and 122.2MB in the end (delta: -24.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:59,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.65ms. Allocated memory is still 146.8MB. Free memory was 122.2MB in the beginning and 120.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:59,870 INFO L158 Benchmark]: Boogie Preprocessor took 18.70ms. Allocated memory is still 146.8MB. Free memory was 120.9MB in the beginning and 120.0MB in the end (delta: 896.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:59,870 INFO L158 Benchmark]: RCFGBuilder took 164.35ms. Allocated memory is still 146.8MB. Free memory was 120.0MB in the beginning and 112.1MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:59,870 INFO L158 Benchmark]: BuchiAutomizer took 4573.27ms. Allocated memory is still 146.8MB. Free memory was 111.7MB in the beginning and 84.9MB in the end (delta: 26.8MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-02-21 03:24:59,870 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 146.8MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:59,871 INFO L339 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.20ms. Allocated memory is still 121.6MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.70ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 98.1MB in the beginning and 122.2MB in the end (delta: -24.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.65ms. Allocated memory is still 146.8MB. Free memory was 122.2MB in the beginning and 120.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.70ms. Allocated memory is still 146.8MB. Free memory was 120.9MB in the beginning and 120.0MB in the end (delta: 896.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 164.35ms. Allocated memory is still 146.8MB. Free memory was 120.0MB in the beginning and 112.1MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4573.27ms. Allocated memory is still 146.8MB. Free memory was 111.7MB in the beginning and 84.9MB in the end (delta: 26.8MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 146.8MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function K + -1 * x and consists of 5 locations. One deterministic module has affine ranking function K + -1 * x and consists of 3 locations. One deterministic module has affine ranking function x + -1 * K and consists of 3 locations. One nondeterministic module has affine ranking function x + -1 * K and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 29 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax182 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf95 smp68 dnf100 smp100 tf112 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:59,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:00,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE