./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.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/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:02,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:02,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:02,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:02,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:02,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:02,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:02,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:02,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:02,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:02,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:02,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:02,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:02,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:02,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:02,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:02,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:02,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:02,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:02,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:02,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:02,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:02,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:02,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:02,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:02,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:02,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:02,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:02,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:02,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:02,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:02,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:02,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:02,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:02,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:02,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:02,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:02,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:02,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:02,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:02,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:02,622 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:25:02,642 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:02,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:02,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:02,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:02,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:02,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:02,644 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:02,644 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:02,644 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:02,644 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:02,645 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:02,645 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:02,645 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:02,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:02,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:02,646 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:02,647 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:02,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:02,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:02,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:02,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:02,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:02,649 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:02,649 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 -> 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 [2022-02-21 03:25:02,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:02,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:02,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:02,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:02,876 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:02,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2022-02-21 03:25:02,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f455bb0/9edf368ecd2d41d0ae4e54c8a0a25a5d/FLAG61936e504 [2022-02-21 03:25:03,223 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:03,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2022-02-21 03:25:03,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f455bb0/9edf368ecd2d41d0ae4e54c8a0a25a5d/FLAG61936e504 [2022-02-21 03:25:03,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f455bb0/9edf368ecd2d41d0ae4e54c8a0a25a5d [2022-02-21 03:25:03,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:03,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:03,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:03,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:03,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:03,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcb8aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03, skipping insertion in model container [2022-02-21 03:25:03,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:03,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:03,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:03,854 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:03,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:03,881 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:03,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03 WrapperNode [2022-02-21 03:25:03,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:03,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:03,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:03,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:03,911 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:25:03" (1/1) ... [2022-02-21 03:25:03,915 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:25:03" (1/1) ... [2022-02-21 03:25:03,948 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-21 03:25:03,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:03,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:03,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:03,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:03,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:03,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:03,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:03,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:03,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:04,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:04,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:04,036 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:25:04,038 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:25:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:04,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:04,126 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:04,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:04,273 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:04,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:04,278 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:25:04,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:04 BoogieIcfgContainer [2022-02-21 03:25:04,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:04,279 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:04,279 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:04,297 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:04,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:04,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:03" (1/3) ... [2022-02-21 03:25:04,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f3e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:04, skipping insertion in model container [2022-02-21 03:25:04,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:04,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03" (2/3) ... [2022-02-21 03:25:04,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f3e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:04, skipping insertion in model container [2022-02-21 03:25:04,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:04,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:04" (3/3) ... [2022-02-21 03:25:04,300 INFO L388 chiAutomizerObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2022-02-21 03:25:04,336 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:04,336 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:04,336 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:04,336 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:04,336 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:04,336 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:04,336 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:04,336 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:04,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:04,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:04,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:04,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:04,403 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:25:04,403 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:04,403 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:04,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:04,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:04,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:04,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:04,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:25:04,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:04,410 INFO L791 eck$LassoCheckResult]: Stem: 4#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6#L21true assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; 9#L22-2true [2022-02-21 03:25:04,410 INFO L793 eck$LassoCheckResult]: Loop: 9#L22-2true assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 5#L24-2true assume !(main_~y~0#1 < main_~z~0#1); 10#L24-3true main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 9#L22-2true [2022-02-21 03:25:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:04,418 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 03:25:04,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:04,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099922859] [2022-02-21 03:25:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,520 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 43923, now seen corresponding path program 1 times [2022-02-21 03:25:04,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:04,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765778348] [2022-02-21 03:25:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,542 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:04,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:04,544 INFO L85 PathProgramCache]: Analyzing trace with hash 889513810, now seen corresponding path program 1 times [2022-02-21 03:25:04,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:04,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023199368] [2022-02-21 03:25:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,564 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:04,630 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:04,631 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:04,631 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:04,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:04,632 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:04,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:04,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:04,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:04,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration1_Loop [2022-02-21 03:25:04,633 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:04,633 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:04,648 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:25:04,657 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:25:04,661 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:25:04,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:04,741 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:04,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:04,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:04,745 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:25:04,746 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:25:04,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:04,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:04,773 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:04,773 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:25:04,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:25:04,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:04,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:04,834 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:25:04,835 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:25:04,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:04,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:04,854 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:04,854 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:25:04,894 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:25:04,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:04,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:04,905 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:25:04,949 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:25:04,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:04,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:05,012 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:25:05,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,024 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:25:05,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:05,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:05,071 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:25:05,310 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:05,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:25:05,345 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:05,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:05,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:05,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:05,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:05,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,346 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:05,346 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:05,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration1_Loop [2022-02-21 03:25:05,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:05,346 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:05,347 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:25:05,353 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:25:05,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:25:05,446 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:05,450 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:05,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,471 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:25:05,473 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:25:05,474 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:25:05,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:05,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:05,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:05,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:05,532 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:25:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,534 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:25:05,535 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:25:05,536 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:25:05,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:05,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:05,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:05,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:05,600 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:25:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,606 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:25:05,611 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:25:05,612 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:25:05,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:05,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:05,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:05,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:05,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:05,664 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:25:05,665 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 03:25:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,667 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:25:05,672 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:25:05,675 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:25:05,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,681 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:25:05,684 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:25:05,684 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:25:05,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:05,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:25:05,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,729 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:25:05,730 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:25:05,732 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:25:05,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,740 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:25:05,761 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:25:05,762 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:25:05,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:05,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:05,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,812 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:25:05,813 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:25:05,814 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:25:05,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:05,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,821 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:25:05,825 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:25:05,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:05,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:05,877 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:25:05,877 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:25:05,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,895 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:25:05,916 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:05,916 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:05,916 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:05,916 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0#1 f1 = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:25:05,917 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:25:05,932 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:25:05,950 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:05,959 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1;" "assume !(main_~y~0#1 < main_~z~0#1);" "main_~y~0#1 := main_~x~0#1 + main_~y~0#1;" [2022-02-21 03:25:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:06,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#unseeded} assume { :begin_inline_ULTIMATE.init } true; {20#unseeded} is VALID [2022-02-21 03:25:06,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {20#unseeded} is VALID [2022-02-21 03:25:06,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {20#unseeded} is VALID [2022-02-21 03:25:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,027 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:06,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(and (>= oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)))} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {45#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} is VALID [2022-02-21 03:25:06,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} assume !(main_~y~0#1 < main_~z~0#1); {45#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} is VALID [2022-02-21 03:25:06,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {34#(or (and (>= oldRank0 0) (> oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0))) (and (> oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 0)) unseeded)} is VALID [2022-02-21 03:25:06,331 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:25:06,349 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:25:06,356 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:25:06,357 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:25:06,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,362 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:25:06,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 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:25:06,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:25:06,484 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 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 35 states and 48 transitions. Complement of second has 8 states. [2022-02-21 03:25:06,484 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:25:06,484 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:06,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,491 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:25:06,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:25:06,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2022-02-21 03:25:06,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,501 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:06,502 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:25:06,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:25:06,503 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:06,503 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 48 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:06,503 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,504 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:25:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,504 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:25:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 1 letters. [2022-02-21 03:25:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,505 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 1 letters. [2022-02-21 03:25:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 35 letters. Loop has 35 letters. [2022-02-21 03:25:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,505 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 35 letters. Loop has 35 letters. [2022-02-21 03:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 10 letters. Loop has 10 letters. [2022-02-21 03:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,506 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 10 letters. Loop has 10 letters. [2022-02-21 03:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,506 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 5 letters. [2022-02-21 03:25:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 1 letters. [2022-02-21 03:25:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,507 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 1 letters. [2022-02-21 03:25:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,507 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:25:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 3 letters. [2022-02-21 03:25:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,508 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 3 letters. [2022-02-21 03:25:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,509 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 2 letters. Loop has 1 letters. [2022-02-21 03:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,509 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:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 1 letters. [2022-02-21 03:25:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 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 1 letters. [2022-02-21 03:25:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 3 letters. [2022-02-21 03:25:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 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 3 letters. [2022-02-21 03:25:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 3 letters. [2022-02-21 03:25:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,510 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 3 letters. [2022-02-21 03:25:06,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,511 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:06,524 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:25:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-21 03:25:06,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:06,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:06,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:25:06,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:06,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 11 states and 15 transitions. [2022-02-21 03:25:06,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:25:06,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:25:06,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-02-21 03:25:06,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:06,532 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:25:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-02-21 03:25:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:25:06,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:06,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:25:06,548 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:25:06,549 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:25:06,551 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:06,552 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:25:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:25:06,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:06,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:06,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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 11 states and 15 transitions. [2022-02-21 03:25:06,553 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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 11 states and 15 transitions. [2022-02-21 03:25:06,553 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:06,554 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:25:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:25:06,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:06,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:06,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:06,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:25:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-02-21 03:25:06,556 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:25:06,556 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:25:06,556 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:06,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:25:06,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,557 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:25:06,557 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:25:06,557 INFO L791 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 99#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 104#L21 assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; 105#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 100#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 101#L24-2 [2022-02-21 03:25:06,558 INFO L793 eck$LassoCheckResult]: Loop: 101#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 101#L24-2 [2022-02-21 03:25:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash 28693995, now seen corresponding path program 1 times [2022-02-21 03:25:06,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:06,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032402240] [2022-02-21 03:25:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,570 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2022-02-21 03:25:06,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:06,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948433287] [2022-02-21 03:25:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,576 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 889513868, now seen corresponding path program 2 times [2022-02-21 03:25:06,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:06,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60586667] [2022-02-21 03:25:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,590 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:06,604 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:06,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:06,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:06,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:06,605 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:06,605 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:06,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:06,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration2_Loop [2022-02-21 03:25:06,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:06,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:06,606 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:25:06,608 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:25:06,610 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:25:06,612 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:25:06,661 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:06,661 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,662 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:25:06,663 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:25:06,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,686 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:06,686 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:25:06,702 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:25:06,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,703 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:25:06,704 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:25:06,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,742 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:25:06,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,744 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:25:06,745 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:25:06,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:06,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:06,768 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=-3}, {ULTIMATE.start_main_~x~0#1=3}, {ULTIMATE.start_main_~x~0#1=1}] Lambdas: [2, 1, 1] Nus: [1, 0] [2022-02-21 03:25:06,784 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:25:06,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,785 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:25:06,787 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:25:06,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,808 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:06,809 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:25:06,824 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:25:06,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,826 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:25:06,827 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:25:06,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:25:06,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,852 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:25:06,853 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:25:06,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:06,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:07,014 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:07,017 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:25:07,018 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:07,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:07,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:07,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:07,019 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:07,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:07,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:07,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration2_Loop [2022-02-21 03:25:07,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:07,019 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:07,020 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:25:07,022 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:25:07,025 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:25:07,027 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:25:07,083 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:07,083 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,085 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:25:07,112 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:25:07,112 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:25:07,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:07,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:07,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:07,163 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:25:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,165 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:25:07,166 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:25:07,167 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:25:07,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:07,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:07,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:07,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:07,206 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:25:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,208 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:25:07,213 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:25:07,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:07,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:07,224 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:25:07,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:07,250 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:25:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,260 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:25:07,272 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:25:07,284 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:25:07,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:07,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:07,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:07,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:07,309 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:25:07,309 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:07,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,311 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:25:07,312 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:25:07,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:07,313 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:07,313 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:07,313 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~z~0#1) = -1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~z~0#1 Supporting invariants [] [2022-02-21 03:25:07,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:07,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:07,340 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1;" [2022-02-21 03:25:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#unseeded} assume { :begin_inline_ULTIMATE.init } true; {172#unseeded} is VALID [2022-02-21 03:25:07,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {172#unseeded} is VALID [2022-02-21 03:25:07,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {172#unseeded} is VALID [2022-02-21 03:25:07,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {172#unseeded} is VALID [2022-02-21 03:25:07,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {172#unseeded} is VALID [2022-02-21 03:25:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,373 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {185#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-21 03:25:07,376 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:25:07,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:07,379 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:25:07,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 1 letters. [2022-02-21 03:25:07,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:07,380 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:07,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 18 states and 29 transitions. Complement of second has 6 states. [2022-02-21 03:25:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:07,407 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2022-02-21 03:25:07,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:07,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:25:07,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 29 transitions. [2022-02-21 03:25:07,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,409 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2022-02-21 03:25:07,409 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,410 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:07,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:25:07,410 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:07,410 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 29 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:07,411 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:07,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 1 letters. [2022-02-21 03:25:07,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:07,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:07,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 1 letters. [2022-02-21 03:25:07,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:07,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 3 letters. [2022-02-21 03:25:07,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:25:07,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 18 letters. Loop has 18 letters. [2022-02-21 03:25:07,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:25:07,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:25:07,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 11 letters. Loop has 11 letters. [2022-02-21 03:25:07,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:25:07,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 4 letters. [2022-02-21 03:25:07,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:07,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 1 letters. [2022-02-21 03:25:07,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 3 letters. [2022-02-21 03:25:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 3 letters. [2022-02-21 03:25:07,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:07,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 2 letters. Loop has 1 letters. [2022-02-21 03:25:07,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:07,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:07,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 1 letters. [2022-02-21 03:25:07,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:07,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:25:07,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 1 letters. [2022-02-21 03:25:07,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:25:07,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 3 letters. [2022-02-21 03:25:07,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 29 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,420 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 03:25:07,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 29 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:07,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 20 transitions. [2022-02-21 03:25:07,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:25:07,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:25:07,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2022-02-21 03:25:07,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:07,424 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-02-21 03:25:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2022-02-21 03:25:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:25:07,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:07,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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:25:07,425 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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:25:07,425 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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:25:07,426 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:07,426 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:25:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:25:07,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:07,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 14 states and 20 transitions. [2022-02-21 03:25:07,427 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 14 states and 20 transitions. [2022-02-21 03:25:07,427 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:07,428 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:25:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:25:07,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:07,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:07,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:07,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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:25:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2022-02-21 03:25:07,429 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:25:07,430 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:25:07,430 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:07,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2022-02-21 03:25:07,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:25:07,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:07,431 INFO L791 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 229#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 233#L21 assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; 234#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 238#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 240#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 231#L24-3 [2022-02-21 03:25:07,431 INFO L793 eck$LassoCheckResult]: Loop: 231#L24-3 main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 235#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 230#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 231#L24-3 [2022-02-21 03:25:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash 889513866, now seen corresponding path program 1 times [2022-02-21 03:25:07,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:07,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371645950] [2022-02-21 03:25:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:07,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:07,442 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash 56193, now seen corresponding path program 2 times [2022-02-21 03:25:07,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:07,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132628321] [2022-02-21 03:25:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:07,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:07,448 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash -440607912, now seen corresponding path program 1 times [2022-02-21 03:25:07,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:07,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560761778] [2022-02-21 03:25:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:07,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:07,472 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:07,493 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:07,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:07,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:07,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:07,494 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:07,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:07,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:07,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration3_Loop [2022-02-21 03:25:07,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:07,494 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:07,495 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:25:07,499 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:25:07,504 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:25:07,545 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:07,545 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:07,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,546 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:25:07,547 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:25:07,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:07,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:07,559 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:07,560 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:25:07,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:07,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,578 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:25:07,579 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:25:07,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:07,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:07,618 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:25:07,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,620 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:25:07,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:07,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:07,659 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:25:07,673 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:25:07,796 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:07,801 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:25:07,802 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:07,802 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:07,802 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:07,802 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:07,802 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:07,802 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:07,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:07,802 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration3_Loop [2022-02-21 03:25:07,802 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:07,802 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:07,803 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:25:07,807 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:25:07,814 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:25:07,862 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:07,863 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,864 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:25:07,865 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:25:07,866 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:25:07,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:07,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:07,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:07,904 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:25:07,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,906 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:25:07,920 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:25:07,920 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:25:07,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:07,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:07,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:07,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:07,967 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:25:07,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,970 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:25:07,972 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:25:07,973 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:25:07,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:07,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:07,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:08,016 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:08,016 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 03:25:08,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,017 INFO L229 MonitoredProcess]: Starting monitored process 30 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:25:08,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:25:08,020 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:25:08,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:08,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:08,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:08,026 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:25:08,028 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:25:08,028 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:25:08,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:08,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:08,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,066 INFO L229 MonitoredProcess]: Starting monitored process 31 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:25:08,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:25:08,068 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:25:08,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:08,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:08,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:08,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:08,074 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:25:08,075 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:25:08,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:08,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:08,106 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:25:08,106 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:25:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,116 INFO L229 MonitoredProcess]: Starting monitored process 32 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:25:08,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:25:08,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:08,118 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:08,119 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:08,119 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0#1 f1 = 1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:25:08,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:08,149 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:08,158 INFO L390 LassoCheck]: Loop: "main_~y~0#1 := main_~x~0#1 + main_~y~0#1;" "assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1;" "assume !(main_~y~0#1 < main_~z~0#1);" [2022-02-21 03:25:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:08,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:08,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:08,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#unseeded} assume { :begin_inline_ULTIMATE.init } true; {315#unseeded} is VALID [2022-02-21 03:25:08,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {315#unseeded} is VALID [2022-02-21 03:25:08,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {315#unseeded} is VALID [2022-02-21 03:25:08,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {315#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {315#unseeded} is VALID [2022-02-21 03:25:08,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {315#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {315#unseeded} is VALID [2022-02-21 03:25:08,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {315#unseeded} is VALID [2022-02-21 03:25:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:08,212 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:08,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:08,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {320#(and (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {349#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} is VALID [2022-02-21 03:25:08,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {353#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} is VALID [2022-02-21 03:25:08,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} assume !(main_~y~0#1 < main_~z~0#1); {329#(or (and (> oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 0)) (and (>= oldRank0 0) (> oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0))) unseeded)} is VALID [2022-02-21 03:25:08,489 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:25:08,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:25:08,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:08,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:25:08,497 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:25:08,536 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Result 31 states and 46 transitions. Complement of second has 8 states. [2022-02-21 03:25:08,537 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:25:08,537 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:08,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:08,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:08,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:08,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:25:08,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:25:08,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:08,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:08,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2022-02-21 03:25:08,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:08,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:08,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:08,539 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:08,539 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:08,543 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:25:08,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:25:08,543 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:08,543 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 46 transitions. cyclomatic complexity: 21 [2022-02-21 03:25:08,544 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:25:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:25:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:25:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:25:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:25:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:25:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:25:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:25:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:25:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:25:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:25:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:25:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 46 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,553 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:25:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-21 03:25:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:08,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:08,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:08,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 46 transitions. cyclomatic complexity: 21 [2022-02-21 03:25:08,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:08,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 34 transitions. [2022-02-21 03:25:08,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:25:08,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:25:08,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2022-02-21 03:25:08,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:08,558 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-02-21 03:25:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2022-02-21 03:25:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-02-21 03:25:08,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:08,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:08,559 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:08,560 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:08,560 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:08,561 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2022-02-21 03:25:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-02-21 03:25:08,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:08,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:08,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 23 states and 34 transitions. [2022-02-21 03:25:08,562 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 23 states and 34 transitions. [2022-02-21 03:25:08,562 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:08,563 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2022-02-21 03:25:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-02-21 03:25:08,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:08,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:08,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:08,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-02-21 03:25:08,564 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:25:08,564 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:25:08,564 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:08,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:25:08,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:08,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:08,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:08,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:25:08,565 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:25:08,565 INFO L791 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 400#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 405#L21 assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; 406#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 416#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 415#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 413#L24-3 main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 411#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 412#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 410#L24-2 [2022-02-21 03:25:08,566 INFO L793 eck$LassoCheckResult]: Loop: 410#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 410#L24-2 [2022-02-21 03:25:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash -440607910, now seen corresponding path program 2 times [2022-02-21 03:25:08,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:08,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298169323] [2022-02-21 03:25:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:08,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:08,580 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:08,581 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2022-02-21 03:25:08,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:08,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714441206] [2022-02-21 03:25:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:08,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:08,585 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -773943299, now seen corresponding path program 3 times [2022-02-21 03:25:08,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:08,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109174664] [2022-02-21 03:25:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:08,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:08,599 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:08,614 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:08,615 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:08,615 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:08,615 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:08,615 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:08,615 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,615 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:08,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:08,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration4_Loop [2022-02-21 03:25:08,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:08,615 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:08,616 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:25:08,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:25:08,622 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:25:08,623 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:25:08,663 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:08,663 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:08,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,665 INFO L229 MonitoredProcess]: Starting monitored process 33 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:25:08,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:08,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:08,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:08,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:25:08,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:08,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,741 INFO L229 MonitoredProcess]: Starting monitored process 34 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:25:08,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:25:08,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:08,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:08,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:08,764 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=-3}, {ULTIMATE.start_main_~x~0#1=3}, {ULTIMATE.start_main_~x~0#1=1}] Lambdas: [2, 1, 1] Nus: [1, 0] [2022-02-21 03:25:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:08,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,783 INFO L229 MonitoredProcess]: Starting monitored process 35 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:25:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:25:08,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:08,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:08,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:08,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:08,819 INFO L229 MonitoredProcess]: Starting monitored process 36 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:25:08,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:25:08,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:08,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:09,046 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:09,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:09,054 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:09,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:09,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:09,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:09,055 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:09,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:09,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:09,055 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:09,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration4_Loop [2022-02-21 03:25:09,055 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:09,055 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:09,056 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:25:09,060 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:25:09,064 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:25:09,067 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:25:09,125 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:09,125 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:09,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:09,126 INFO L229 MonitoredProcess]: Starting monitored process 37 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:25:09,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:25:09,129 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:25:09,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:09,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:09,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:09,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:09,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:09,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:09,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:09,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:09,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:09,169 INFO L229 MonitoredProcess]: Starting monitored process 38 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:25:09,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:25:09,184 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:25:09,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:09,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:09,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:09,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:09,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:09,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:09,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:09,192 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:09,196 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:09,196 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:09,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:09,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:09,212 INFO L229 MonitoredProcess]: Starting monitored process 39 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:25:09,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:25:09,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:09,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:09,214 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:09,214 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0#1, ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~z~0#1 - 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:25:09,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:25:09,235 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:09,239 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1;" [2022-02-21 03:25:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#unseeded} assume { :begin_inline_ULTIMATE.init } true; {524#unseeded} is VALID [2022-02-21 03:25:09,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {524#unseeded} is VALID [2022-02-21 03:25:09,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {524#unseeded} is VALID [2022-02-21 03:25:09,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {524#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {524#unseeded} is VALID [2022-02-21 03:25:09,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {524#unseeded} is VALID [2022-02-21 03:25:09,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,304 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {537#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-21 03:25:09,306 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:25:09,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:09,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:09,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,329 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Result 22 states and 31 transitions. Complement of second has 5 states. [2022-02-21 03:25:09,329 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:25:09,329 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:09,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:09,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:09,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-02-21 03:25:09,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:09,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,330 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:09,333 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:09,333 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:09,334 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:09,334 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 31 transitions. cyclomatic complexity: 14 [2022-02-21 03:25:09,334 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:09,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,342 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:25:09,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,343 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#unseeded} assume { :begin_inline_ULTIMATE.init } true; {524#unseeded} is VALID [2022-02-21 03:25:09,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {524#unseeded} is VALID [2022-02-21 03:25:09,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {524#unseeded} is VALID [2022-02-21 03:25:09,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {524#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {524#unseeded} is VALID [2022-02-21 03:25:09,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {524#unseeded} is VALID [2022-02-21 03:25:09,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,382 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {537#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-21 03:25:09,385 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:25:09,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:09,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:09,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,402 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Result 22 states and 31 transitions. Complement of second has 5 states. [2022-02-21 03:25:09,403 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:25:09,403 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:09,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:09,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:09,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-02-21 03:25:09,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:09,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,404 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:09,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:09,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:09,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:09,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 31 transitions. cyclomatic complexity: 14 [2022-02-21 03:25:09,406 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:09,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:09,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:09,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:09,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,414 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:25:09,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,415 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#unseeded} assume { :begin_inline_ULTIMATE.init } true; {524#unseeded} is VALID [2022-02-21 03:25:09,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {524#unseeded} is VALID [2022-02-21 03:25:09,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {524#unseeded} is VALID [2022-02-21 03:25:09,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {524#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {524#unseeded} is VALID [2022-02-21 03:25:09,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {524#unseeded} is VALID [2022-02-21 03:25:09,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {524#unseeded} is VALID [2022-02-21 03:25:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,451 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {537#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-21 03:25:09,456 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:25:09,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,462 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:09,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Result 30 states and 46 transitions. Complement of second has 5 states. [2022-02-21 03:25:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:09,478 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:09,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:09,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:25:09,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 46 transitions. [2022-02-21 03:25:09,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:09,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,480 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:09,480 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:09,480 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:25:09,480 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:09,480 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 46 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:09,481 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:25:09,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:09,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:09,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:09,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:09,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:09,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:09,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:09,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:09,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:09,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:09,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:09,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:09,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 46 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:09,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,491 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:25:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:25:09,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:25:09,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:25:09,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:25:09,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:09,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:09,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:09,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 32 transitions. [2022-02-21 03:25:09,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:25:09,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:25:09,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2022-02-21 03:25:09,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:09,494 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-02-21 03:25:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2022-02-21 03:25:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-02-21 03:25:09,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:09,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 32 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:09,496 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 32 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:09,496 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:09,496 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:09,497 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2022-02-21 03:25:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:25:09,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:09,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:09,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 23 states and 32 transitions. [2022-02-21 03:25:09,497 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 23 states and 32 transitions. [2022-02-21 03:25:09,498 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:09,498 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2022-02-21 03:25:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:25:09,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:09,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:09,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:09,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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:25:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-02-21 03:25:09,500 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:25:09,500 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:25:09,500 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:09,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:25:09,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:09,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:09,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:09,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:25:09,501 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:09,501 INFO L791 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 718#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 723#L21 assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; 724#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 728#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 735#L24-3 main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 734#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 733#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 730#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 725#L24-3 [2022-02-21 03:25:09,501 INFO L793 eck$LassoCheckResult]: Loop: 725#L24-3 main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 726#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 731#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 725#L24-3 [2022-02-21 03:25:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -442288422, now seen corresponding path program 4 times [2022-02-21 03:25:09,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:09,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573805246] [2022-02-21 03:25:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:09,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:09,511 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash 56193, now seen corresponding path program 3 times [2022-02-21 03:25:09,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:09,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228874090] [2022-02-21 03:25:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:09,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:09,516 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 745310728, now seen corresponding path program 5 times [2022-02-21 03:25:09,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:09,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496076221] [2022-02-21 03:25:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#true} assume { :begin_inline_ULTIMATE.init } true; {843#true} is VALID [2022-02-21 03:25:09,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {843#true} is VALID [2022-02-21 03:25:09,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {843#true} is VALID [2022-02-21 03:25:09,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#true} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {843#true} is VALID [2022-02-21 03:25:09,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#true} assume !(main_~y~0#1 < main_~z~0#1); {845#(<= |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#(<= |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {846#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {847#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| 1) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {847#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| 1) |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !(main_~y~0#1 < main_~z~0#1); {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !(main_~y~0#1 < main_~z~0#1); {844#false} is VALID [2022-02-21 03:25:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:09,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:09,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496076221] [2022-02-21 03:25:09,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496076221] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:09,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993320994] [2022-02-21 03:25:09,575 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:25:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:09,576 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:09,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-02-21 03:25:09,600 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-21 03:25:09,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:09,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:25:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:09,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:09,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#true} assume { :begin_inline_ULTIMATE.init } true; {843#true} is VALID [2022-02-21 03:25:09,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {843#true} is VALID [2022-02-21 03:25:09,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {843#true} is VALID [2022-02-21 03:25:09,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#true} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {843#true} is VALID [2022-02-21 03:25:09,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#true} assume !(main_~y~0#1 < main_~z~0#1); {845#(<= |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#(<= |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {846#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {847#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| 1) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {847#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| 1) |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {874#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} is VALID [2022-02-21 03:25:09,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {874#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} assume !(main_~y~0#1 < main_~z~0#1); {874#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} is VALID [2022-02-21 03:25:09,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !(main_~y~0#1 < main_~z~0#1); {844#false} is VALID [2022-02-21 03:25:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:09,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:09,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:09,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !(main_~y~0#1 < main_~z~0#1); {844#false} is VALID [2022-02-21 03:25:09,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {849#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} assume !(main_~y~0#1 < main_~z~0#1); {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {848#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:09,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {903#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {899#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-21 03:25:09,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#(<= |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {903#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-21 03:25:09,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#true} assume !(main_~y~0#1 < main_~z~0#1); {845#(<= |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:09,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#true} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {843#true} is VALID [2022-02-21 03:25:09,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {843#true} is VALID [2022-02-21 03:25:09,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {843#true} is VALID [2022-02-21 03:25:09,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#true} assume { :begin_inline_ULTIMATE.init } true; {843#true} is VALID [2022-02-21 03:25:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:09,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993320994] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:09,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:09,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-02-21 03:25:09,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575464883] [2022-02-21 03:25:09,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:09,914 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:09,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:09,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:09,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:09,914 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:09,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:09,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:09,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:09,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration5_Loop [2022-02-21 03:25:09,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:09,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:09,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:25:09,921 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:25:09,923 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:25:09,980 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:09,980 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:09,993 INFO L229 MonitoredProcess]: Starting monitored process 41 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:25:10,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:25:10,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:10,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:10,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:10,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,075 INFO L229 MonitoredProcess]: Starting monitored process 42 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:25:10,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:10,099 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:10,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:25:10,250 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:10,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:10,253 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:10,253 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:10,253 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:10,253 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:10,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:10,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:10,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:10,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration5_Loop [2022-02-21 03:25:10,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:10,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:10,254 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:25:10,270 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:25:10,273 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:25:10,335 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:10,336 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,345 INFO L229 MonitoredProcess]: Starting monitored process 43 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:25:10,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:25:10,361 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:25:10,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:10,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:10,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:10,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:10,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:10,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:10,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:10,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:10,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:25:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,422 INFO L229 MonitoredProcess]: Starting monitored process 44 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:25:10,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:25:10,425 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:25:10,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:10,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:10,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:10,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:10,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:10,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:10,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:10,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:10,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,462 INFO L229 MonitoredProcess]: Starting monitored process 45 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:25:10,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:25:10,464 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:25:10,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:10,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:10,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:10,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:10,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:10,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:10,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:10,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:10,501 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 03:25:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,502 INFO L229 MonitoredProcess]: Starting monitored process 46 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:25:10,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:25:10,506 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:25:10,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:10,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:10,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:10,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:10,513 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:25:10,515 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:25:10,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:10,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:10,543 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:25:10,543 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:25:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,548 INFO L229 MonitoredProcess]: Starting monitored process 47 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:25:10,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:25:10,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:10,549 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:10,549 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:10,550 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:25:10,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:25:10,583 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:10,590 INFO L390 LassoCheck]: Loop: "main_~y~0#1 := main_~x~0#1 + main_~y~0#1;" "assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1;" "assume !(main_~y~0#1 < main_~z~0#1);" [2022-02-21 03:25:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:10,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {919#unseeded} assume { :begin_inline_ULTIMATE.init } true; {919#unseeded} is VALID [2022-02-21 03:25:10,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {919#unseeded} is VALID [2022-02-21 03:25:10,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {919#unseeded} is VALID [2022-02-21 03:25:10,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {919#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:10,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {919#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {919#unseeded} is VALID [2022-02-21 03:25:10,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {919#unseeded} is VALID [2022-02-21 03:25:10,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:10,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:10,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {919#unseeded} is VALID [2022-02-21 03:25:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,644 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:10,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {924#(and (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {962#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} is VALID [2022-02-21 03:25:10,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {962#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {966#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} is VALID [2022-02-21 03:25:10,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} assume !(main_~y~0#1 < main_~z~0#1); {933#(or (and (> oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 0)) (and (>= oldRank0 0) (> oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0))) unseeded)} is VALID [2022-02-21 03:25:10,887 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:25:10,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:10,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:25:10,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:10,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 27 states and 38 transitions. Complement of second has 7 states. [2022-02-21 03:25:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:10,937 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:10,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:10,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:10,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:10,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:10,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:10,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:10,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:10,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2022-02-21 03:25:10,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:10,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:10,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:10,938 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:10,939 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:25:10,939 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:10,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:10,939 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:10,939 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 38 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:10,939 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:10,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:10,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:10,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:10,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:10,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 38 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,946 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:25:10,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:10,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:10,947 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:10,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {919#unseeded} assume { :begin_inline_ULTIMATE.init } true; {919#unseeded} is VALID [2022-02-21 03:25:10,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {919#unseeded} is VALID [2022-02-21 03:25:10,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {919#unseeded} is VALID [2022-02-21 03:25:10,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {919#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:10,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {919#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {919#unseeded} is VALID [2022-02-21 03:25:10,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {919#unseeded} is VALID [2022-02-21 03:25:10,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:10,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:10,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {919#unseeded} is VALID [2022-02-21 03:25:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,991 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:10,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:11,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:11,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {924#(and (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {1035#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} is VALID [2022-02-21 03:25:11,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1035#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {1039#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} is VALID [2022-02-21 03:25:11,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1039#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} assume !(main_~y~0#1 < main_~z~0#1); {933#(or (and (> oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 0)) (and (>= oldRank0 0) (> oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0))) unseeded)} is VALID [2022-02-21 03:25:11,260 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:25:11,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:11,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,267 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:25:11,267 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 25 states and 33 transitions. Complement of second has 7 states. [2022-02-21 03:25:11,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:11,297 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:11,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:11,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:11,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:25:11,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:11,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:11,298 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:25:11,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:11,298 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:11,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:11,298 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:25:11,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,311 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:25:11,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,314 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:11,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {919#unseeded} assume { :begin_inline_ULTIMATE.init } true; {919#unseeded} is VALID [2022-02-21 03:25:11,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {919#unseeded} is VALID [2022-02-21 03:25:11,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {919#unseeded} is VALID [2022-02-21 03:25:11,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {919#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:11,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {919#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {919#unseeded} is VALID [2022-02-21 03:25:11,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {919#unseeded} is VALID [2022-02-21 03:25:11,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:11,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {919#unseeded} is VALID [2022-02-21 03:25:11,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {919#unseeded} is VALID [2022-02-21 03:25:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,365 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:11,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {924#(and (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {1106#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} is VALID [2022-02-21 03:25:11,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#(and (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (not (> |ULTIMATE.start_main_~x~0#1| 0))) (and (> |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| oldRank1))) (or (and (not (> |ULTIMATE.start_main_~x~0#1| 0)) (<= 0 oldRank0)) (<= 1 oldRank0)))} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {1110#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} is VALID [2022-02-21 03:25:11,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (or (and (<= |ULTIMATE.start_main_~y~0#1| oldRank1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 oldRank0)) (and (< 0 oldRank1) (<= 1 oldRank0) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank1))))} assume !(main_~y~0#1 < main_~z~0#1); {933#(or (and (> oldRank1 (ite (> |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (>= oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0)) (>= oldRank1 0)) (and (>= oldRank0 0) (> oldRank0 (ite (> |ULTIMATE.start_main_~x~0#1| 0) 1 0))) unseeded)} is VALID [2022-02-21 03:25:11,561 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:25:11,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:11,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,577 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 3 loop predicates [2022-02-21 03:25:11,577 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 32 states and 44 transitions. Complement of second has 6 states. [2022-02-21 03:25:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:11,615 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:11,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:11,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:11,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2022-02-21 03:25:11,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:11,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 12 [2022-02-21 03:25:11,616 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:25:11,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:11,617 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:11,617 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 44 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:11,617 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,621 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:25:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:25:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:25:11,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:25:11,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:11,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:11,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 25 states and 35 transitions. [2022-02-21 03:25:11,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:25:11,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:25:11,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 35 transitions. [2022-02-21 03:25:11,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:11,623 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-02-21 03:25:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 35 transitions. [2022-02-21 03:25:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-02-21 03:25:11,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:11,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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:25:11,624 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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:25:11,624 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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:25:11,624 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:11,625 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-02-21 03:25:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-21 03:25:11,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:11,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:11,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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 25 states and 35 transitions. [2022-02-21 03:25:11,625 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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 25 states and 35 transitions. [2022-02-21 03:25:11,626 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:11,626 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-02-21 03:25:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-21 03:25:11,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:11,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:11,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:11,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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:25:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-02-21 03:25:11,627 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 03:25:11,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:11,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:25:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:25:11,630 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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:25:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:11,776 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-21 03:25:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:25:11,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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:25:11,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:11,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2022-02-21 03:25:11,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:11,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2022-02-21 03:25:11,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:25:11,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:25:11,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2022-02-21 03:25:11,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:11,790 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-02-21 03:25:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2022-02-21 03:25:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-02-21 03:25:11,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:11,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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:25:11,791 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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:25:11,791 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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:25:11,792 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:11,792 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-21 03:25:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-21 03:25:11,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:11,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:11,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 22 states and 29 transitions. [2022-02-21 03:25:11,793 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 22 states and 29 transitions. [2022-02-21 03:25:11,793 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:11,793 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-21 03:25:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-21 03:25:11,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:11,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:11,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:11,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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:25:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:25:11,794 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:25:11,794 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:25:11,794 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:25:11,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:25:11,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:11,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,795 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:25:11,795 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:11,795 INFO L791 eck$LassoCheckResult]: Stem: 1313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1314#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1318#L21 assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; 1319#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 1320#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 1325#L24-3 main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 1326#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 1330#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 1327#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 1324#L24-3 [2022-02-21 03:25:11,797 INFO L793 eck$LassoCheckResult]: Loop: 1324#L24-3 main_~y~0#1 := main_~x~0#1 + main_~y~0#1; 1322#L22-2 assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; 1323#L24-2 assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; 1327#L24-2 assume !(main_~y~0#1 < main_~z~0#1); 1324#L24-3 [2022-02-21 03:25:11,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash -442288422, now seen corresponding path program 6 times [2022-02-21 03:25:11,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738679591] [2022-02-21 03:25:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,808 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1742066, now seen corresponding path program 1 times [2022-02-21 03:25:11,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127318523] [2022-02-21 03:25:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,815 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1629796171, now seen corresponding path program 7 times [2022-02-21 03:25:11,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658173410] [2022-02-21 03:25:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,840 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,869 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:11,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:11,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:11,869 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:11,869 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:11,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:11,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:11,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration6_Loop [2022-02-21 03:25:11,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:11,870 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:11,870 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:25:11,872 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:25:11,875 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:25:11,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:11,949 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:11,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,950 INFO L229 MonitoredProcess]: Starting monitored process 48 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:25:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:25:11,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,962 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,962 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:11,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:25:11,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,977 INFO L229 MonitoredProcess]: Starting monitored process 49 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:25:11,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:25:11,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,990 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:12,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:25:12,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,006 INFO L229 MonitoredProcess]: Starting monitored process 50 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:25:12,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:25:12,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 03:25:12,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,035 INFO L229 MonitoredProcess]: Starting monitored process 51 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:25:12,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:25:12,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:12,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,404 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:12,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:12,408 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:12,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:12,408 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:12,408 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:12,408 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:12,408 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:12,408 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:12,408 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration6_Loop [2022-02-21 03:25:12,408 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:12,408 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:12,409 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:25:12,411 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:25:12,420 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:25:12,485 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:12,485 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:12,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,492 INFO L229 MonitoredProcess]: Starting monitored process 52 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:25:12,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:25:12,494 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:25:12,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:12,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:12,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,521 INFO L229 MonitoredProcess]: Starting monitored process 53 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:25:12,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:25:12,523 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:25:12,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:12,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:12,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:12,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:12,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:12,548 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:12,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,550 INFO L229 MonitoredProcess]: Starting monitored process 54 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:25:12,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:25:12,552 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:12,552 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:12,552 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:12,552 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0#1) = 1*ULTIMATE.start_main_~z~0#1 Supporting invariants [] [2022-02-21 03:25:12,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:25:12,572 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:12,574 INFO L390 LassoCheck]: Loop: "main_~y~0#1 := main_~x~0#1 + main_~y~0#1;" "assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1;" "assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1;" "assume !(main_~y~0#1 < main_~z~0#1);" [2022-02-21 03:25:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {1435#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1435#unseeded} is VALID [2022-02-21 03:25:12,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#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_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1435#unseeded} is VALID [2022-02-21 03:25:12,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#unseeded} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {1435#unseeded} is VALID [2022-02-21 03:25:12,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {1435#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {1435#unseeded} is VALID [2022-02-21 03:25:12,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {1435#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {1435#unseeded} is VALID [2022-02-21 03:25:12,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#unseeded} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {1435#unseeded} is VALID [2022-02-21 03:25:12,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#unseeded} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {1435#unseeded} is VALID [2022-02-21 03:25:12,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {1435#unseeded} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {1435#unseeded} is VALID [2022-02-21 03:25:12,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {1435#unseeded} assume !(main_~y~0#1 < main_~z~0#1); {1435#unseeded} is VALID [2022-02-21 03:25:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {1438#(>= oldRank0 |ULTIMATE.start_main_~z~0#1|)} main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {1438#(>= oldRank0 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:25:12,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {1438#(>= oldRank0 |ULTIMATE.start_main_~z~0#1|)} assume !!(main_~y~0#1 >= 1);main_~x~0#1 := main_~x~0#1 - 1; {1480#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (>= oldRank0 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-21 03:25:12,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {1480#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (>= oldRank0 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~y~0#1 < main_~z~0#1);main_~x~0#1 := 1 + main_~x~0#1;main_~z~0#1 := main_~z~0#1 - 1; {1484#(and (<= (+ |ULTIMATE.start_main_~z~0#1| 1) oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:25:12,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {1484#(and (<= (+ |ULTIMATE.start_main_~z~0#1| 1) oldRank0) (< 1 oldRank0))} assume !(main_~y~0#1 < main_~z~0#1); {1448#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~z~0#1|)) unseeded)} is VALID [2022-02-21 03:25:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:12,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:25:12,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:12,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 4 letters. [2022-02-21 03:25:12,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,684 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:25:12,684 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:25:12,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 36 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:25:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:12,715 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:12,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:12,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:25:12,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:12,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2022-02-21 03:25:12,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:12,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:12,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 26 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:12,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:12,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:25:12,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:12,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:12,718 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 51 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:12,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:12,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:12,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:12,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:12,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 4 letters. [2022-02-21 03:25:12,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:12,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:12,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 3 letters. [2022-02-21 03:25:12,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 36 letters. Loop has 36 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 19 letters. Loop has 19 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:12,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 4 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 4 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 3 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:12,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,720 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:25:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:25:12,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:12,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:12,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2022-02-21 03:25:12,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 51 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:12,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:12,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2022-02-21 03:25:12,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:12,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:12,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:12,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:12,723 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:12,723 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:12,723 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:12,723 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:25:12,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:25:12,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:12,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:12,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:25:12 BoogieIcfgContainer [2022-02-21 03:25:12,729 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:25:12,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:25:12,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:25:12,730 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:25:12,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:04" (3/4) ... [2022-02-21 03:25:12,733 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:25:12,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:25:12,734 INFO L158 Benchmark]: Toolchain (without parser) took 9062.40ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 84.2MB in the beginning and 102.8MB in the end (delta: -18.6MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-02-21 03:25:12,734 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:12,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.63ms. Allocated memory is still 117.4MB. Free memory was 84.0MB in the beginning and 93.0MB in the end (delta: -8.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:12,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.87ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:12,734 INFO L158 Benchmark]: Boogie Preprocessor took 17.16ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 90.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:25:12,734 INFO L158 Benchmark]: RCFGBuilder took 296.97ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 81.8MB in the end (delta: 8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:25:12,735 INFO L158 Benchmark]: BuchiAutomizer took 8449.89ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 102.8MB in the end (delta: -21.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-02-21 03:25:12,735 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 174.1MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:12,736 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.16ms. Allocated memory is still 83.9MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.63ms. Allocated memory is still 117.4MB. Free memory was 84.0MB in the beginning and 93.0MB in the end (delta: -8.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.87ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.16ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 90.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 296.97ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 81.8MB in the end (delta: 8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8449.89ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 102.8MB in the end (delta: -21.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 174.1MB. Free memory is still 102.8MB. 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 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 5 locations. One deterministic module has affine ranking function -1 * y + z and consists of 4 locations. One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else x + y) and consists of 5 locations. One deterministic module has affine ranking function z and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y + z and consists of 4 locations. One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else x + y) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 77 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax165 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf93 smp95 dnf100 smp100 tf108 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:25:12,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:12,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:13,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE