./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.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/NestedRecursion_1c.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 f5c626d5135dc189cbc332c41f07b76804a58f47ee910790099695b0d83f1587 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:42,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:42,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:42,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:42,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:42,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:42,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:42,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:42,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:42,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:42,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:42,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:42,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:42,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:42,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:42,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:42,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:42,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:42,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:42,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:42,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:42,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:42,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:42,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:42,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:42,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:42,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:42,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:42,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:42,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:42,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:42,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:42,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:42,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:42,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:42,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:42,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:42,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:42,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:42,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:42,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:42,276 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:23:42,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:42,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:42,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:42,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:42,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:42,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:42,305 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:42,305 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:42,305 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:42,306 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:42,306 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:42,306 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:42,307 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:42,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:42,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:42,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:42,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:42,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:42,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:42,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:42,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:42,308 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:42,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:42,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:42,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:42,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:42,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:42,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:42,310 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:42,310 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 -> f5c626d5135dc189cbc332c41f07b76804a58f47ee910790099695b0d83f1587 [2022-02-21 03:23:42,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:42,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:42,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:42,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:42,529 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:42,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c [2022-02-21 03:23:42,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b59c27b9/b9762d7df3874d90999ec47f75992d8e/FLAGe1dbcc0eb [2022-02-21 03:23:42,918 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:42,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c [2022-02-21 03:23:42,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b59c27b9/b9762d7df3874d90999ec47f75992d8e/FLAGe1dbcc0eb [2022-02-21 03:23:42,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b59c27b9/b9762d7df3874d90999ec47f75992d8e [2022-02-21 03:23:42,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:42,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:42,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:42,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:42,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:42,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:42" (1/1) ... [2022-02-21 03:23:42,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a82cf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:42, skipping insertion in model container [2022-02-21 03:23:42,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:42" (1/1) ... [2022-02-21 03:23:42,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:42,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:43,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:43,142 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:43,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:43,165 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:43,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43 WrapperNode [2022-02-21 03:23:43,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:43,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:43,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:43,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:43,176 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:23:43" (1/1) ... [2022-02-21 03:23:43,180 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:23:43" (1/1) ... [2022-02-21 03:23:43,192 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6 [2022-02-21 03:23:43,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:43,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:43,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:43,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:43,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:43,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:43,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:43,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:43,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:43,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:43,234 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:23:43,284 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:23:43,289 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-02-21 03:23:43,290 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-02-21 03:23:43,290 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-02-21 03:23:43,290 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-02-21 03:23:43,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:43,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:43,329 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:43,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:43,440 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:43,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:43,447 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:23:43,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:43 BoogieIcfgContainer [2022-02-21 03:23:43,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:43,450 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:43,450 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:43,452 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:43,453 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:43,453 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:42" (1/3) ... [2022-02-21 03:23:43,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c022588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:43, skipping insertion in model container [2022-02-21 03:23:43,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:43,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (2/3) ... [2022-02-21 03:23:43,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c022588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:43, skipping insertion in model container [2022-02-21 03:23:43,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:43,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:43" (3/3) ... [2022-02-21 03:23:43,456 INFO L388 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1c.c [2022-02-21 03:23:43,523 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:43,523 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:43,523 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:43,523 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:43,523 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:43,523 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:43,524 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:43,524 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:43,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:43,592 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:23:43,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:43,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:43,602 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:43,602 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:43,602 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:43,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:43,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:23:43,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:43,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:43,611 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:43,611 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:43,617 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10#L25true call main_#t~ret6#1 := rec2(main_~x~0#1);< 17#rec2ENTRYtrue [2022-02-21 03:23:43,617 INFO L793 eck$LassoCheckResult]: Loop: 17#rec2ENTRYtrue ~j := #in~j; 18#L18true assume !(~j <= 0); 21#L20true call #t~ret3 := rec2(~j - 1);< 17#rec2ENTRYtrue [2022-02-21 03:23:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 48738, now seen corresponding path program 1 times [2022-02-21 03:23:43,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:43,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347543230] [2022-02-21 03:23:43,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,727 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash 39868, now seen corresponding path program 1 times [2022-02-21 03:23:43,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:43,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98342986] [2022-02-21 03:23:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,762 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1451963835, now seen corresponding path program 1 times [2022-02-21 03:23:43,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:43,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700596691] [2022-02-21 03:23:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,789 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:43,967 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:43,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:43,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:43,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:43,968 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:43,968 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:43,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:43,969 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:43,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration1_Loop [2022-02-21 03:23:43,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:43,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:43,981 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:23:43,989 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:23:43,992 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:23:43,998 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:23:44,007 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:23:44,079 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:44,079 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,087 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:23:44,091 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:23:44,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,115 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,115 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:44,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,148 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:23:44,169 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:23:44,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,179 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,179 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,200 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:23:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,209 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:23:44,221 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:23:44,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,235 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,235 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,257 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:23:44,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,267 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:23:44,269 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:23:44,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:44,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,305 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:23:44,310 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:23:44,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:44,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,386 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:44,389 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:23:44,390 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:44,390 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:44,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:44,390 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:44,390 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:44,390 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,390 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:44,390 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:44,390 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration1_Loop [2022-02-21 03:23:44,390 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:44,390 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:44,391 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:23:44,395 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:23:44,406 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:23:44,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:23:44,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:23:44,466 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:44,469 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,484 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:23:44,485 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:23:44,486 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:23:44,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:44,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:44,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:44,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:44,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:44,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:44,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:44,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:44,528 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:23:44,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,530 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:23:44,531 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:23:44,533 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:23:44,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:44,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:44,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:44,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:44,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:44,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:44,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:44,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:44,559 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:44,560 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:23:44,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,573 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:23:44,577 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:23:44,628 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:44,628 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:44,628 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:44,629 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2022-02-21 03:23:44,645 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:23:44,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:44,664 INFO L390 LassoCheck]: Loop: "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec2(~j - 1);"< [2022-02-21 03:23:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:23:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:44,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#unseeded} assume { :begin_inline_ULTIMATE.init } true; {32#unseeded} is VALID [2022-02-21 03:23:44,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {32#unseeded} is VALID [2022-02-21 03:23:44,725 INFO L272 TraceCheckUtils]: 2: Hoare triple {32#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {32#unseeded} is VALID [2022-02-21 03:23:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:44,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(>= oldRank0 |rec2_#in~j|)} ~j := #in~j; {56#(<= rec2_~j oldRank0)} is VALID [2022-02-21 03:23:44,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(<= rec2_~j oldRank0)} assume !(~j <= 0); {60#(and (<= rec2_~j oldRank0) (not (<= rec2_~j 0)))} is VALID [2022-02-21 03:23:44,796 INFO L272 TraceCheckUtils]: 2: Hoare triple {60#(and (<= rec2_~j oldRank0) (not (<= rec2_~j 0)))} call #t~ret3 := rec2(~j - 1); {45#(or (and (>= oldRank0 0) (> oldRank0 |rec2_#in~j|)) unseeded)} is VALID [2022-02-21 03:23:44,797 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:23:44,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:44,826 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:23:44,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:44,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:44,834 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:23:44,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:44,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6). Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 45 transitions. Complement of second has 12 states. [2022-02-21 03:23:44,994 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:23:44,994 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:44,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:44,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:23:44,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:44,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:44,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:45,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:45,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2022-02-21 03:23:45,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:45,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,005 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:45,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:23:45,011 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:23:45,011 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:45,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:45,013 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:45,013 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 45 transitions. cyclomatic complexity: 10 [2022-02-21 03:23:45,015 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:45,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:45,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:45,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:45,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:45,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:23:45,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:23:45,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:23:45,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:45,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:45,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:45,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:45,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:45,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:45,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:45,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:45,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:45,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:45,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:45,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:45,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:45,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:45,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:45,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:45,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:23:45,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:45,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:45,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:45,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:45,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:45,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:45,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,052 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-02-21 03:23:45,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:45,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:45,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:45,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. cyclomatic complexity: 10 [2022-02-21 03:23:45,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:45,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 31 transitions. [2022-02-21 03:23:45,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:23:45,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:23:45,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-02-21 03:23:45,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:45,078 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:23:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-02-21 03:23:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-02-21 03:23:45,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:45,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 31 transitions. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:45,097 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 31 transitions. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:45,100 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:45,102 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:45,113 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-02-21 03:23:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-02-21 03:23:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:45,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states and 31 transitions. [2022-02-21 03:23:45,115 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states and 31 transitions. [2022-02-21 03:23:45,116 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:45,124 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-02-21 03:23:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-02-21 03:23:45,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:45,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:45,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:45,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 03:23:45,142 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:23:45,142 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:23:45,142 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:45,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:23:45,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:45,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,145 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:45,145 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:45,145 INFO L791 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 119#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 132#rec2ENTRY ~j := #in~j; 134#L18 assume !(~j <= 0); 120#L20 call #t~ret3 := rec2(~j - 1);< 135#rec2ENTRY ~j := #in~j; 136#L18 assume ~j <= 0;#res := 0; 122#rec2FINAL assume true; 123#rec2EXIT >#34#return; 118#L20-1 call #t~ret4 := rec1(#t~ret3);< 121#rec1ENTRY [2022-02-21 03:23:45,146 INFO L793 eck$LassoCheckResult]: Loop: 121#rec1ENTRY ~i := #in~i; 137#L12 assume !(~i <= 0); 130#L14 call #t~ret0 := rec1(~i - 2);< 121#rec1ENTRY [2022-02-21 03:23:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1193590059, now seen corresponding path program 1 times [2022-02-21 03:23:45,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566793580] [2022-02-21 03:23:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,175 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2022-02-21 03:23:45,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628124120] [2022-02-21 03:23:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,190 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -207203934, now seen corresponding path program 1 times [2022-02-21 03:23:45,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091280751] [2022-02-21 03:23:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:23:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#true} ~j := #in~j; {386#true} is VALID [2022-02-21 03:23:45,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume ~j <= 0;#res := 0; {395#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:23:45,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {395#(<= |rec2_#res| 0)} assume true; {395#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:23:45,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {395#(<= |rec2_#res| 0)} {386#true} #34#return; {392#(<= |rec2_#t~ret3| 0)} is VALID [2022-02-21 03:23:45,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#true} assume { :begin_inline_ULTIMATE.init } true; {386#true} is VALID [2022-02-21 03:23:45,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {386#true} is VALID [2022-02-21 03:23:45,283 INFO L272 TraceCheckUtils]: 2: Hoare triple {386#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {386#true} is VALID [2022-02-21 03:23:45,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {386#true} ~j := #in~j; {386#true} is VALID [2022-02-21 03:23:45,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {386#true} assume !(~j <= 0); {386#true} is VALID [2022-02-21 03:23:45,283 INFO L272 TraceCheckUtils]: 5: Hoare triple {386#true} call #t~ret3 := rec2(~j - 1); {386#true} is VALID [2022-02-21 03:23:45,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#true} ~j := #in~j; {386#true} is VALID [2022-02-21 03:23:45,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {386#true} assume ~j <= 0;#res := 0; {395#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:23:45,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#(<= |rec2_#res| 0)} assume true; {395#(<= |rec2_#res| 0)} is VALID [2022-02-21 03:23:45,284 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {395#(<= |rec2_#res| 0)} {386#true} #34#return; {392#(<= |rec2_#t~ret3| 0)} is VALID [2022-02-21 03:23:45,285 INFO L272 TraceCheckUtils]: 10: Hoare triple {392#(<= |rec2_#t~ret3| 0)} call #t~ret4 := rec1(#t~ret3); {393#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:45,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(<= |rec1_#in~i| 0)} ~i := #in~i; {394#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:45,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#(<= rec1_~i 0)} assume !(~i <= 0); {387#false} is VALID [2022-02-21 03:23:45,286 INFO L272 TraceCheckUtils]: 13: Hoare triple {387#false} call #t~ret0 := rec1(~i - 2); {387#false} is VALID [2022-02-21 03:23:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:45,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:45,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091280751] [2022-02-21 03:23:45,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091280751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:45,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:45,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:23:45,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273595956] [2022-02-21 03:23:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:45,353 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:45,353 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:45,353 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:45,353 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:45,353 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:45,354 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,354 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:45,354 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:45,354 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration2_Loop [2022-02-21 03:23:45,354 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:45,354 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:45,355 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:23:45,359 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:23:45,361 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:23:45,364 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:23:45,365 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:23:45,367 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:23:45,411 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:45,411 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,416 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:23:45,417 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:23:45,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,459 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:23:45,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,460 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:23:45,461 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:23:45,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:45,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,524 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:45,529 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:23:45,529 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:45,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:45,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:45,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:45,530 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:45,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:45,530 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:45,530 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration2_Loop [2022-02-21 03:23:45,530 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:45,530 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:45,530 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:23:45,539 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:23:45,542 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:23:45,544 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:23:45,547 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:23:45,549 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:23:45,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:45,598 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:45,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,605 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:23:45,606 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:23:45,608 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:23:45,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:45,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:45,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:45,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:45,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:45,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:45,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:45,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:45,636 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:45,636 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,640 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:23:45,641 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:23:45,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:45,642 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:45,642 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:45,642 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:45,679 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:23:45,685 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:45,689 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:23:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:45,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#unseeded} assume { :begin_inline_ULTIMATE.init } true; {396#unseeded} is VALID [2022-02-21 03:23:45,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {396#unseeded} is VALID [2022-02-21 03:23:45,810 INFO L272 TraceCheckUtils]: 2: Hoare triple {396#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {396#unseeded} is VALID [2022-02-21 03:23:45,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {396#unseeded} ~j := #in~j; {396#unseeded} is VALID [2022-02-21 03:23:45,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {396#unseeded} assume !(~j <= 0); {396#unseeded} is VALID [2022-02-21 03:23:45,812 INFO L272 TraceCheckUtils]: 5: Hoare triple {396#unseeded} call #t~ret3 := rec2(~j - 1); {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:45,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:45,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~j <= 0;#res := 0; {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:45,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:45,814 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {396#unseeded} #34#return; {396#unseeded} is VALID [2022-02-21 03:23:45,814 INFO L272 TraceCheckUtils]: 10: Hoare triple {396#unseeded} call #t~ret4 := rec1(#t~ret3); {396#unseeded} is VALID [2022-02-21 03:23:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:45,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {445#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:45,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#(<= rec1_~i oldRank0)} assume !(~i <= 0); {449#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:45,905 INFO L272 TraceCheckUtils]: 2: Hoare triple {449#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {409#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:45,905 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:23:45,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:45,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:45,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,937 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:23:46,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 44 states and 59 transitions. Complement of second has 14 states. [2022-02-21 03:23:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:46,060 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:46,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. cyclomatic complexity: 7 [2022-02-21 03:23:46,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:46,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:46,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 59 transitions. [2022-02-21 03:23:46,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:46,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,063 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 25 transitions. cyclomatic complexity: 7 [2022-02-21 03:23:46,064 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:46,065 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:46,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:46,066 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:46,066 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 59 transitions. cyclomatic complexity: 18 [2022-02-21 03:23:46,067 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:46,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:46,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:46,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:46,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:23:46,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:23:46,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:23:46,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:23:46,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:23:46,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:23:46,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:46,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:46,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:46,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:46,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:46,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:46,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:46,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:46,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:46,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:46,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:46,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:46,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:46,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:23:46,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 7 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 59 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:23:46,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,116 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-21 03:23:46,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:23:46,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. cyclomatic complexity: 18 [2022-02-21 03:23:46,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:46,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 51 transitions. [2022-02-21 03:23:46,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-02-21 03:23:46,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 03:23:46,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2022-02-21 03:23:46,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:46,131 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-02-21 03:23:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2022-02-21 03:23:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-02-21 03:23:46,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:46,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 51 transitions. Second operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:23:46,136 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 51 transitions. Second operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:23:46,136 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:23:46,136 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:46,143 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2022-02-21 03:23:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2022-02-21 03:23:46,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:46,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:46,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Second operand 38 states and 51 transitions. [2022-02-21 03:23:46,144 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Second operand 38 states and 51 transitions. [2022-02-21 03:23:46,145 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:46,154 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2022-02-21 03:23:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2022-02-21 03:23:46,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:46,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:46,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:46,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:23:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-02-21 03:23:46,161 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-21 03:23:46,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:46,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:23:46,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:23:46,164 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:46,285 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-21 03:23:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:23:46,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:46,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:46,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2022-02-21 03:23:46,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:46,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 41 transitions. [2022-02-21 03:23:46,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 03:23:46,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 03:23:46,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2022-02-21 03:23:46,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:46,301 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-02-21 03:23:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2022-02-21 03:23:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-02-21 03:23:46,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:46,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 41 transitions. Second operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:23:46,304 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 41 transitions. Second operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:23:46,304 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:23:46,304 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:46,308 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-02-21 03:23:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2022-02-21 03:23:46,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:46,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:46,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Second operand 32 states and 41 transitions. [2022-02-21 03:23:46,310 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Second operand 32 states and 41 transitions. [2022-02-21 03:23:46,310 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:46,315 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-02-21 03:23:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2022-02-21 03:23:46,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:46,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:46,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:46,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:23:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-21 03:23:46,317 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-21 03:23:46,317 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-21 03:23:46,318 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:46,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:23:46,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:46,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,319 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:46,319 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:46,319 INFO L791 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1019#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1016#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 1030#rec2ENTRY ~j := #in~j; 1033#L18 assume !(~j <= 0); 1014#L20 call #t~ret3 := rec2(~j - 1);< 1034#rec2ENTRY ~j := #in~j; 1035#L18 assume !(~j <= 0); 1015#L20 call #t~ret3 := rec2(~j - 1);< 1034#rec2ENTRY ~j := #in~j; 1036#L18 assume ~j <= 0;#res := 0; 1020#rec2FINAL assume true; 1021#rec2EXIT >#34#return; 1022#L20-1 call #t~ret4 := rec1(#t~ret3);< 1039#rec1ENTRY ~i := #in~i; 1037#L12 assume ~i <= 0;#res := 0; 1038#rec1FINAL assume true; 1032#rec1EXIT >#36#return; 1023#L20-2 #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; 1024#rec2FINAL assume true; 1041#rec2EXIT >#34#return; 1013#L20-1 call #t~ret4 := rec1(#t~ret3);< 1017#rec1ENTRY [2022-02-21 03:23:46,319 INFO L793 eck$LassoCheckResult]: Loop: 1017#rec1ENTRY ~i := #in~i; 1040#L12 assume !(~i <= 0); 1028#L14 call #t~ret0 := rec1(~i - 2);< 1017#rec1ENTRY [2022-02-21 03:23:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1665524430, now seen corresponding path program 1 times [2022-02-21 03:23:46,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371490846] [2022-02-21 03:23:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,341 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2022-02-21 03:23:46,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899693878] [2022-02-21 03:23:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,349 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2118876407, now seen corresponding path program 1 times [2022-02-21 03:23:46,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590198997] [2022-02-21 03:23:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:23:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {1365#true} ~j := #in~j; {1365#true} is VALID [2022-02-21 03:23:46,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume ~j <= 0;#res := 0; {1365#true} is VALID [2022-02-21 03:23:46,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-02-21 03:23:46,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #34#return; {1365#true} is VALID [2022-02-21 03:23:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:23:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {1365#true} ~i := #in~i; {1365#true} is VALID [2022-02-21 03:23:46,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume ~i <= 0;#res := 0; {1395#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1395#(<= |rec1_#res| 0)} assume true; {1395#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1395#(<= |rec1_#res| 0)} {1365#true} #36#return; {1393#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:23:46,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {1365#true} ~j := #in~j; {1365#true} is VALID [2022-02-21 03:23:46,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume !(~j <= 0); {1365#true} is VALID [2022-02-21 03:23:46,433 INFO L272 TraceCheckUtils]: 2: Hoare triple {1365#true} call #t~ret3 := rec2(~j - 1); {1365#true} is VALID [2022-02-21 03:23:46,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {1365#true} ~j := #in~j; {1365#true} is VALID [2022-02-21 03:23:46,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {1365#true} assume ~j <= 0;#res := 0; {1365#true} is VALID [2022-02-21 03:23:46,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-02-21 03:23:46,433 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1365#true} {1365#true} #34#return; {1365#true} is VALID [2022-02-21 03:23:46,433 INFO L272 TraceCheckUtils]: 7: Hoare triple {1365#true} call #t~ret4 := rec1(#t~ret3); {1365#true} is VALID [2022-02-21 03:23:46,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#true} ~i := #in~i; {1365#true} is VALID [2022-02-21 03:23:46,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#true} assume ~i <= 0;#res := 0; {1395#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {1395#(<= |rec1_#res| 0)} assume true; {1395#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,437 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1395#(<= |rec1_#res| 0)} {1365#true} #36#return; {1393#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:23:46,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1393#(<= |rec2_#t~ret4| 0)} #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1394#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:23:46,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {1394#(<= (+ |rec2_#res| 1) 0)} assume true; {1394#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:23:46,439 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1394#(<= (+ |rec2_#res| 1) 0)} {1365#true} #34#return; {1382#(<= (+ |rec2_#t~ret3| 1) 0)} is VALID [2022-02-21 03:23:46,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {1365#true} assume { :begin_inline_ULTIMATE.init } true; {1365#true} is VALID [2022-02-21 03:23:46,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1365#true} is VALID [2022-02-21 03:23:46,440 INFO L272 TraceCheckUtils]: 2: Hoare triple {1365#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {1365#true} is VALID [2022-02-21 03:23:46,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {1365#true} ~j := #in~j; {1365#true} is VALID [2022-02-21 03:23:46,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {1365#true} assume !(~j <= 0); {1365#true} is VALID [2022-02-21 03:23:46,440 INFO L272 TraceCheckUtils]: 5: Hoare triple {1365#true} call #t~ret3 := rec2(~j - 1); {1365#true} is VALID [2022-02-21 03:23:46,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {1365#true} ~j := #in~j; {1365#true} is VALID [2022-02-21 03:23:46,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {1365#true} assume !(~j <= 0); {1365#true} is VALID [2022-02-21 03:23:46,441 INFO L272 TraceCheckUtils]: 8: Hoare triple {1365#true} call #t~ret3 := rec2(~j - 1); {1365#true} is VALID [2022-02-21 03:23:46,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#true} ~j := #in~j; {1365#true} is VALID [2022-02-21 03:23:46,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#true} assume ~j <= 0;#res := 0; {1365#true} is VALID [2022-02-21 03:23:46,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-02-21 03:23:46,441 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1365#true} {1365#true} #34#return; {1365#true} is VALID [2022-02-21 03:23:46,441 INFO L272 TraceCheckUtils]: 13: Hoare triple {1365#true} call #t~ret4 := rec1(#t~ret3); {1365#true} is VALID [2022-02-21 03:23:46,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {1365#true} ~i := #in~i; {1365#true} is VALID [2022-02-21 03:23:46,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#true} assume ~i <= 0;#res := 0; {1395#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {1395#(<= |rec1_#res| 0)} assume true; {1395#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,443 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1395#(<= |rec1_#res| 0)} {1365#true} #36#return; {1393#(<= |rec2_#t~ret4| 0)} is VALID [2022-02-21 03:23:46,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {1393#(<= |rec2_#t~ret4| 0)} #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1394#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:23:46,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {1394#(<= (+ |rec2_#res| 1) 0)} assume true; {1394#(<= (+ |rec2_#res| 1) 0)} is VALID [2022-02-21 03:23:46,445 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1394#(<= (+ |rec2_#res| 1) 0)} {1365#true} #34#return; {1382#(<= (+ |rec2_#t~ret3| 1) 0)} is VALID [2022-02-21 03:23:46,445 INFO L272 TraceCheckUtils]: 21: Hoare triple {1382#(<= (+ |rec2_#t~ret3| 1) 0)} call #t~ret4 := rec1(#t~ret3); {1383#(<= (+ |rec1_#in~i| 1) 0)} is VALID [2022-02-21 03:23:46,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {1383#(<= (+ |rec1_#in~i| 1) 0)} ~i := #in~i; {1384#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:23:46,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {1384#(<= (+ rec1_~i 1) 0)} assume !(~i <= 0); {1366#false} is VALID [2022-02-21 03:23:46,446 INFO L272 TraceCheckUtils]: 24: Hoare triple {1366#false} call #t~ret0 := rec1(~i - 2); {1366#false} is VALID [2022-02-21 03:23:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:23:46,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:46,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590198997] [2022-02-21 03:23:46,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590198997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:46,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:46,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:23:46,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402330552] [2022-02-21 03:23:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:46,505 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:46,505 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:46,505 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:46,505 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:46,505 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:46,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:46,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:46,505 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration3_Loop [2022-02-21 03:23:46,505 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:46,505 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:46,506 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:23:46,507 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:23:46,510 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:23:46,512 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:23:46,513 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:23:46,515 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:23:46,573 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:46,574 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:46,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,580 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:23:46,581 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:23:46,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,589 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,589 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:46,606 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:23:46,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,607 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:23:46,608 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:23:46,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,638 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:23:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,639 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:23:46,640 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:23:46,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:46,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,671 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:46,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:23:46,678 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:46,678 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:46,679 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:46,679 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:46,679 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:46,679 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,679 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:46,679 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:46,679 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration3_Loop [2022-02-21 03:23:46,679 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:46,679 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:46,680 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:23:46,689 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:23:46,691 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:23:46,693 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:23:46,695 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:23:46,697 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:23:46,773 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:46,773 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:46,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,781 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:23:46,782 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:23:46,783 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:23:46,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:46,807 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:46,807 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:46,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,808 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:23:46,809 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:23:46,810 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:46,810 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:46,810 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:46,810 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:46,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,832 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:46,836 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:23:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:47,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1396#unseeded} is VALID [2022-02-21 03:23:47,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1396#unseeded} is VALID [2022-02-21 03:23:47,146 INFO L272 TraceCheckUtils]: 2: Hoare triple {1396#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {1396#unseeded} is VALID [2022-02-21 03:23:47,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {1396#unseeded} ~j := #in~j; {1396#unseeded} is VALID [2022-02-21 03:23:47,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {1396#unseeded} assume !(~j <= 0); {1396#unseeded} is VALID [2022-02-21 03:23:47,148 INFO L272 TraceCheckUtils]: 5: Hoare triple {1396#unseeded} call #t~ret3 := rec2(~j - 1); {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~j <= 0); {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,150 INFO L272 TraceCheckUtils]: 8: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := rec2(~j - 1); {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~j <= 0;#res := 0; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,152 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,153 INFO L272 TraceCheckUtils]: 13: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := rec1(#t~ret3); {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,157 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,159 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1429#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1396#unseeded} #34#return; {1396#unseeded} is VALID [2022-02-21 03:23:47,159 INFO L272 TraceCheckUtils]: 21: Hoare triple {1396#unseeded} call #t~ret4 := rec1(#t~ret3); {1396#unseeded} is VALID [2022-02-21 03:23:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:47,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {1399#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {1478#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:47,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1478#(<= rec1_~i oldRank0)} assume !(~i <= 0); {1482#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:47,215 INFO L272 TraceCheckUtils]: 2: Hoare triple {1482#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {1409#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:47,215 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:23:47,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:47,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,242 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:47,243 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,294 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:23:47,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 32 states and 38 transitions. Complement of second has 7 states. [2022-02-21 03:23:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:47,366 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:47,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:47,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:23:47,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:47,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,370 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,372 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:47,372 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:47,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 13 transitions. cyclomatic complexity: 12 [2022-02-21 03:23:47,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:47,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:23:47,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:23:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:23:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:23:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,390 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:23:47,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,392 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:23:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:47,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1396#unseeded} is VALID [2022-02-21 03:23:47,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1396#unseeded} is VALID [2022-02-21 03:23:47,612 INFO L272 TraceCheckUtils]: 2: Hoare triple {1396#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {1396#unseeded} is VALID [2022-02-21 03:23:47,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {1396#unseeded} ~j := #in~j; {1396#unseeded} is VALID [2022-02-21 03:23:47,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {1396#unseeded} assume !(~j <= 0); {1396#unseeded} is VALID [2022-02-21 03:23:47,627 INFO L272 TraceCheckUtils]: 5: Hoare triple {1396#unseeded} call #t~ret3 := rec2(~j - 1); {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~j <= 0); {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := rec2(~j - 1); {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~j <= 0;#res := 0; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,631 INFO L272 TraceCheckUtils]: 13: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := rec1(#t~ret3); {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,633 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,634 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1549#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1396#unseeded} #34#return; {1396#unseeded} is VALID [2022-02-21 03:23:47,634 INFO L272 TraceCheckUtils]: 21: Hoare triple {1396#unseeded} call #t~ret4 := rec1(#t~ret3); {1396#unseeded} is VALID [2022-02-21 03:23:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:47,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {1399#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {1598#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:47,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1598#(<= rec1_~i oldRank0)} assume !(~i <= 0); {1602#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:47,672 INFO L272 TraceCheckUtils]: 2: Hoare triple {1602#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {1409#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:47,672 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:23:47,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:47,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,690 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:47,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,753 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 32 states and 38 transitions. Complement of second has 7 states. [2022-02-21 03:23:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:47,753 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:47,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:47,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:23:47,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:47,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,754 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,754 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:47,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,755 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:47,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 13 transitions. cyclomatic complexity: 12 [2022-02-21 03:23:47,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:47,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:23:47,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,756 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:47,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:47,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,763 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:23:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,764 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:23:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1396#unseeded} is VALID [2022-02-21 03:23:48,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1396#unseeded} is VALID [2022-02-21 03:23:48,023 INFO L272 TraceCheckUtils]: 2: Hoare triple {1396#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {1396#unseeded} is VALID [2022-02-21 03:23:48,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {1396#unseeded} ~j := #in~j; {1396#unseeded} is VALID [2022-02-21 03:23:48,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {1396#unseeded} assume !(~j <= 0); {1396#unseeded} is VALID [2022-02-21 03:23:48,024 INFO L272 TraceCheckUtils]: 5: Hoare triple {1396#unseeded} call #t~ret3 := rec2(~j - 1); {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~j <= 0); {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,025 INFO L272 TraceCheckUtils]: 8: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := rec2(~j - 1); {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~j := #in~j; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~j <= 0;#res := 0; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,028 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,028 INFO L272 TraceCheckUtils]: 13: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := rec1(#t~ret3); {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,030 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:48,032 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1669#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1396#unseeded} #34#return; {1396#unseeded} is VALID [2022-02-21 03:23:48,033 INFO L272 TraceCheckUtils]: 21: Hoare triple {1396#unseeded} call #t~ret4 := rec1(#t~ret3); {1396#unseeded} is VALID [2022-02-21 03:23:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {1399#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {1718#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:48,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#(<= rec1_~i oldRank0)} assume !(~i <= 0); {1722#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:48,082 INFO L272 TraceCheckUtils]: 2: Hoare triple {1722#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {1409#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:48,082 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:23:48,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:48,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:48,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,106 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:48,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:48,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 54 states and 66 transitions. Complement of second has 13 states. [2022-02-21 03:23:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:48,247 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:48,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:48,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:48,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:48,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 66 transitions. [2022-02-21 03:23:48,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:48,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,249 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:48,249 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:48,249 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:48,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:48,250 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:48,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 66 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:48,250 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:23:48,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:48,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:48,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:48,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:23:48,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:48,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:48,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:48,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 13 letters. [2022-02-21 03:23:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 66 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:23:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,281 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-21 03:23:48,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:23:48,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:23:48,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 03:23:48,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:48,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:48,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 53 transitions. [2022-02-21 03:23:48,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 03:23:48,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-02-21 03:23:48,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2022-02-21 03:23:48,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:48,293 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-02-21 03:23:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2022-02-21 03:23:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-02-21 03:23:48,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:48,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 53 transitions. Second operand has 40 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:23:48,301 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 53 transitions. Second operand has 40 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:23:48,301 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 40 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:23:48,302 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,315 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-02-21 03:23:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2022-02-21 03:23:48,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Second operand 42 states and 53 transitions. [2022-02-21 03:23:48,317 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Second operand 42 states and 53 transitions. [2022-02-21 03:23:48,318 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,333 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-02-21 03:23:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2022-02-21 03:23:48,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:48,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:23:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-02-21 03:23:48,338 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-02-21 03:23:48,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:23:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:23:48,339 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:23:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:48,442 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-21 03:23:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:23:48,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:23:48,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:48,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 30 transitions. [2022-02-21 03:23:48,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:48,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2022-02-21 03:23:48,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:23:48,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:23:48,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:23:48,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:48,463 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:48,463 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:48,463 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:48,463 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:48,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:23:48,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:48,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:48,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:23:48 BoogieIcfgContainer [2022-02-21 03:23:48,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:23:48,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:23:48,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:23:48,469 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:23:48,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:43" (3/4) ... [2022-02-21 03:23:48,471 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:23:48,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:23:48,472 INFO L158 Benchmark]: Toolchain (without parser) took 5520.85ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 76.8MB in the beginning and 98.3MB in the end (delta: -21.5MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:48,473 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 55.0MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:48,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.08ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 85.4MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:48,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.44ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 83.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:48,474 INFO L158 Benchmark]: Boogie Preprocessor took 14.19ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 83.3MB in the end (delta: 640.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:48,474 INFO L158 Benchmark]: RCFGBuilder took 241.17ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 74.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:48,474 INFO L158 Benchmark]: BuchiAutomizer took 5018.99ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 74.3MB in the beginning and 98.3MB in the end (delta: -24.1MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2022-02-21 03:23:48,475 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 134.2MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:48,490 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.15ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 55.0MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.08ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 85.4MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.44ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 83.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.19ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 83.3MB in the end (delta: 640.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 241.17ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 74.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5018.99ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 74.3MB in the beginning and 98.3MB in the end (delta: -24.1MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 134.2MB. Free memory is still 98.3MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 2.1s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 283 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 95 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp100 dnf100 smp100 tf111 neg94 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:23:48,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE