./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.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 a723a67708085ac2edc65dca820ea0ff5f017c1387423fea83ca87f76f9f53c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:40,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:40,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:40,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:40,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:40,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:40,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:40,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:40,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:40,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:40,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:40,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:40,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:40,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:40,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:40,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:40,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:40,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:40,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:40,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:40,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:40,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:40,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:40,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:40,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:40,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:40,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:40,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:40,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:40,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:40,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:40,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:40,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:40,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:40,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:40,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:40,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:40,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:40,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:40,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:40,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:40,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:24:40,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:40,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:40,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:40,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:40,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:40,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:40,418 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:40,419 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:40,419 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:40,419 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:40,420 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:40,420 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:40,420 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:40,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:40,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:40,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:40,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:40,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:40,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:40,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:40,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:40,422 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:40,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:40,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:40,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:40,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:40,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:40,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:40,424 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:40,425 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 -> a723a67708085ac2edc65dca820ea0ff5f017c1387423fea83ca87f76f9f53c3 [2022-02-21 03:24:40,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:40,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:40,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:40,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:40,669 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:40,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c [2022-02-21 03:24:40,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd342d0d/a3aa487a8f7c4f37ae9b2d1be17a8683/FLAGb1343b952 [2022-02-21 03:24:41,108 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:41,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c [2022-02-21 03:24:41,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd342d0d/a3aa487a8f7c4f37ae9b2d1be17a8683/FLAGb1343b952 [2022-02-21 03:24:41,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd342d0d/a3aa487a8f7c4f37ae9b2d1be17a8683 [2022-02-21 03:24:41,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:41,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:41,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:41,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:41,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:41,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685e93b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41, skipping insertion in model container [2022-02-21 03:24:41,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:41,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:41,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:41,309 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:41,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:41,347 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:41,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41 WrapperNode [2022-02-21 03:24:41,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:41,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:41,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:41,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:41,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,381 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-21 03:24:41,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:41,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:41,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:41,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:41,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:41,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:41,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:41,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:41,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:41,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:24:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:41,525 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:41,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:41,599 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:41,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:41,604 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:24:41,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:41 BoogieIcfgContainer [2022-02-21 03:24:41,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:41,606 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:41,606 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:41,609 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:41,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:41" (1/3) ... [2022-02-21 03:24:41,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@eba65bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:41, skipping insertion in model container [2022-02-21 03:24:41,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (2/3) ... [2022-02-21 03:24:41,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@eba65bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:41, skipping insertion in model container [2022-02-21 03:24:41,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:41" (3/3) ... [2022-02-21 03:24:41,614 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-while2.c [2022-02-21 03:24:41,657 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:41,657 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:41,657 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:41,657 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:41,658 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:41,658 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:41,658 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:41,658 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:41,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:41,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:41,693 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:41,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:41,696 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:41,702 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; 5#L17-2true [2022-02-21 03:24:41,702 INFO L793 eck$LassoCheckResult]: Loop: 5#L17-2true assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; 3#L19-2true assume !(main_~j~0#1 > 0); 10#L19-3true main_~i~0#1 := main_~i~0#1 - 1; 5#L17-2true [2022-02-21 03:24:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,707 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:24:41,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316359692] [2022-02-21 03:24:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,811 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 40944, now seen corresponding path program 1 times [2022-02-21 03:24:41,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552089208] [2022-02-21 03:24:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,848 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 28699886, now seen corresponding path program 1 times [2022-02-21 03:24:41,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722782640] [2022-02-21 03:24:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true; {17#true} is VALID [2022-02-21 03:24:42,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {19#(= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:42,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#(= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {20#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0))} is VALID [2022-02-21 03:24:42,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0))} assume !(main_~j~0#1 > 0); {18#false} is VALID [2022-02-21 03:24:42,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} main_~i~0#1 := main_~i~0#1 - 1; {18#false} is VALID [2022-02-21 03:24:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:42,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:42,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722782640] [2022-02-21 03:24:42,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722782640] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:42,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:42,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:24:42,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039871747] [2022-02-21 03:24:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:42,081 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,082 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:42,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,083 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,083 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration1_Loop [2022-02-21 03:24:42,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,269 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,270 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:42,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:42,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,303 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,303 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:42,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,360 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,360 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:24:42,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,406 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,406 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=-4, ULTIMATE.start_main_~N~0#1=-4} Honda state: {ULTIMATE.start_main_~j~0#1=-4, ULTIMATE.start_main_~N~0#1=-4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:24:42,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,477 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:24:42,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:42,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,520 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:42,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:24:42,524 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:42,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration1_Loop [2022-02-21 03:24:42,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,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:24:42,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,631 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,635 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:42,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,640 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:42,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:24:42,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:42,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:24:42,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:24:42,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:42,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:42,777 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:42,778 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,781 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:24:42,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:42,788 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:42,788 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:42,788 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:42,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:24:42,815 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:42,820 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1;" "assume !(main_~j~0#1 > 0);" "main_~i~0#1 := main_~i~0#1 - 1;" [2022-02-21 03:24:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true; {21#unseeded} is VALID [2022-02-21 03:24:42,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {21#unseeded} is VALID [2022-02-21 03:24:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,876 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {42#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:42,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~j~0#1 > 0); {42#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:42,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 - 1; {34#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:42,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:42,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:42,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,007 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:24:43,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 36 transitions. Complement of second has 7 states. [2022-02-21 03:24:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:43,086 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:43,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:43,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2022-02-21 03:24:43,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,102 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:43,109 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:43,109 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:43,111 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:43,111 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 36 transitions. cyclomatic complexity: 15 [2022-02-21 03:24:43,111 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:43,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:43,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:43,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:43,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:43,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:43,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:43,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:43,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:43,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:43,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:43,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:43,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:43,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:43,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:43,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,125 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-21 03:24:43,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:43,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:43,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:24:43,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. cyclomatic complexity: 15 [2022-02-21 03:24:43,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-02-21 03:24:43,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2022-02-21 03:24:43,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:24:43,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-02-21 03:24:43,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,138 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-02-21 03:24:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2022-02-21 03:24:43,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,163 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,165 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,168 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,169 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:24:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:43,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:24:43,171 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:24:43,171 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,172 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2022-02-21 03:24:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2022-02-21 03:24:43,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2022-02-21 03:24:43,176 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2022-02-21 03:24:43,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:24:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:24:43,180 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:43,226 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:24:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:24:43,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:43,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2022-02-21 03:24:43,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:43,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:24:43,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:43,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:43,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 03:24:43,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,239 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:24:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 03:24:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2022-02-21 03:24:43,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,246 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,246 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,248 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,249 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:24:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:24:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 03:24:43,251 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 03:24:43,252 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,253 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:24:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:24:43,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:24:43,255 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:43,255 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:43,255 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:43,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:43,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:43,257 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:43,257 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; 149#L17-2 assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; 146#L19-2 [2022-02-21 03:24:43,257 INFO L793 eck$LassoCheckResult]: Loop: 146#L19-2 assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; 146#L19-2 [2022-02-21 03:24:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:24:43,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196814649] [2022-02-21 03:24:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,271 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2022-02-21 03:24:43,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989850633] [2022-02-21 03:24:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,279 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2022-02-21 03:24:43,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157024716] [2022-02-21 03:24:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,295 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,311 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,311 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,311 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,311 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,311 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:43,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration2_Loop [2022-02-21 03:24:43,312 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,312 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,362 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,362 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:43,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,367 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:24:43,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,385 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,385 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:43,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,402 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:24:43,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,440 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,440 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:43,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,464 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:24:43,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,493 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:24:43,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:43,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,535 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:43,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,540 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,540 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,540 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,540 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,540 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:43,540 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration2_Loop [2022-02-21 03:24:43,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,540 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,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:24:43,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:24:43,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,599 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:43,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,600 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,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:24:43,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:43,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:43,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:24:43,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,674 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:43,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:24:43,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:43,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:43,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,748 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:24:43,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:43,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:43,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:43,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:43,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:43,781 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:43,781 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:43,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,783 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:24:43,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:43,786 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:43,786 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:43,786 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:24:43,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:43,825 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1;" [2022-02-21 03:24:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#unseeded} assume { :begin_inline_ULTIMATE.init } true; {213#unseeded} is VALID [2022-02-21 03:24:43,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {213#unseeded} is VALID [2022-02-21 03:24:43,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {213#unseeded} is VALID [2022-02-21 03:24:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,862 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {216#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {226#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:43,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:43,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:43,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 20 transitions. Complement of second has 5 states. [2022-02-21 03:24:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:43,900 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:24:43,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,902 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,902 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,903 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:43,904 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:43,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,912 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:24:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:43,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:43,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:43,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:43,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2022-02-21 03:24:43,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2022-02-21 03:24:43,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2022-02-21 03:24:43,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-02-21 03:24:43,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,916 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:24:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-02-21 03:24:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2022-02-21 03:24:43,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,917 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,917 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,918 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,918 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:24:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:24:43,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 15 transitions. [2022-02-21 03:24:43,919 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 15 transitions. [2022-02-21 03:24:43,920 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,920 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:24:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:24:43,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:24:43,922 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:43,922 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:43,922 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:43,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:24:43,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:43,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,923 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-02-21 03:24:43,923 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:43,924 INFO L791 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; 262#L17-2 assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; 260#L19-2 assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; 261#L19-2 assume !(main_~j~0#1 > 0); 266#L19-3 main_~i~0#1 := main_~i~0#1 - 1; 263#L17-2 assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; 259#L19-2 [2022-02-21 03:24:43,924 INFO L793 eck$LassoCheckResult]: Loop: 259#L19-2 assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; 259#L19-2 [2022-02-21 03:24:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1810841241, now seen corresponding path program 1 times [2022-02-21 03:24:43,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187920772] [2022-02-21 03:24:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#true} assume { :begin_inline_ULTIMATE.init } true; {328#true} is VALID [2022-02-21 03:24:43,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {330#(= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:43,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#(= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {331#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0)} is VALID [2022-02-21 03:24:43,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {331#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0)} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {332#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:24:43,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {332#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_~j~0#1 > 0); {333#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:24:43,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~i~0#1 := main_~i~0#1 - 1; {334#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:24:43,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {329#false} is VALID [2022-02-21 03:24:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:43,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:43,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187920772] [2022-02-21 03:24:43,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187920772] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:43,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305541215] [2022-02-21 03:24:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:43,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,988 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:24:44,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#true} assume { :begin_inline_ULTIMATE.init } true; {328#true} is VALID [2022-02-21 03:24:44,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {341#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:24:44,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~N~0#1|)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {345#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:44,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {345#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {332#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:24:44,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {332#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_~j~0#1 > 0); {333#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:24:44,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~i~0#1 := main_~i~0#1 - 1; {334#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:24:44,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {329#false} is VALID [2022-02-21 03:24:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:44,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {329#false} is VALID [2022-02-21 03:24:44,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~i~0#1 := main_~i~0#1 - 1; {334#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:24:44,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#(or (< 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~j~0#1 > 0); {333#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:24:44,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {368#(or (<= |ULTIMATE.start_main_~i~0#1| 1) (< 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {364#(or (< 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:24:44,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {372#(or (< 1 |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {368#(or (<= |ULTIMATE.start_main_~i~0#1| 1) (< 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:24:44,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {372#(or (< 1 |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:24:44,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#true} assume { :begin_inline_ULTIMATE.init } true; {328#true} is VALID [2022-02-21 03:24:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305541215] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:44,298 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:44,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:24:44,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766559028] [2022-02-21 03:24:44,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:44,299 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:24:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2022-02-21 03:24:44,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609092285] [2022-02-21 03:24:44,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,318 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:44,334 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:44,334 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:44,334 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:44,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:44,335 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:44,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:44,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:44,335 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration3_Loop [2022-02-21 03:24:44,335 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:44,335 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:44,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,392 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:44,393 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,396 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:44,408 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:24:44,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,437 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:24:44,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:44,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,463 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:44,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,466 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:44,466 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:44,466 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:44,466 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:44,466 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:44,466 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,466 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:44,466 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:44,467 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration3_Loop [2022-02-21 03:24:44,467 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:44,467 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:44,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,524 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:44,524 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:44,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,526 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:44,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:44,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:44,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:44,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:44,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:44,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:44,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:44,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:24:44,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:44,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:44,571 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,645 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:24:44,647 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:44,647 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:44,647 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:44,647 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:24:44,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,674 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:44,678 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1;" [2022-02-21 03:24:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#unseeded} assume { :begin_inline_ULTIMATE.init } true; {378#unseeded} is VALID [2022-02-21 03:24:44,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {378#unseeded} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {378#unseeded} is VALID [2022-02-21 03:24:44,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#unseeded} assume !(main_~j~0#1 > 0); {378#unseeded} is VALID [2022-02-21 03:24:44,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#unseeded} main_~i~0#1 := main_~i~0#1 - 1; {378#unseeded} is VALID [2022-02-21 03:24:44,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,725 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {391#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:44,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:44,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:24:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:44,755 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:24:44,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,759 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,759 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,759 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,760 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:44,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,770 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:24:44,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,771 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#unseeded} assume { :begin_inline_ULTIMATE.init } true; {378#unseeded} is VALID [2022-02-21 03:24:44,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {378#unseeded} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {378#unseeded} is VALID [2022-02-21 03:24:44,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#unseeded} assume !(main_~j~0#1 > 0); {378#unseeded} is VALID [2022-02-21 03:24:44,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#unseeded} main_~i~0#1 := main_~i~0#1 - 1; {378#unseeded} is VALID [2022-02-21 03:24:44,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,818 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {391#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:44,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:44,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:24:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:44,838 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:24:44,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,840 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,841 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:44,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,848 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:24:44,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,850 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#unseeded} assume { :begin_inline_ULTIMATE.init } true; {378#unseeded} is VALID [2022-02-21 03:24:44,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {378#unseeded} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {378#unseeded} is VALID [2022-02-21 03:24:44,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#unseeded} assume !(main_~j~0#1 > 0); {378#unseeded} is VALID [2022-02-21 03:24:44,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#unseeded} main_~i~0#1 := main_~i~0#1 - 1; {378#unseeded} is VALID [2022-02-21 03:24:44,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#unseeded} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {378#unseeded} is VALID [2022-02-21 03:24:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,886 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 > 0);main_~j~0#1 := main_~j~0#1 - 1; {391#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:44,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,894 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:44,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 13 transitions. Complement of second has 4 states. [2022-02-21 03:24:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:44,916 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:24:44,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:44,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:44,918 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,918 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,918 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:44,919 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,919 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:44,919 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:44,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,923 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:24:44,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,925 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:44,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2022-02-21 03:24:44,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:44,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:44,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:44,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:44,926 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,926 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:24:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:24:44,927 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:44,927 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:24:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:24:44,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,937 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:24:44,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:24:44,938 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:44,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:24:44,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:44,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:44,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:44,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:44,939 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,939 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,939 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,939 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:44,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:44,939 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:44,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:44,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:44 BoogieIcfgContainer [2022-02-21 03:24:44,945 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:44,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:44,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:44,946 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:44,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:41" (3/4) ... [2022-02-21 03:24:44,948 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:44,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:44,950 INFO L158 Benchmark]: Toolchain (without parser) took 3822.86ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 63.9MB in the beginning and 42.3MB in the end (delta: 21.6MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,950 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:44,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.29ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 74.1MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 96.5MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:44,951 INFO L158 Benchmark]: Boogie Preprocessor took 18.05ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 71.7MB in the end (delta: 848.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,951 INFO L158 Benchmark]: RCFGBuilder took 202.55ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 63.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,951 INFO L158 Benchmark]: BuchiAutomizer took 3339.14ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 63.3MB in the beginning and 42.3MB in the end (delta: 21.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,952 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 119.5MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:44,953 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.21ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.29ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 74.1MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 96.5MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.05ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 71.7MB in the end (delta: 848.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 202.55ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 63.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3339.14ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 63.3MB in the beginning and 42.3MB in the end (delta: 21.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 119.5MB. Free memory is still 42.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 i and consists of 5 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 33 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf100 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:44,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE