./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2.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-wcet2.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 f1c0f52e4e285a18472ace03d4db4ceb89212d4af812bbedd827878c931f4f63 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:39,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:39,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:40,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:40,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:40,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:40,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:40,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:40,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:40,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:40,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:40,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:40,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:40,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:40,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:40,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:40,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:40,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:40,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:40,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:40,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:40,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:40,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:40,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:40,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:40,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:40,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:40,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:40,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:40,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:40,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:40,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:40,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:40,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:40,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:40,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:40,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:40,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:40,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:40,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:40,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:40,061 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,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:40,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:40,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:40,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:40,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:40,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:40,083 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:40,083 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:40,084 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:40,084 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:40,084 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:40,085 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:40,085 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:40,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:40,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:40,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:40,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:40,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:40,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:40,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:40,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:40,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:40,088 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:40,088 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 -> f1c0f52e4e285a18472ace03d4db4ceb89212d4af812bbedd827878c931f4f63 [2022-02-21 03:24:40,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:40,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:40,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:40,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:40,313 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:40,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2.c [2022-02-21 03:24:40,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe2eb651/cdd749fec7eb4cac8a831048b4d3f6e5/FLAG2583e4e75 [2022-02-21 03:24:40,691 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:40,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2.c [2022-02-21 03:24:40,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe2eb651/cdd749fec7eb4cac8a831048b4d3f6e5/FLAG2583e4e75 [2022-02-21 03:24:41,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe2eb651/cdd749fec7eb4cac8a831048b4d3f6e5 [2022-02-21 03:24:41,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:41,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:41,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:41,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:41,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:41,141 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,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbad5d0 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,143 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,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:41,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:41,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:41,284 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:41,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:41,312 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:41,313 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,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:41,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:41,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:41,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:41,324 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,329 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,345 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-21 03:24:41,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:41,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:41,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:41,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:41,356 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,357 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,357 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,357 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,359 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,364 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,364 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,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:41,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:41,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:41,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:41,368 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,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,401 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,456 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,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:41,510 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:41,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:41,596 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:41,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:41,601 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:24:41,602 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,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:41,603 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:41,603 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:41,606 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:41,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,606 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,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@341cac58 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,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,608 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,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@341cac58 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,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,608 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,609 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wcet2.c [2022-02-21 03:24:41,643 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:41,643 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:41,643 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:41,644 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:41,644 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:41,644 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:41,644 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:41,644 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:41,663 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,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,689 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,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,696 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,697 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_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 5#L17-2true [2022-02-21 03:24:41,703 INFO L793 eck$LassoCheckResult]: Loop: 5#L17-2true assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 3#L19-2true assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); 10#L19-3true main_~i~0#1 := 1 + main_~i~0#1; 5#L17-2true [2022-02-21 03:24:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:24:41,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326218684] [2022-02-21 03:24:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,830 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 40944, now seen corresponding path program 1 times [2022-02-21 03:24:41,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117493665] [2022-02-21 03:24:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,860 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 28699886, now seen corresponding path program 1 times [2022-02-21 03:24:41,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689214708] [2022-02-21 03:24:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,950 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,951 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,951 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,951 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,951 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:41,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,952 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration1_Loop [2022-02-21 03:24:41,952 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,952 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,967 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:41,975 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:41,982 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:41,999 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,106 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,106 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,109 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,110 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,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,155 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,156 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,172 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,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,175 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,176 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,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,193 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,210 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,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,217 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,218 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,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,259 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,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,261 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,262 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,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:42,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,294 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:42,297 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,298 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,298 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,298 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,298 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,298 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:42,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration1_Loop [2022-02-21 03:24:42,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,298 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,299 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,303 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,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,309 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,365 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,368 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:42,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,392 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,393 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,395 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,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,452 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,453 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,454 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,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,496 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,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,498 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,499 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,500 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,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,535 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,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,547 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,553 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,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,564 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,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:42,575 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:42,575 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:42,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,578 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,591 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,591 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:42,591 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:42,591 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:42,592 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2022-02-21 03:24:42,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,620 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:42,631 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0;" "assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9);" "main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:24:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,675 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true; {19#unseeded} is VALID [2022-02-21 03:24:42,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {19#unseeded} is VALID [2022-02-21 03:24:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,698 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5))} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {40#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:24:42,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {44#(and (<= 5 (+ oldRank0 (* 2 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~i~0#1| 2))} is VALID [2022-02-21 03:24:42,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#(and (<= 5 (+ oldRank0 (* 2 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~i~0#1| 2))} main_~i~0#1 := 1 + main_~i~0#1; {32#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5))) unseeded)} is VALID [2022-02-21 03:24:42,789 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,818 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:42,830 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,832 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:42,837 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 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:42,947 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 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) Result 31 states and 49 transitions. Complement of second has 9 states. [2022-02-21 03:24:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,947 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,948 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:42,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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:42,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:42,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 49 transitions. [2022-02-21 03:24:42,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:42,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,953 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:42,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,954 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:42,954 INFO L70 LassoExtractor]: Start lassoExtractor. 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:42,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:42,963 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,963 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 49 transitions. cyclomatic complexity: 21 [2022-02-21 03:24:42,964 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:42,964 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:42,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,964 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,965 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 3 letters. [2022-02-21 03:24:42,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,965 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,965 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:42,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,965 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:42,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:42,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,966 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 31 letters. Loop has 31 letters. [2022-02-21 03:24:42,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,966 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:42,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:42,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,966 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:42,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,966 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:42,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:42,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,967 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 6 letters. Loop has 6 letters. [2022-02-21 03:24:42,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,967 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:42,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:42,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,967 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:42,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,967 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,968 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:42,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,968 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:42,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:42,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,968 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:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,969 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,969 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:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,969 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,969 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 3 letters. [2022-02-21 03:24:42,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 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 4 letters. [2022-02-21 03:24:42,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:42,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:42,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,970 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 6 letters. Loop has 4 letters. [2022-02-21 03:24:42,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,971 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:42,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:42,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,971 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 7 letters. Loop has 4 letters. [2022-02-21 03:24:42,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,971 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:42,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:42,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,972 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:42,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,972 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:42,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:42,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,972 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. 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:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-21 03:24:42,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:42,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:42,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:24:42,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 49 transitions. cyclomatic complexity: 21 [2022-02-21 03:24:43,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:43,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 14 states and 19 transitions. [2022-02-21 03:24:43,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:24:43,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:24:43,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:24:43,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,004 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:24:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:24:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:24:43,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,039 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,041 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,043 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,044 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:24:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:24:43,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:24:43,046 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:24:43,046 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,047 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2022-02-21 03:24:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2022-02-21 03:24:43,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:24:43,049 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:24:43,049 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:24:43,050 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:43,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:43,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:43,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,050 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:43,051 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:24:43,051 INFO L791 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 102#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 93#L19-2 [2022-02-21 03:24:43,051 INFO L793 eck$LassoCheckResult]: Loop: 93#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 94#L19-2 assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); 103#L19-3 main_~i~0#1 := 1 + main_~i~0#1; 98#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 93#L19-2 [2022-02-21 03:24:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:24:43,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941278525] [2022-02-21 03:24:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,058 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1537394, now seen corresponding path program 1 times [2022-02-21 03:24:43,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250232645] [2022-02-21 03:24:43,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,065 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,069 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1810841241, now seen corresponding path program 1 times [2022-02-21 03:24:43,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985371689] [2022-02-21 03:24:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} assume { :begin_inline_ULTIMATE.init } true; {171#true} is VALID [2022-02-21 03:24:43,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {171#true} is VALID [2022-02-21 03:24:43,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {173#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:43,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {173#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {174#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:43,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {174#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {172#false} is VALID [2022-02-21 03:24:43,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#false} main_~i~0#1 := 1 + main_~i~0#1; {172#false} is VALID [2022-02-21 03:24:43,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#false} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {172#false} is VALID [2022-02-21 03:24:43,123 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:43,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:43,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985371689] [2022-02-21 03:24:43,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985371689] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:43,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592418712] [2022-02-21 03:24:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,156 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,164 INFO L229 MonitoredProcess]: Starting monitored process 11 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:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:24:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} assume { :begin_inline_ULTIMATE.init } true; {171#true} is VALID [2022-02-21 03:24:43,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {171#true} is VALID [2022-02-21 03:24:43,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {173#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:43,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {173#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {174#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:43,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {174#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {172#false} is VALID [2022-02-21 03:24:43,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#false} main_~i~0#1 := 1 + main_~i~0#1; {172#false} is VALID [2022-02-21 03:24:43,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#false} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {172#false} is VALID [2022-02-21 03:24:43,312 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:43,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:43,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#false} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {172#false} is VALID [2022-02-21 03:24:43,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#false} main_~i~0#1 := 1 + main_~i~0#1; {172#false} is VALID [2022-02-21 03:24:43,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {202#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (< 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {172#false} is VALID [2022-02-21 03:24:43,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#(<= |ULTIMATE.start_main_~j~0#1| 8)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {202#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (< 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:43,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {206#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-21 03:24:43,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {171#true} is VALID [2022-02-21 03:24:43,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} assume { :begin_inline_ULTIMATE.init } true; {171#true} is VALID [2022-02-21 03:24:43,416 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:43,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592418712] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:43,416 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:43,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-02-21 03:24:43,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314665478] [2022-02-21 03:24:43,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:43,483 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,483 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,483 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,483 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,483 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:43,483 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,484 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration2_Loop [2022-02-21 03:24:43,484 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,484 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,489 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,492 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,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,518 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,592 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,592 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:43,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,594 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,594 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,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,614 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,614 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,630 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,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,632 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,633 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,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:24:43,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,681 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,683 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,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:43,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,723 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:43,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,742 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:43,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration2_Loop [2022-02-21 03:24:43,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,744 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,749 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,752 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,754 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,820 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,821 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,824 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,855 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,865 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,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:43,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:43,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:43,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:43,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:43,888 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,890 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,891 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,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:43,893 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:43,893 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:43,893 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,927 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,933 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:43,937 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9);" "main_~i~0#1 := 1 + main_~i~0#1;" "assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0;" [2022-02-21 03:24:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#unseeded} assume { :begin_inline_ULTIMATE.init } true; {213#unseeded} is VALID [2022-02-21 03:24:43,968 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_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {213#unseeded} is VALID [2022-02-21 03:24:43,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {213#unseeded} is VALID [2022-02-21 03:24:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,977 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {216#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {237#(and (<= |ULTIMATE.start_main_~j~0#1| (+ oldRank0 1)) (< 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:44,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (<= |ULTIMATE.start_main_~j~0#1| (+ oldRank0 1)) (< 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {241#(< 8 oldRank0)} is VALID [2022-02-21 03:24:44,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#(< 8 oldRank0)} main_~i~0#1 := 1 + main_~i~0#1; {241#(< 8 oldRank0)} is VALID [2022-02-21 03:24:44,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {241#(< 8 oldRank0)} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {226#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:44,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:44,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 42 transitions. Complement of second has 9 states. [2022-02-21 03:24:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:44,130 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:44,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:44,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-02-21 03:24:44,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:44,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:44,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:44,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:44,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2022-02-21 03:24:44,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:44,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:44,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:44,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:44,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:44,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:44,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:44,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:24:44,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:24:44,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:24:44,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:44,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:44,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:44,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:44,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:44,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:44,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:44,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:44,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:44,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:44,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:44,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:44,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:44,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:44,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,185 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2022-02-21 03:24:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:24:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2022-02-21 03:24:44,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:44,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 36 transitions. [2022-02-21 03:24:44,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:24:44,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:44,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2022-02-21 03:24:44,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:44,196 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-21 03:24:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2022-02-21 03:24:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-02-21 03:24:44,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:44,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 36 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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,198 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 36 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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,198 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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,198 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:44,201 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:44,202 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2022-02-21 03:24:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2022-02-21 03:24:44,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:44,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:44,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 26 states and 36 transitions. [2022-02-21 03:24:44,203 INFO L87 Difference]: Start difference. First operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 26 states and 36 transitions. [2022-02-21 03:24:44,203 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:44,204 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2022-02-21 03:24:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2022-02-21 03:24:44,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:44,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:44,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:44,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2022-02-21 03:24:44,217 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-02-21 03:24:44,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:24:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:24:44,220 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) 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:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:44,266 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-21 03:24:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:24:44,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) 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:44,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:44,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2022-02-21 03:24:44,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:24:44,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2022-02-21 03:24:44,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:24:44,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:24:44,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-02-21 03:24:44,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:44,279 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-21 03:24:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-02-21 03:24:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-02-21 03:24:44,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:44,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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,280 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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,280 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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,280 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:44,280 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-21 03:24:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-21 03:24:44,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:44,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:44,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states and 29 transitions. [2022-02-21 03:24:44,281 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states and 29 transitions. [2022-02-21 03:24:44,281 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:44,282 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-21 03:24:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-21 03:24:44,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:44,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:44,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:44,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-21 03:24:44,283 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 03:24:44,284 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 03:24:44,284 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:44,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-02-21 03:24:44,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:24:44,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,284 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:44,284 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2022-02-21 03:24:44,285 INFO L791 eck$LassoCheckResult]: Stem: 447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 448#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 449#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 440#L19-2 [2022-02-21 03:24:44,285 INFO L793 eck$LassoCheckResult]: Loop: 440#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 441#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 455#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 454#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 453#L19-2 assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); 450#L19-3 main_~i~0#1 := 1 + main_~i~0#1; 444#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 440#L19-2 [2022-02-21 03:24:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 2 times [2022-02-21 03:24:44,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361646834] [2022-02-21 03:24:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,300 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,302 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1390285212, now seen corresponding path program 2 times [2022-02-21 03:24:44,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718834077] [2022-02-21 03:24:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,312 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,319 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2036023261, now seen corresponding path program 2 times [2022-02-21 03:24:44,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377978416] [2022-02-21 03:24:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#true} assume { :begin_inline_ULTIMATE.init } true; {548#true} is VALID [2022-02-21 03:24:44,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {548#true} is VALID [2022-02-21 03:24:44,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {548#true} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {550#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:44,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {550#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {551#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:44,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {551#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {552#(and (not (<= |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:24:44,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {552#(and (not (<= |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {553#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:44,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {554#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:44,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {549#false} is VALID [2022-02-21 03:24:44,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#false} main_~i~0#1 := 1 + main_~i~0#1; {549#false} is VALID [2022-02-21 03:24:44,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#false} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {549#false} is VALID [2022-02-21 03:24:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:44,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377978416] [2022-02-21 03:24:44,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377978416] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:44,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788562843] [2022-02-21 03:24:44,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:24:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,383 INFO L229 MonitoredProcess]: Starting monitored process 17 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,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:24:44,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:24:44,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:24:44,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#true} assume { :begin_inline_ULTIMATE.init } true; {548#true} is VALID [2022-02-21 03:24:44,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {548#true} is VALID [2022-02-21 03:24:44,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {548#true} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {550#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:44,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {550#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {551#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:44,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {551#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {552#(and (not (<= |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:24:44,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {552#(and (not (<= |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {553#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:44,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {554#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} is VALID [2022-02-21 03:24:44,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (not (<= |ULTIMATE.start_main_~i~0#1| 2)))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {549#false} is VALID [2022-02-21 03:24:44,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#false} main_~i~0#1 := 1 + main_~i~0#1; {549#false} is VALID [2022-02-21 03:24:44,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#false} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {549#false} is VALID [2022-02-21 03:24:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:44,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#false} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {549#false} is VALID [2022-02-21 03:24:44,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#false} main_~i~0#1 := 1 + main_~i~0#1; {549#false} is VALID [2022-02-21 03:24:44,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (< 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {549#false} is VALID [2022-02-21 03:24:44,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (< 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {591#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (< 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:44,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {599#(and (<= |ULTIMATE.start_main_~j~0#1| 7) (< 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {595#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (< 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:44,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {603#(and (< 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {599#(and (<= |ULTIMATE.start_main_~j~0#1| 7) (< 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:44,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {607#(<= |ULTIMATE.start_main_~j~0#1| 5)} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {603#(and (< 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} is VALID [2022-02-21 03:24:44,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {548#true} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {607#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-21 03:24:44,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {548#true} is VALID [2022-02-21 03:24:44,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#true} assume { :begin_inline_ULTIMATE.init } true; {548#true} is VALID [2022-02-21 03:24:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788562843] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:44,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:44,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-02-21 03:24:44,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444143285] [2022-02-21 03:24:44,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:44,793 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:44,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:44,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:44,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:44,793 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:44,793 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:44,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:44,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration3_Loop [2022-02-21 03:24:44,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:44,794 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:44,795 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,800 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,802 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,804 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,867 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:44,867 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:44,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,868 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:44,880 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:44,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:44,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,931 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,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,933 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:24:44,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:44,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,011 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:45,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,018 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:45,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:45,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:45,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:45,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:45,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:45,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:45,018 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration3_Loop [2022-02-21 03:24:45,018 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:45,018 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:45,019 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:45,030 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:45,033 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:45,037 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:45,095 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:45,096 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,112 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:45,118 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:45,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:45,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:45,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:45,129 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:45,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:45,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:45,153 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:45,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,155 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:45,156 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:45,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:45,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:45,157 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:45,157 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2022-02-21 03:24:45,176 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:45,180 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:45,183 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9);" "main_~i~0#1 := 1 + main_~i~0#1;" "assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0;" [2022-02-21 03:24:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#unseeded} assume { :begin_inline_ULTIMATE.init } true; {614#unseeded} is VALID [2022-02-21 03:24:45,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {614#unseeded} is VALID [2022-02-21 03:24:45,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {614#unseeded} is VALID [2022-02-21 03:24:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} is VALID [2022-02-21 03:24:45,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} is VALID [2022-02-21 03:24:45,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} is VALID [2022-02-21 03:24:45,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} is VALID [2022-02-21 03:24:45,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} is VALID [2022-02-21 03:24:45,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))} main_~i~0#1 := 1 + main_~i~0#1; {653#(<= (+ (div (+ (- 7) oldRank0) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:45,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {653#(<= (+ (div (+ (- 7) oldRank0) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {627#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 7))) unseeded)} is VALID [2022-02-21 03:24:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:24:45,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,265 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:45,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. [2022-02-21 03:24:45,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,265 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:45,265 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 34 states and 42 transitions. Complement of second has 6 states. [2022-02-21 03:24:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:45,290 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:45,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:45,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2022-02-21 03:24:45,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:45,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,292 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 24 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:45,292 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:24:45,292 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:45,293 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:45,293 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 42 transitions. cyclomatic complexity: 12 [2022-02-21 03:24:45,293 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:24:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. [2022-02-21 03:24:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:24:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 3 letters. [2022-02-21 03:24:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:24:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 34 letters. Loop has 34 letters. [2022-02-21 03:24:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:24:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 19 letters. Loop has 19 letters. [2022-02-21 03:24:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:24:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:24:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. [2022-02-21 03:24:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:24:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:24:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 7 letters. [2022-02-21 03:24:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:24:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 7 letters. [2022-02-21 03:24:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 5 letters. Loop has 7 letters. [2022-02-21 03:24:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 7 letters. [2022-02-21 03:24:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:24:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. [2022-02-21 03:24:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:24:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 7 letters. [2022-02-21 03:24:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 4 letters. Loop has 7 letters. [2022-02-21 03:24:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 7 letters. [2022-02-21 03:24:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:24:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 9 letters. Loop has 7 letters. [2022-02-21 03:24:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:24:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 3 letters. [2022-02-21 03:24:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:45,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:24:45,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,303 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:24:45,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:24:45,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 7 letters. [2022-02-21 03:24:45,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 14 letters. [2022-02-21 03:24:45,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. cyclomatic complexity: 12 [2022-02-21 03:24:45,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:45,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2022-02-21 03:24:45,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:24:45,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:24:45,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-02-21 03:24:45,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:45,307 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:24:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-02-21 03:24:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-02-21 03:24:45,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:45,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 31 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,308 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 31 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,308 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,309 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:45,309 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 03:24:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:24:45,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:45,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:45,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 31 transitions. [2022-02-21 03:24:45,310 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 31 transitions. [2022-02-21 03:24:45,310 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:45,311 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 03:24:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:24:45,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:45,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:45,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:45,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-02-21 03:24:45,312 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-02-21 03:24:45,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:24:45,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:24:45,313 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:45,386 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-21 03:24:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:24:45,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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:45,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:45,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2022-02-21 03:24:45,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:45,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2022-02-21 03:24:45,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:24:45,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:24:45,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2022-02-21 03:24:45,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:45,400 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-02-21 03:24:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2022-02-21 03:24:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-02-21 03:24:45,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:45,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 49 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:45,402 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 49 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:45,403 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:45,403 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:45,404 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-02-21 03:24:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-21 03:24:45,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:45,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:45,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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 42 states and 49 transitions. [2022-02-21 03:24:45,405 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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 42 states and 49 transitions. [2022-02-21 03:24:45,405 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:45,406 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-02-21 03:24:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-21 03:24:45,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:45,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:45,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:45,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-02-21 03:24:45,407 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-21 03:24:45,407 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-21 03:24:45,408 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:45,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2022-02-21 03:24:45,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:24:45,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:45,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,451 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:45,451 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:45,451 INFO L791 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 861#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 856#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 857#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 853#L19-2 [2022-02-21 03:24:45,451 INFO L793 eck$LassoCheckResult]: Loop: 853#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 853#L19-2 [2022-02-21 03:24:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2022-02-21 03:24:45,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:45,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785846772] [2022-02-21 03:24:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,457 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,459 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2022-02-21 03:24:45,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:45,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577520256] [2022-02-21 03:24:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,465 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 28699944, now seen corresponding path program 2 times [2022-02-21 03:24:45,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:45,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211555674] [2022-02-21 03:24:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,475 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:45,488 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:45,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:45,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:45,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:45,488 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:45,488 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:45,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:45,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration4_Loop [2022-02-21 03:24:45,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:45,489 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:45,489 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:45,492 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:45,494 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:45,497 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:45,533 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:45,533 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,534 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:45,570 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:45,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:45,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,588 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:45,589 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:45,623 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:45,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,624 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:45,625 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:45,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:45,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,648 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:45,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:45,664 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,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,666 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:24:45,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:45,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,723 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:24:45,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:45,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,767 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:45,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,777 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:45,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:45,777 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:45,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:45,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:45,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:45,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:45,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration4_Loop [2022-02-21 03:24:45,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:45,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:45,778 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:45,781 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:45,783 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:45,787 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:45,832 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:45,832 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:45,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,844 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:24:45,847 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:45,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:45,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:45,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:45,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,899 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,901 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:45,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:45,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:45,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:24:45,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:45,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,941 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:24:45,968 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:45,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:45,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:45,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:45,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:45,986 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:45,986 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:45,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,988 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:46,012 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:46,012 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:46,012 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 19 Supporting invariants [] [2022-02-21 03:24:46,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:24:46,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,061 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:46,064 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" [2022-02-21 03:24:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {1029#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1029#unseeded} is VALID [2022-02-21 03:24:46,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1029#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1029#unseeded} is VALID [2022-02-21 03:24:46,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1029#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1029#unseeded} is VALID [2022-02-21 03:24:46,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {1029#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1029#unseeded} is VALID [2022-02-21 03:24:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,093 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {1032#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1042#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))))} is VALID [2022-02-21 03:24:46,097 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:46,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,100 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:46,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,100 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:46,100 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 67 states and 79 transitions. Complement of second has 5 states. [2022-02-21 03:24:46,116 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:46,116 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:46,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 79 transitions. [2022-02-21 03:24:46,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 40 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:46,119 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 79 transitions. cyclomatic complexity: 19 [2022-02-21 03:24:46,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:24:46,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 67 letters. Loop has 67 letters. [2022-02-21 03:24:46,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:24:46,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:24:46,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 33 letters. Loop has 33 letters. [2022-02-21 03:24:46,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:24:46,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 79 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,129 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:46,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:46,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:46,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 79 transitions. cyclomatic complexity: 19 [2022-02-21 03:24:46,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 61 states and 72 transitions. [2022-02-21 03:24:46,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:46,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:46,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 72 transitions. [2022-02-21 03:24:46,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:46,133 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-02-21 03:24:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 72 transitions. [2022-02-21 03:24:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2022-02-21 03:24:46,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:46,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 72 transitions. Second operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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:46,135 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 72 transitions. Second operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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:46,135 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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:46,135 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:46,136 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-02-21 03:24:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-02-21 03:24:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:46,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:46,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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 61 states and 72 transitions. [2022-02-21 03:24:46,137 INFO L87 Difference]: Start difference. First operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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 61 states and 72 transitions. [2022-02-21 03:24:46,137 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:46,138 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-02-21 03:24:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-02-21 03:24:46,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:46,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:46,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:46,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-02-21 03:24:46,140 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-02-21 03:24:46,140 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-02-21 03:24:46,140 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:46,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 46 transitions. [2022-02-21 03:24:46,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,141 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 2, 1, 1, 1, 1] [2022-02-21 03:24:46,141 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:46,141 INFO L791 eck$LassoCheckResult]: Stem: 1137#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1133#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 1130#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1131#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1132#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1165#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1163#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1161#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1159#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1157#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1155#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1153#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1151#L19-2 assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); 1139#L19-3 main_~i~0#1 := 1 + main_~i~0#1; 1140#L17-2 assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; 1142#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1141#L19-2 [2022-02-21 03:24:46,141 INFO L793 eck$LassoCheckResult]: Loop: 1141#L19-2 assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; 1141#L19-2 [2022-02-21 03:24:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash -178305705, now seen corresponding path program 3 times [2022-02-21 03:24:46,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720466892] [2022-02-21 03:24:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,179 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2022-02-21 03:24:46,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919510191] [2022-02-21 03:24:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,185 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1232509539, now seen corresponding path program 4 times [2022-02-21 03:24:46,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856440595] [2022-02-21 03:24:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,222 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,234 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:46,235 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:46,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:46,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:46,235 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:46,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:46,235 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:46,235 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration5_Loop [2022-02-21 03:24:46,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:46,235 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:46,236 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:46,240 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:46,242 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:46,244 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:46,281 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:46,281 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,283 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:24:46,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:46,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:46,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,330 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:24:46,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:46,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:46,360 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:46,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:24:46,364 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:46,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:46,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:46,364 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:46,364 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:46,364 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,364 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:46,364 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:46,364 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2.c_Iteration5_Loop [2022-02-21 03:24:46,364 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:46,364 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:46,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,369 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:46,372 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:46,374 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:46,416 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:46,417 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:46,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,418 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:24:46,420 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:46,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:46,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:46,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:46,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:46,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:46,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:46,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:46,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:46,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:46,440 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:46,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,442 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:24:46,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:46,444 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:46,444 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:46,444 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 19 Supporting invariants [] [2022-02-21 03:24:46,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,467 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:46,470 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1;" [2022-02-21 03:24:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {1394#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1394#unseeded} is VALID [2022-02-21 03:24:46,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1394#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1394#unseeded} is VALID [2022-02-21 03:24:46,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {1394#unseeded} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {1394#unseeded} is VALID [2022-02-21 03:24:46,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {1394#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1394#unseeded} is VALID [2022-02-21 03:24:46,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,582 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1407#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))))} is VALID [2022-02-21 03:24:46,592 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:46,592 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:46,599 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:46,599 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,599 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:46,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 46 transitions. cyclomatic complexity: 13 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:46,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 46 transitions. cyclomatic complexity: 13. 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 65 states and 76 transitions. Complement of second has 5 states. [2022-02-21 03:24:46,623 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:46,623 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 46 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,623 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:46,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2022-02-21 03:24:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 46 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,624 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,624 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:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 76 transitions. cyclomatic complexity: 17 [2022-02-21 03:24:46,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,625 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,626 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:46,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,627 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:46,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,628 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 65 letters. Loop has 65 letters. [2022-02-21 03:24:46,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:46,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,628 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 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,629 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:46,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,629 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,630 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:46,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,631 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,632 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,632 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:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:46,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,633 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {1394#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1394#unseeded} is VALID [2022-02-21 03:24:46,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {1394#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1394#unseeded} is VALID [2022-02-21 03:24:46,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {1394#unseeded} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {1394#unseeded} is VALID [2022-02-21 03:24:46,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {1394#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1394#unseeded} is VALID [2022-02-21 03:24:46,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,727 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1407#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))))} is VALID [2022-02-21 03:24:46,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:46,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:46,733 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:46,734 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,734 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:46,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 46 transitions. cyclomatic complexity: 13 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:46,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 46 transitions. cyclomatic complexity: 13. 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 65 states and 76 transitions. Complement of second has 5 states. [2022-02-21 03:24:46,753 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:46,753 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 46 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,753 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:46,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2022-02-21 03:24:46,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 46 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,755 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:46,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 76 transitions. cyclomatic complexity: 17 [2022-02-21 03:24:46,756 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,756 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,757 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:46,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:46,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,770 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 65 letters. Loop has 65 letters. [2022-02-21 03:24:46,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:46,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,770 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 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,771 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:46,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,772 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,772 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:46,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,773 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 76 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,774 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,774 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:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:46,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,775 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {1394#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1394#unseeded} is VALID [2022-02-21 03:24:46,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {1394#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1394#unseeded} is VALID [2022-02-21 03:24:46,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {1394#unseeded} assume !(main_~i~0#1 > 2 && main_~j~0#1 <= 9); {1394#unseeded} is VALID [2022-02-21 03:24:46,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {1394#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 < 5);main_~j~0#1 := 0; {1394#unseeded} is VALID [2022-02-21 03:24:46,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#unseeded} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1394#unseeded} is VALID [2022-02-21 03:24:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,858 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))} assume !!(main_~i~0#1 > 2 && main_~j~0#1 <= 9);main_~j~0#1 := 1 + main_~j~0#1; {1407#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) 19))))} is VALID [2022-02-21 03:24:46,862 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:46,862 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:46,865 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:46,865 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,866 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:46,866 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 46 transitions. cyclomatic complexity: 13 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:46,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 46 transitions. cyclomatic complexity: 13. 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 42 states and 51 transitions. Complement of second has 4 states. [2022-02-21 03:24:46,888 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:46,888 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 46 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,888 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:46,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2022-02-21 03:24:46,889 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:46,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:46,889 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 46 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,890 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:46,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:46,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:46,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:46,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:46,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,891 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,892 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:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:24:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,892 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 42 letters. Loop has 42 letters. [2022-02-21 03:24:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:24:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,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 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,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 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,894 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 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 46 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,895 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:46,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 51 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:46,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,895 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,896 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:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:24:46,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 17 letters. Loop has 1 letters. [2022-02-21 03:24:46,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 18 letters. Loop has 1 letters. [2022-02-21 03:24:46,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:24:46,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:46,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:46,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2022-02-21 03:24:46,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:46,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:46,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:46,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:46,912 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:46,912 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:46,912 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:46,912 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:24:46,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:46,912 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:46,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:46,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:46 BoogieIcfgContainer [2022-02-21 03:24:46,917 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:46,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:46,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:46,918 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:46,918 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:46,920 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:46,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:46,921 INFO L158 Benchmark]: Toolchain (without parser) took 5787.23ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 59.0MB in the beginning and 76.0MB in the end (delta: -17.0MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:46,921 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:46,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.00ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 72.5MB in the end (delta: -13.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-21 03:24:46,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.20ms. Allocated memory is still 94.4MB. Free memory was 72.5MB in the beginning and 71.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:46,922 INFO L158 Benchmark]: Boogie Preprocessor took 18.66ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 70.1MB in the end (delta: 910.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:46,922 INFO L158 Benchmark]: RCFGBuilder took 236.36ms. Allocated memory is still 94.4MB. Free memory was 70.1MB in the beginning and 61.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:46,922 INFO L158 Benchmark]: BuchiAutomizer took 5313.84ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 61.7MB in the beginning and 76.0MB in the end (delta: -14.3MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:46,922 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:46,923 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.10ms. Allocated memory is still 94.4MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.00ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 72.5MB in the end (delta: -13.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.20ms. Allocated memory is still 94.4MB. Free memory was 72.5MB in the beginning and 71.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.66ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 70.1MB in the end (delta: 910.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 236.36ms. Allocated memory is still 94.4MB. Free memory was 70.1MB in the beginning and 61.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5313.84ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 61.7MB in the beginning and 76.0MB in the end (delta: -14.3MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 5 and consists of 6 locations. One deterministic module has affine ranking function j and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 19 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 19 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 5.2s and 6 iterations. TraceHistogramMax:11. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/11 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 55 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax174 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp93 dnf100 smp100 tf113 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:46,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,359 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