./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 3541aecf478299480794baff15bf7221032b5abc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:18:25,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:18:25,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:18:25,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:18:25,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:18:25,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:18:25,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:18:25,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:18:25,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:18:25,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:18:25,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:18:25,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:18:25,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:18:25,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:18:25,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:18:25,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:18:25,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:18:25,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:18:25,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:18:25,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:18:25,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:18:25,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:18:25,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:18:25,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:18:25,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:18:25,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:18:25,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:18:25,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:18:25,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:18:25,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:18:25,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:18:25,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:18:25,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:18:25,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:18:25,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:18:25,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:18:25,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:18:25,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:18:25,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:18:25,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:18:25,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:18:25,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:18:25,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:18:25,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:18:25,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:18:25,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:18:25,264 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:18:25,265 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:18:25,265 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:18:25,265 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:18:25,266 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:18:25,266 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:18:25,267 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:18:25,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:18:25,268 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:18:25,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:18:25,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:18:25,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:18:25,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:18:25,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:18:25,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:18:25,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:18:25,270 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:18:25,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:18:25,271 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:18:25,271 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:18:25,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:18:25,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:18:25,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:18:25,272 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:18:25,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:18:25,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:18:25,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:18:25,273 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:18:25,274 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:18:25,274 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3541aecf478299480794baff15bf7221032b5abc [2020-07-29 03:18:25,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:18:25,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:18:25,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:18:25,603 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:18:25,604 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:18:25,605 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2020-07-29 03:18:25,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67e0a599/cb06ce4a081b485da76d132dc28237af/FLAGae672af9f [2020-07-29 03:18:26,171 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:18:26,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2020-07-29 03:18:26,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67e0a599/cb06ce4a081b485da76d132dc28237af/FLAGae672af9f [2020-07-29 03:18:26,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67e0a599/cb06ce4a081b485da76d132dc28237af [2020-07-29 03:18:26,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:18:26,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:18:26,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:26,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:18:26,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:18:26,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:26,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d494b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26, skipping insertion in model container [2020-07-29 03:18:26,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:26,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:18:26,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:18:26,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:26,841 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:18:26,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:26,982 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:18:26,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26 WrapperNode [2020-07-29 03:18:26,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:26,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:26,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:18:26,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:18:26,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:27,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:18:27,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:18:27,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:18:27,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... [2020-07-29 03:18:27,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:18:27,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:18:27,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:18:27,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:18:27,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:27,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:18:27,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:18:27,946 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:18:27,947 INFO L295 CfgBuilder]: Removed 19 assume(true) statements. [2020-07-29 03:18:27,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:27 BoogieIcfgContainer [2020-07-29 03:18:27,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:18:27,953 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:18:27,953 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:18:27,956 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:18:27,957 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:27,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:18:26" (1/3) ... [2020-07-29 03:18:27,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4490a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:27, skipping insertion in model container [2020-07-29 03:18:27,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:27,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:26" (2/3) ... [2020-07-29 03:18:27,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4490a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:27, skipping insertion in model container [2020-07-29 03:18:27,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:27,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:27" (3/3) ... [2020-07-29 03:18:27,961 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2020-07-29 03:18:28,003 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:18:28,003 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:18:28,003 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:18:28,003 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:18:28,003 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:18:28,004 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:18:28,004 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:18:28,004 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:18:28,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-07-29 03:18:28,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-07-29 03:18:28,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:28,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:28,066 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:28,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:28,066 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:18:28,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-07-29 03:18:28,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-07-29 03:18:28,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:28,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:28,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:28,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:28,088 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 11#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 24#L209true assume !(0 == ~r1~0);init_~tmp~0 := 0; 22#L209-1true init_#res := init_~tmp~0; 77#L302true main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; 16#L358true assume !(0 == main_~i2~0); 3#L358-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 64#L368-2true [2020-07-29 03:18:28,089 INFO L796 eck$LassoCheckResult]: Loop: 64#L368-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 33#L106true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 41#L110true assume !(node1_~m1~0 != ~nomsg~0); 37#L110-1true ~mode1~0 := 0; 8#L106-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 67#L134true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 50#L137true assume !(node2_~m2~0 != ~nomsg~0); 49#L137-1true ~mode2~0 := 0; 78#L134-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 71#L159true assume !(0 != ~mode3~0 % 256); 36#L172true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 34#L172-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 48#L159-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 60#L184true assume !(0 != ~mode4~0 % 256); 4#L197true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 18#L197-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 56#L184-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 7#L310true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 9#L310-1true check_#res := check_~tmp~1; 51#L330true main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 30#L395true assume !(0 == assert_~arg % 256); 75#L390true main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 64#L368-2true [2020-07-29 03:18:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2020-07-29 03:18:28,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:28,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730346551] [2020-07-29 03:18:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:28,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; {80#true} is VALID [2020-07-29 03:18:28,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#true} havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {80#true} is VALID [2020-07-29 03:18:28,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {82#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:18:28,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {83#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:18:28,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; {84#(= 0 ULTIMATE.start_main_~i2~0)} is VALID [2020-07-29 03:18:28,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#(= 0 ULTIMATE.start_main_~i2~0)} assume !(0 == main_~i2~0); {81#false} is VALID [2020-07-29 03:18:28,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {81#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; {81#false} is VALID [2020-07-29 03:18:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:28,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730346551] [2020-07-29 03:18:28,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:28,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:28,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051397729] [2020-07-29 03:18:28,362 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:18:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash 712570273, now seen corresponding path program 1 times [2020-07-29 03:18:28,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:28,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008838251] [2020-07-29 03:18:28,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:28,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {85#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {85#true} is VALID [2020-07-29 03:18:28,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {85#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {85#true} is VALID [2020-07-29 03:18:28,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} assume !(node1_~m1~0 != ~nomsg~0); {85#true} is VALID [2020-07-29 03:18:28,558 INFO L280 TraceCheckUtils]: 3: Hoare triple {85#true} ~mode1~0 := 0; {85#true} is VALID [2020-07-29 03:18:28,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {85#true} is VALID [2020-07-29 03:18:28,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {85#true} is VALID [2020-07-29 03:18:28,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#true} assume !(node2_~m2~0 != ~nomsg~0); {85#true} is VALID [2020-07-29 03:18:28,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {85#true} ~mode2~0 := 0; {85#true} is VALID [2020-07-29 03:18:28,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {85#true} is VALID [2020-07-29 03:18:28,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#true} assume !(0 != ~mode3~0 % 256); {85#true} is VALID [2020-07-29 03:18:28,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {85#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {85#true} is VALID [2020-07-29 03:18:28,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {85#true} is VALID [2020-07-29 03:18:28,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {85#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {85#true} is VALID [2020-07-29 03:18:28,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#true} assume !(0 != ~mode4~0 % 256); {85#true} is VALID [2020-07-29 03:18:28,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; {85#true} is VALID [2020-07-29 03:18:28,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#true} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {85#true} is VALID [2020-07-29 03:18:28,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {85#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {85#true} is VALID [2020-07-29 03:18:28,564 INFO L280 TraceCheckUtils]: 17: Hoare triple {85#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; {87#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:28,565 INFO L280 TraceCheckUtils]: 18: Hoare triple {87#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {88#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:28,567 INFO L280 TraceCheckUtils]: 19: Hoare triple {88#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {89#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:28,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {89#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {86#false} is VALID [2020-07-29 03:18:28,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {86#false} main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; {86#false} is VALID [2020-07-29 03:18:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:28,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008838251] [2020-07-29 03:18:28,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:28,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:28,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718974249] [2020-07-29 03:18:28,576 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:28,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:28,594 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2020-07-29 03:18:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:29,192 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2020-07-29 03:18:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:18:29,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:29,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:29,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2020-07-29 03:18:29,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-07-29 03:18:29,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2020-07-29 03:18:29,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-07-29 03:18:29,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-07-29 03:18:29,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2020-07-29 03:18:29,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:29,258 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 163 transitions. [2020-07-29 03:18:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2020-07-29 03:18:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2020-07-29 03:18:29,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:29,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 163 transitions. Second operand 71 states. [2020-07-29 03:18:29,310 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 163 transitions. Second operand 71 states. [2020-07-29 03:18:29,312 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand 71 states. [2020-07-29 03:18:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:29,330 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2020-07-29 03:18:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2020-07-29 03:18:29,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:29,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:29,337 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 113 states and 163 transitions. [2020-07-29 03:18:29,338 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 113 states and 163 transitions. [2020-07-29 03:18:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:29,349 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2020-07-29 03:18:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2020-07-29 03:18:29,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:29,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:29,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:29,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-29 03:18:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2020-07-29 03:18:29,371 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2020-07-29 03:18:29,371 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2020-07-29 03:18:29,372 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:18:29,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2020-07-29 03:18:29,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-07-29 03:18:29,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:29,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:29,377 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:29,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:29,378 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 232#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 233#L209 assume 0 == ~r1~0; 250#L210 assume ~id1~0 >= 0; 276#L211 assume 0 == ~st1~0; 230#L212 assume ~send1~0 == ~id1~0; 231#L213 assume 0 == ~mode1~0 % 256; 280#L214 assume ~id2~0 >= 0; 237#L215 assume 0 == ~st2~0; 238#L216 assume ~send2~0 == ~id2~0; 268#L217 assume 0 == ~mode2~0 % 256; 284#L218 assume ~id3~0 >= 0; 220#L219 assume 0 == ~st3~0; 221#L220 assume ~send3~0 == ~id3~0; 253#L221 assume 0 == ~mode3~0 % 256; 277#L222 assume ~id4~0 >= 0; 259#L223 assume 0 == ~st4~0; 260#L224 assume ~send4~0 == ~id4~0; 281#L225 assume 0 == ~mode4~0 % 256; 239#L226 assume ~id1~0 != ~id2~0; 240#L227 assume ~id1~0 != ~id3~0; 270#L228 assume ~id1~0 != ~id4~0; 285#L229 assume ~id2~0 != ~id3~0; 222#L230 assume ~id2~0 != ~id4~0; 223#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 246#L209-1 init_#res := init_~tmp~0; 247#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; 241#L358 assume !(0 == main_~i2~0); 216#L358-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 217#L368-2 [2020-07-29 03:18:29,378 INFO L796 eck$LassoCheckResult]: Loop: 217#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 261#L106 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 262#L110 assume !(node1_~m1~0 != ~nomsg~0); 255#L110-1 ~mode1~0 := 0; 227#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 228#L134 assume !(0 != ~mode2~0 % 256); 258#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 251#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 252#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 286#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 282#L162 assume !(node3_~m3~0 != ~nomsg~0); 274#L162-1 ~mode3~0 := 0; 265#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 278#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 248#L187 assume !(node4_~m4~0 != ~nomsg~0); 245#L187-1 ~mode4~0 := 0; 242#L184-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 224#L310 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 226#L310-1 check_#res := check_~tmp~1; 229#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 256#L395 assume !(0 == assert_~arg % 256); 257#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 217#L368-2 [2020-07-29 03:18:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2020-07-29 03:18:29,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:29,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870728745] [2020-07-29 03:18:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:29,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:29,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:29,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1857474347, now seen corresponding path program 1 times [2020-07-29 03:18:29,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:29,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354661594] [2020-07-29 03:18:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:29,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume !(node1_~m1~0 != ~nomsg~0); {518#true} is VALID [2020-07-29 03:18:29,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} ~mode1~0 := 0; {518#true} is VALID [2020-07-29 03:18:29,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(0 != ~mode2~0 % 256); {518#true} is VALID [2020-07-29 03:18:29,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {518#true} is VALID [2020-07-29 03:18:29,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {518#true} is VALID [2020-07-29 03:18:29,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,661 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,661 INFO L280 TraceCheckUtils]: 10: Hoare triple {518#true} assume !(node3_~m3~0 != ~nomsg~0); {518#true} is VALID [2020-07-29 03:18:29,661 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} ~mode3~0 := 0; {518#true} is VALID [2020-07-29 03:18:29,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {518#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {518#true} is VALID [2020-07-29 03:18:29,662 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#true} assume !(node4_~m4~0 != ~nomsg~0); {518#true} is VALID [2020-07-29 03:18:29,662 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#true} ~mode4~0 := 0; {518#true} is VALID [2020-07-29 03:18:29,663 INFO L280 TraceCheckUtils]: 16: Hoare triple {518#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {518#true} is VALID [2020-07-29 03:18:29,664 INFO L280 TraceCheckUtils]: 17: Hoare triple {518#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; {520#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:29,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {520#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {521#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:29,666 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {522#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:29,667 INFO L280 TraceCheckUtils]: 20: Hoare triple {522#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {519#false} is VALID [2020-07-29 03:18:29,667 INFO L280 TraceCheckUtils]: 21: Hoare triple {519#false} main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; {519#false} is VALID [2020-07-29 03:18:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:29,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354661594] [2020-07-29 03:18:29,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:29,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:29,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245682056] [2020-07-29 03:18:29,670 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:29,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:29,671 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand 5 states. [2020-07-29 03:18:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:30,045 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2020-07-29 03:18:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:30,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:30,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:30,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2020-07-29 03:18:30,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-07-29 03:18:30,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2020-07-29 03:18:30,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-07-29 03:18:30,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-07-29 03:18:30,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2020-07-29 03:18:30,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:30,088 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-07-29 03:18:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2020-07-29 03:18:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-07-29 03:18:30,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:30,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 93 transitions. Second operand 71 states. [2020-07-29 03:18:30,092 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 93 transitions. Second operand 71 states. [2020-07-29 03:18:30,092 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 71 states. [2020-07-29 03:18:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:30,095 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2020-07-29 03:18:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2020-07-29 03:18:30,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:30,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:30,096 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states and 93 transitions. [2020-07-29 03:18:30,096 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states and 93 transitions. [2020-07-29 03:18:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:30,099 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2020-07-29 03:18:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2020-07-29 03:18:30,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:30,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:30,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:30,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-29 03:18:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2020-07-29 03:18:30,103 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-07-29 03:18:30,103 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-07-29 03:18:30,103 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:18:30,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2020-07-29 03:18:30,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-07-29 03:18:30,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:30,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:30,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:30,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:30,106 INFO L794 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 617#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 618#L209 assume 0 == ~r1~0; 635#L210 assume ~id1~0 >= 0; 661#L211 assume 0 == ~st1~0; 615#L212 assume ~send1~0 == ~id1~0; 616#L213 assume 0 == ~mode1~0 % 256; 665#L214 assume ~id2~0 >= 0; 622#L215 assume 0 == ~st2~0; 623#L216 assume ~send2~0 == ~id2~0; 653#L217 assume 0 == ~mode2~0 % 256; 669#L218 assume ~id3~0 >= 0; 605#L219 assume 0 == ~st3~0; 606#L220 assume ~send3~0 == ~id3~0; 638#L221 assume 0 == ~mode3~0 % 256; 662#L222 assume ~id4~0 >= 0; 644#L223 assume 0 == ~st4~0; 645#L224 assume ~send4~0 == ~id4~0; 666#L225 assume 0 == ~mode4~0 % 256; 624#L226 assume ~id1~0 != ~id2~0; 625#L227 assume ~id1~0 != ~id3~0; 655#L228 assume ~id1~0 != ~id4~0; 670#L229 assume ~id2~0 != ~id3~0; 607#L230 assume ~id2~0 != ~id4~0; 608#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 631#L209-1 init_#res := init_~tmp~0; 632#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; 626#L358 assume !(0 == main_~i2~0); 601#L358-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 602#L368-2 [2020-07-29 03:18:30,106 INFO L796 eck$LassoCheckResult]: Loop: 602#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 646#L106 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 647#L110 assume !(node1_~m1~0 != ~nomsg~0); 640#L110-1 ~mode1~0 := 0; 611#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 612#L134 assume !(0 != ~mode2~0 % 256); 643#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 636#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 637#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 671#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 667#L162 assume !(node3_~m3~0 != ~nomsg~0); 659#L162-1 ~mode3~0 := 0; 650#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 663#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 633#L187 assume !(node4_~m4~0 != ~nomsg~0); 630#L187-1 ~mode4~0 := 0; 627#L184-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 609#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 610#L311 assume ~r1~0 >= 4; 629#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 613#L310-1 check_#res := check_~tmp~1; 614#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 641#L395 assume !(0 == assert_~arg % 256); 642#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 602#L368-2 [2020-07-29 03:18:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2020-07-29 03:18:30,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:30,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972861170] [2020-07-29 03:18:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:30,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:30,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:30,160 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1205598395, now seen corresponding path program 1 times [2020-07-29 03:18:30,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:30,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18410544] [2020-07-29 03:18:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:30,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#true} assume !(node1_~m1~0 != ~nomsg~0); {819#true} is VALID [2020-07-29 03:18:30,193 INFO L280 TraceCheckUtils]: 3: Hoare triple {819#true} ~mode1~0 := 0; {819#true} is VALID [2020-07-29 03:18:30,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {819#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,193 INFO L280 TraceCheckUtils]: 5: Hoare triple {819#true} assume !(0 != ~mode2~0 % 256); {819#true} is VALID [2020-07-29 03:18:30,194 INFO L280 TraceCheckUtils]: 6: Hoare triple {819#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {819#true} is VALID [2020-07-29 03:18:30,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {819#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {819#true} is VALID [2020-07-29 03:18:30,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {819#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {819#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,195 INFO L280 TraceCheckUtils]: 10: Hoare triple {819#true} assume !(node3_~m3~0 != ~nomsg~0); {819#true} is VALID [2020-07-29 03:18:30,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {819#true} ~mode3~0 := 0; {819#true} is VALID [2020-07-29 03:18:30,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {819#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {819#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {819#true} is VALID [2020-07-29 03:18:30,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {819#true} assume !(node4_~m4~0 != ~nomsg~0); {819#true} is VALID [2020-07-29 03:18:30,196 INFO L280 TraceCheckUtils]: 15: Hoare triple {819#true} ~mode4~0 := 0; {819#true} is VALID [2020-07-29 03:18:30,196 INFO L280 TraceCheckUtils]: 16: Hoare triple {819#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {819#true} is VALID [2020-07-29 03:18:30,196 INFO L280 TraceCheckUtils]: 17: Hoare triple {819#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {819#true} is VALID [2020-07-29 03:18:30,197 INFO L280 TraceCheckUtils]: 18: Hoare triple {819#true} assume ~r1~0 >= 4; {821#(< 3 ~r1~0)} is VALID [2020-07-29 03:18:30,198 INFO L280 TraceCheckUtils]: 19: Hoare triple {821#(< 3 ~r1~0)} assume ~r1~0 < 4;check_~tmp~1 := 1; {820#false} is VALID [2020-07-29 03:18:30,198 INFO L280 TraceCheckUtils]: 20: Hoare triple {820#false} check_#res := check_~tmp~1; {820#false} is VALID [2020-07-29 03:18:30,199 INFO L280 TraceCheckUtils]: 21: Hoare triple {820#false} main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {820#false} is VALID [2020-07-29 03:18:30,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {820#false} assume !(0 == assert_~arg % 256); {820#false} is VALID [2020-07-29 03:18:30,199 INFO L280 TraceCheckUtils]: 23: Hoare triple {820#false} main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; {820#false} is VALID [2020-07-29 03:18:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:30,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18410544] [2020-07-29 03:18:30,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:30,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:30,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270484536] [2020-07-29 03:18:30,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:30,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:30,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:30,202 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-07-29 03:18:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:30,382 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2020-07-29 03:18:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:18:30,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:30,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:30,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2020-07-29 03:18:30,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:18:30,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2020-07-29 03:18:30,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2020-07-29 03:18:30,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2020-07-29 03:18:30,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2020-07-29 03:18:30,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:30,429 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-07-29 03:18:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2020-07-29 03:18:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-07-29 03:18:30,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:30,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states and 146 transitions. Second operand 107 states. [2020-07-29 03:18:30,436 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states and 146 transitions. Second operand 107 states. [2020-07-29 03:18:30,437 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand 107 states. [2020-07-29 03:18:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:30,443 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2020-07-29 03:18:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2020-07-29 03:18:30,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:30,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:30,444 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states and 146 transitions. [2020-07-29 03:18:30,445 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states and 146 transitions. [2020-07-29 03:18:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:30,451 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2020-07-29 03:18:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2020-07-29 03:18:30,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:30,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:30,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:30,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-29 03:18:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2020-07-29 03:18:30,458 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-07-29 03:18:30,458 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-07-29 03:18:30,458 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:18:30,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2020-07-29 03:18:30,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:18:30,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:30,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:30,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:30,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:30,461 INFO L794 eck$LassoCheckResult]: Stem: 981#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 945#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 946#L209 assume 0 == ~r1~0; 964#L210 assume ~id1~0 >= 0; 991#L211 assume 0 == ~st1~0; 943#L212 assume ~send1~0 == ~id1~0; 944#L213 assume 0 == ~mode1~0 % 256; 996#L214 assume ~id2~0 >= 0; 950#L215 assume 0 == ~st2~0; 951#L216 assume ~send2~0 == ~id2~0; 983#L217 assume 0 == ~mode2~0 % 256; 1001#L218 assume ~id3~0 >= 0; 933#L219 assume 0 == ~st3~0; 934#L220 assume ~send3~0 == ~id3~0; 967#L221 assume 0 == ~mode3~0 % 256; 992#L222 assume ~id4~0 >= 0; 974#L223 assume 0 == ~st4~0; 975#L224 assume ~send4~0 == ~id4~0; 997#L225 assume 0 == ~mode4~0 % 256; 952#L226 assume ~id1~0 != ~id2~0; 953#L227 assume ~id1~0 != ~id3~0; 985#L228 assume ~id1~0 != ~id4~0; 1002#L229 assume ~id2~0 != ~id3~0; 935#L230 assume ~id2~0 != ~id4~0; 936#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 960#L209-1 init_#res := init_~tmp~0; 961#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; 954#L358 assume !(0 == main_~i2~0); 929#L358-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 930#L368-2 [2020-07-29 03:18:30,462 INFO L796 eck$LassoCheckResult]: Loop: 930#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 976#L106 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 977#L110 assume !(node1_~m1~0 != ~nomsg~0); 970#L110-1 ~mode1~0 := 0; 939#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 940#L134 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 994#L137 assume !(node2_~m2~0 != ~nomsg~0); 948#L137-1 ~mode2~0 := 0; 966#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1003#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1004#L162 assume !(node3_~m3~0 != ~nomsg~0); 1015#L162-1 ~mode3~0 := 0; 1014#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1013#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1011#L187 assume !(node4_~m4~0 != ~nomsg~0); 1009#L187-1 ~mode4~0 := 0; 1008#L184-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1007#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1006#L311 assume !(~r1~0 >= 4); 957#L314 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 958#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 941#L310-1 check_#res := check_~tmp~1; 942#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 971#L395 assume !(0 == assert_~arg % 256); 972#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 930#L368-2 [2020-07-29 03:18:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2020-07-29 03:18:30,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:30,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439704998] [2020-07-29 03:18:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:30,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:30,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:30,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:30,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1952018779, now seen corresponding path program 1 times [2020-07-29 03:18:30,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:30,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845072957] [2020-07-29 03:18:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:30,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:30,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:30,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 993908661, now seen corresponding path program 1 times [2020-07-29 03:18:30,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:30,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964972477] [2020-07-29 03:18:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:30,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; {1257#true} is VALID [2020-07-29 03:18:30,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1257#true} is VALID [2020-07-29 03:18:30,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume 0 == ~r1~0; {1257#true} is VALID [2020-07-29 03:18:30,687 INFO L280 TraceCheckUtils]: 3: Hoare triple {1257#true} assume ~id1~0 >= 0; {1257#true} is VALID [2020-07-29 03:18:30,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} assume 0 == ~st1~0; {1257#true} is VALID [2020-07-29 03:18:30,688 INFO L280 TraceCheckUtils]: 5: Hoare triple {1257#true} assume ~send1~0 == ~id1~0; {1257#true} is VALID [2020-07-29 03:18:30,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} assume 0 == ~mode1~0 % 256; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,690 INFO L280 TraceCheckUtils]: 7: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,692 INFO L280 TraceCheckUtils]: 9: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,693 INFO L280 TraceCheckUtils]: 12: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,694 INFO L280 TraceCheckUtils]: 13: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,695 INFO L280 TraceCheckUtils]: 14: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,695 INFO L280 TraceCheckUtils]: 15: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,696 INFO L280 TraceCheckUtils]: 16: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,697 INFO L280 TraceCheckUtils]: 17: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,697 INFO L280 TraceCheckUtils]: 18: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,698 INFO L280 TraceCheckUtils]: 19: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,699 INFO L280 TraceCheckUtils]: 20: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,700 INFO L280 TraceCheckUtils]: 23: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,701 INFO L280 TraceCheckUtils]: 24: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,702 INFO L280 TraceCheckUtils]: 25: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,702 INFO L280 TraceCheckUtils]: 26: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,703 INFO L280 TraceCheckUtils]: 27: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == main_~i2~0); {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,704 INFO L280 TraceCheckUtils]: 28: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:30,706 INFO L280 TraceCheckUtils]: 30: Hoare triple {1259#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,706 INFO L280 TraceCheckUtils]: 31: Hoare triple {1258#false} assume !(node1_~m1~0 != ~nomsg~0); {1258#false} is VALID [2020-07-29 03:18:30,706 INFO L280 TraceCheckUtils]: 32: Hoare triple {1258#false} ~mode1~0 := 0; {1258#false} is VALID [2020-07-29 03:18:30,706 INFO L280 TraceCheckUtils]: 33: Hoare triple {1258#false} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,707 INFO L280 TraceCheckUtils]: 34: Hoare triple {1258#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,707 INFO L280 TraceCheckUtils]: 35: Hoare triple {1258#false} assume !(node2_~m2~0 != ~nomsg~0); {1258#false} is VALID [2020-07-29 03:18:30,707 INFO L280 TraceCheckUtils]: 36: Hoare triple {1258#false} ~mode2~0 := 0; {1258#false} is VALID [2020-07-29 03:18:30,708 INFO L280 TraceCheckUtils]: 37: Hoare triple {1258#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,708 INFO L280 TraceCheckUtils]: 38: Hoare triple {1258#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,708 INFO L280 TraceCheckUtils]: 39: Hoare triple {1258#false} assume !(node3_~m3~0 != ~nomsg~0); {1258#false} is VALID [2020-07-29 03:18:30,708 INFO L280 TraceCheckUtils]: 40: Hoare triple {1258#false} ~mode3~0 := 0; {1258#false} is VALID [2020-07-29 03:18:30,709 INFO L280 TraceCheckUtils]: 41: Hoare triple {1258#false} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,709 INFO L280 TraceCheckUtils]: 42: Hoare triple {1258#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1258#false} is VALID [2020-07-29 03:18:30,709 INFO L280 TraceCheckUtils]: 43: Hoare triple {1258#false} assume !(node4_~m4~0 != ~nomsg~0); {1258#false} is VALID [2020-07-29 03:18:30,710 INFO L280 TraceCheckUtils]: 44: Hoare triple {1258#false} ~mode4~0 := 0; {1258#false} is VALID [2020-07-29 03:18:30,710 INFO L280 TraceCheckUtils]: 45: Hoare triple {1258#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1258#false} is VALID [2020-07-29 03:18:30,710 INFO L280 TraceCheckUtils]: 46: Hoare triple {1258#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1258#false} is VALID [2020-07-29 03:18:30,710 INFO L280 TraceCheckUtils]: 47: Hoare triple {1258#false} assume !(~r1~0 >= 4); {1258#false} is VALID [2020-07-29 03:18:30,711 INFO L280 TraceCheckUtils]: 48: Hoare triple {1258#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {1258#false} is VALID [2020-07-29 03:18:30,711 INFO L280 TraceCheckUtils]: 49: Hoare triple {1258#false} assume ~r1~0 < 4;check_~tmp~1 := 1; {1258#false} is VALID [2020-07-29 03:18:30,711 INFO L280 TraceCheckUtils]: 50: Hoare triple {1258#false} check_#res := check_~tmp~1; {1258#false} is VALID [2020-07-29 03:18:30,711 INFO L280 TraceCheckUtils]: 51: Hoare triple {1258#false} main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1258#false} is VALID [2020-07-29 03:18:30,712 INFO L280 TraceCheckUtils]: 52: Hoare triple {1258#false} assume !(0 == assert_~arg % 256); {1258#false} is VALID [2020-07-29 03:18:30,712 INFO L280 TraceCheckUtils]: 53: Hoare triple {1258#false} main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; {1258#false} is VALID [2020-07-29 03:18:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:30,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964972477] [2020-07-29 03:18:30,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:30,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:30,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932457467] [2020-07-29 03:18:31,070 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2020-07-29 03:18:31,402 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2020-07-29 03:18:31,418 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:31,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:31,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:31,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:31,419 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:18:31,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:31,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:31,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:31,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2020-07-29 03:18:31,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:31,420 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:31,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:31,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:32,702 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-29 03:18:32,859 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:32,860 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:32,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:18:32,870 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:32,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:18:32,915 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:32,951 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:18:32,953 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:32,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:32,953 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:32,953 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:32,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:18:32,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:32,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:32,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:32,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2020-07-29 03:18:32,954 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:32,954 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:32,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:32,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:33,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:34,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:34,239 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:34,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:34,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:34,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:34,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:34,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:34,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:34,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:34,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:34,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:18:34,267 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:18:34,267 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:34,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:18:34,273 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:34,274 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:18:34,274 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2020-07-29 03:18:34,303 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:18:34,310 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume !(~r1~0 >= 4);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 4;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg;" "assume !(0 == assert_~arg % 256);" "main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23;" [2020-07-29 03:18:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:34,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:18:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:34,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:34,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {1260#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; {1260#unseeded} is VALID [2020-07-29 03:18:34,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {1260#unseeded} havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {1260#unseeded} assume 0 == ~r1~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {1260#unseeded} assume ~id1~0 >= 0; {1260#unseeded} is VALID [2020-07-29 03:18:34,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {1260#unseeded} assume 0 == ~st1~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {1260#unseeded} assume ~send1~0 == ~id1~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {1260#unseeded} assume 0 == ~mode1~0 % 256; {1260#unseeded} is VALID [2020-07-29 03:18:34,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {1260#unseeded} assume ~id2~0 >= 0; {1260#unseeded} is VALID [2020-07-29 03:18:34,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {1260#unseeded} assume 0 == ~st2~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {1260#unseeded} assume ~send2~0 == ~id2~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {1260#unseeded} assume 0 == ~mode2~0 % 256; {1260#unseeded} is VALID [2020-07-29 03:18:34,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {1260#unseeded} assume ~id3~0 >= 0; {1260#unseeded} is VALID [2020-07-29 03:18:34,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {1260#unseeded} assume 0 == ~st3~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {1260#unseeded} assume ~send3~0 == ~id3~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {1260#unseeded} assume 0 == ~mode3~0 % 256; {1260#unseeded} is VALID [2020-07-29 03:18:34,523 INFO L280 TraceCheckUtils]: 15: Hoare triple {1260#unseeded} assume ~id4~0 >= 0; {1260#unseeded} is VALID [2020-07-29 03:18:34,524 INFO L280 TraceCheckUtils]: 16: Hoare triple {1260#unseeded} assume 0 == ~st4~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,524 INFO L280 TraceCheckUtils]: 17: Hoare triple {1260#unseeded} assume ~send4~0 == ~id4~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,525 INFO L280 TraceCheckUtils]: 18: Hoare triple {1260#unseeded} assume 0 == ~mode4~0 % 256; {1260#unseeded} is VALID [2020-07-29 03:18:34,525 INFO L280 TraceCheckUtils]: 19: Hoare triple {1260#unseeded} assume ~id1~0 != ~id2~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {1260#unseeded} assume ~id1~0 != ~id3~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,531 INFO L280 TraceCheckUtils]: 21: Hoare triple {1260#unseeded} assume ~id1~0 != ~id4~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {1260#unseeded} assume ~id2~0 != ~id3~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {1260#unseeded} assume ~id2~0 != ~id4~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,533 INFO L280 TraceCheckUtils]: 24: Hoare triple {1260#unseeded} assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; {1260#unseeded} is VALID [2020-07-29 03:18:34,533 INFO L280 TraceCheckUtils]: 25: Hoare triple {1260#unseeded} init_#res := init_~tmp~0; {1260#unseeded} is VALID [2020-07-29 03:18:34,534 INFO L280 TraceCheckUtils]: 26: Hoare triple {1260#unseeded} main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21; {1260#unseeded} is VALID [2020-07-29 03:18:34,534 INFO L280 TraceCheckUtils]: 27: Hoare triple {1260#unseeded} assume !(0 == main_~i2~0); {1260#unseeded} is VALID [2020-07-29 03:18:34,535 INFO L280 TraceCheckUtils]: 28: Hoare triple {1260#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; {1260#unseeded} is VALID [2020-07-29 03:18:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:34,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:18:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:34,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:34,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {1263#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15))} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,632 INFO L280 TraceCheckUtils]: 8: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,633 INFO L280 TraceCheckUtils]: 10: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,639 INFO L280 TraceCheckUtils]: 17: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,640 INFO L280 TraceCheckUtils]: 18: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 4); {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,642 INFO L280 TraceCheckUtils]: 20: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 4;check_~tmp~1 := 1; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,642 INFO L280 TraceCheckUtils]: 21: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,643 INFO L280 TraceCheckUtils]: 22: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:34,645 INFO L280 TraceCheckUtils]: 24: Hoare triple {1362#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; {1273#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:18:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:34,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:34,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:34,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:34,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:34,692 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 [2020-07-29 03:18:34,693 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand 3 states. [2020-07-29 03:18:34,920 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand 3 states. Result 184 states and 263 transitions. Complement of second has 4 states. [2020-07-29 03:18:34,920 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 [2020-07-29 03:18:34,920 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:34,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. cyclomatic complexity: 40 [2020-07-29 03:18:34,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:34,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:34,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:18:34,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:34,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:34,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:34,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 263 transitions. [2020-07-29 03:18:34,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:34,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:34,945 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 107 states and 146 transitions. cyclomatic complexity: 40 [2020-07-29 03:18:35,005 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 78 examples of accepted words. [2020-07-29 03:18:35,005 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:18:35,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:35,008 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:18:35,008 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 184 states and 263 transitions. cyclomatic complexity: 80 [2020-07-29 03:18:35,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 263 transitions. cyclomatic complexity: 80 [2020-07-29 03:18:35,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:35,009 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:18:35,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:35,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:35,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:35,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 184 letters. Loop has 184 letters. [2020-07-29 03:18:35,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 184 letters. Loop has 184 letters. [2020-07-29 03:18:35,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 184 letters. Loop has 184 letters. [2020-07-29 03:18:35,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 107 letters. Loop has 107 letters. [2020-07-29 03:18:35,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 107 letters. Loop has 107 letters. [2020-07-29 03:18:35,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 107 letters. Loop has 107 letters. [2020-07-29 03:18:35,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:35,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:35,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:35,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 25 letters. [2020-07-29 03:18:35,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 25 letters. [2020-07-29 03:18:35,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 59 letters. Loop has 25 letters. [2020-07-29 03:18:35,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 25 letters. [2020-07-29 03:18:35,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 25 letters. [2020-07-29 03:18:35,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 60 letters. Loop has 25 letters. [2020-07-29 03:18:35,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 58 letters. Loop has 25 letters. [2020-07-29 03:18:35,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 25 letters. [2020-07-29 03:18:35,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 58 letters. Loop has 25 letters. [2020-07-29 03:18:35,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 57 letters. Loop has 25 letters. [2020-07-29 03:18:35,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 25 letters. [2020-07-29 03:18:35,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 57 letters. Loop has 25 letters. [2020-07-29 03:18:35,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 56 letters. Loop has 25 letters. [2020-07-29 03:18:35,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 25 letters. [2020-07-29 03:18:35,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 56 letters. Loop has 25 letters. [2020-07-29 03:18:35,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 55 letters. Loop has 25 letters. [2020-07-29 03:18:35,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 25 letters. [2020-07-29 03:18:35,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 55 letters. Loop has 25 letters. [2020-07-29 03:18:35,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 25 letters. [2020-07-29 03:18:35,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 25 letters. [2020-07-29 03:18:35,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 54 letters. Loop has 25 letters. [2020-07-29 03:18:35,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:18:35,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:18:35,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:18:35,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 26 letters. [2020-07-29 03:18:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 26 letters. [2020-07-29 03:18:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 61 letters. Loop has 26 letters. [2020-07-29 03:18:35,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 53 letters. Loop has 25 letters. [2020-07-29 03:18:35,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 25 letters. [2020-07-29 03:18:35,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 53 letters. Loop has 25 letters. [2020-07-29 03:18:35,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 52 letters. Loop has 25 letters. [2020-07-29 03:18:35,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 25 letters. [2020-07-29 03:18:35,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 52 letters. Loop has 25 letters. [2020-07-29 03:18:35,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 51 letters. Loop has 25 letters. [2020-07-29 03:18:35,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 25 letters. [2020-07-29 03:18:35,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 51 letters. Loop has 25 letters. [2020-07-29 03:18:35,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 25 letters. [2020-07-29 03:18:35,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 25 letters. [2020-07-29 03:18:35,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 43 letters. Loop has 25 letters. [2020-07-29 03:18:35,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 25 letters. [2020-07-29 03:18:35,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 25 letters. [2020-07-29 03:18:35,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 44 letters. Loop has 25 letters. [2020-07-29 03:18:35,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 71 letters. Loop has 25 letters. [2020-07-29 03:18:35,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 25 letters. [2020-07-29 03:18:35,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 71 letters. Loop has 25 letters. [2020-07-29 03:18:35,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 72 letters. Loop has 25 letters. [2020-07-29 03:18:35,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 25 letters. [2020-07-29 03:18:35,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 72 letters. Loop has 25 letters. [2020-07-29 03:18:35,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 33 letters. Loop has 25 letters. [2020-07-29 03:18:35,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 25 letters. [2020-07-29 03:18:35,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 33 letters. Loop has 25 letters. [2020-07-29 03:18:35,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:18:35,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:18:35,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:18:35,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 50 letters. Loop has 25 letters. [2020-07-29 03:18:35,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 25 letters. [2020-07-29 03:18:35,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 50 letters. Loop has 25 letters. [2020-07-29 03:18:35,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 51 letters. Loop has 25 letters. [2020-07-29 03:18:35,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 25 letters. [2020-07-29 03:18:35,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 51 letters. Loop has 25 letters. [2020-07-29 03:18:35,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 36 letters. Loop has 26 letters. [2020-07-29 03:18:35,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 26 letters. [2020-07-29 03:18:35,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 36 letters. Loop has 26 letters. [2020-07-29 03:18:35,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 36 letters. Loop has 25 letters. [2020-07-29 03:18:35,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 25 letters. [2020-07-29 03:18:35,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 36 letters. Loop has 25 letters. [2020-07-29 03:18:35,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 37 letters. Loop has 27 letters. [2020-07-29 03:18:35,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 27 letters. [2020-07-29 03:18:35,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 37 letters. Loop has 27 letters. [2020-07-29 03:18:35,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 25 letters. [2020-07-29 03:18:35,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 25 letters. [2020-07-29 03:18:35,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 69 letters. Loop has 25 letters. [2020-07-29 03:18:35,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 70 letters. Loop has 25 letters. [2020-07-29 03:18:35,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 25 letters. [2020-07-29 03:18:35,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 70 letters. Loop has 25 letters. [2020-07-29 03:18:35,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 48 letters. Loop has 25 letters. [2020-07-29 03:18:35,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 25 letters. [2020-07-29 03:18:35,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 48 letters. Loop has 25 letters. [2020-07-29 03:18:35,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 49 letters. Loop has 25 letters. [2020-07-29 03:18:35,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 25 letters. [2020-07-29 03:18:35,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 49 letters. Loop has 25 letters. [2020-07-29 03:18:35,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 25 letters. [2020-07-29 03:18:35,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 25 letters. [2020-07-29 03:18:35,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 69 letters. Loop has 25 letters. [2020-07-29 03:18:35,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 68 letters. Loop has 25 letters. [2020-07-29 03:18:35,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 25 letters. [2020-07-29 03:18:35,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 68 letters. Loop has 25 letters. [2020-07-29 03:18:35,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 26 letters. [2020-07-29 03:18:35,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 26 letters. [2020-07-29 03:18:35,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 69 letters. Loop has 26 letters. [2020-07-29 03:18:35,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 36 letters. Loop has 25 letters. [2020-07-29 03:18:35,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 25 letters. [2020-07-29 03:18:35,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 36 letters. Loop has 25 letters. [2020-07-29 03:18:35,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 37 letters. Loop has 25 letters. [2020-07-29 03:18:35,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 25 letters. [2020-07-29 03:18:35,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 37 letters. Loop has 25 letters. [2020-07-29 03:18:35,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 48 letters. Loop has 25 letters. [2020-07-29 03:18:35,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 25 letters. [2020-07-29 03:18:35,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 48 letters. Loop has 25 letters. [2020-07-29 03:18:35,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 33 letters. Loop has 27 letters. [2020-07-29 03:18:35,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 27 letters. [2020-07-29 03:18:35,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 33 letters. Loop has 27 letters. [2020-07-29 03:18:35,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 32 letters. Loop has 25 letters. [2020-07-29 03:18:35,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 25 letters. [2020-07-29 03:18:35,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 32 letters. Loop has 25 letters. [2020-07-29 03:18:35,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 52 letters. Loop has 25 letters. [2020-07-29 03:18:35,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 25 letters. [2020-07-29 03:18:35,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 52 letters. Loop has 25 letters. [2020-07-29 03:18:35,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 53 letters. Loop has 25 letters. [2020-07-29 03:18:35,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 25 letters. [2020-07-29 03:18:35,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 53 letters. Loop has 25 letters. [2020-07-29 03:18:35,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 35 letters. Loop has 25 letters. [2020-07-29 03:18:35,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 25 letters. [2020-07-29 03:18:35,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 35 letters. Loop has 25 letters. [2020-07-29 03:18:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 30 letters. Loop has 25 letters. [2020-07-29 03:18:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 25 letters. [2020-07-29 03:18:35,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 30 letters. Loop has 25 letters. [2020-07-29 03:18:35,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 31 letters. Loop has 25 letters. [2020-07-29 03:18:35,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 25 letters. [2020-07-29 03:18:35,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 31 letters. Loop has 25 letters. [2020-07-29 03:18:35,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 31 letters. Loop has 25 letters. [2020-07-29 03:18:35,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 25 letters. [2020-07-29 03:18:35,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 31 letters. Loop has 25 letters. [2020-07-29 03:18:35,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 25 letters. [2020-07-29 03:18:35,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 25 letters. [2020-07-29 03:18:35,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 65 letters. Loop has 25 letters. [2020-07-29 03:18:35,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 25 letters. [2020-07-29 03:18:35,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 25 letters. [2020-07-29 03:18:35,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 66 letters. Loop has 25 letters. [2020-07-29 03:18:35,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 25 letters. [2020-07-29 03:18:35,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 25 letters. [2020-07-29 03:18:35,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 64 letters. Loop has 25 letters. [2020-07-29 03:18:35,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 49 letters. Loop has 25 letters. [2020-07-29 03:18:35,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 25 letters. [2020-07-29 03:18:35,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 49 letters. Loop has 25 letters. [2020-07-29 03:18:35,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 32 letters. Loop has 26 letters. [2020-07-29 03:18:35,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 26 letters. [2020-07-29 03:18:35,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 32 letters. Loop has 26 letters. [2020-07-29 03:18:35,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 32 letters. Loop has 25 letters. [2020-07-29 03:18:35,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 25 letters. [2020-07-29 03:18:35,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 32 letters. Loop has 25 letters. [2020-07-29 03:18:35,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:18:35,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:18:35,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:18:35,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 25 letters. [2020-07-29 03:18:35,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 25 letters. [2020-07-29 03:18:35,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 65 letters. Loop has 25 letters. [2020-07-29 03:18:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:18:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:18:35,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:18:35,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 67 letters. Loop has 25 letters. [2020-07-29 03:18:35,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 25 letters. [2020-07-29 03:18:35,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 67 letters. Loop has 25 letters. [2020-07-29 03:18:35,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 35 letters. Loop has 25 letters. [2020-07-29 03:18:35,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 25 letters. [2020-07-29 03:18:35,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 35 letters. Loop has 25 letters. [2020-07-29 03:18:35,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 50 letters. Loop has 25 letters. [2020-07-29 03:18:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 25 letters. [2020-07-29 03:18:35,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 50 letters. Loop has 25 letters. [2020-07-29 03:18:35,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 25 letters. [2020-07-29 03:18:35,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 25 letters. [2020-07-29 03:18:35,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 64 letters. Loop has 25 letters. [2020-07-29 03:18:35,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:18:35,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:18:35,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:18:35,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 68 letters. Loop has 25 letters. [2020-07-29 03:18:35,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 25 letters. [2020-07-29 03:18:35,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 68 letters. Loop has 25 letters. [2020-07-29 03:18:35,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:18:35,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:18:35,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:18:35,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:18:35,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:18:35,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:18:35,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:18:35,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:18:35,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:18:35,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 47 letters. Loop has 25 letters. [2020-07-29 03:18:35,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 25 letters. [2020-07-29 03:18:35,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 47 letters. Loop has 25 letters. [2020-07-29 03:18:35,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:18:35,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:18:35,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:18:35,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 45 letters. Loop has 25 letters. [2020-07-29 03:18:35,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 25 letters. [2020-07-29 03:18:35,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 45 letters. Loop has 25 letters. [2020-07-29 03:18:35,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 25 letters. [2020-07-29 03:18:35,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 25 letters. [2020-07-29 03:18:35,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 44 letters. Loop has 25 letters. [2020-07-29 03:18:35,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:18:35,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:18:35,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:18:35,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 25 letters. [2020-07-29 03:18:35,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 25 letters. [2020-07-29 03:18:35,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 43 letters. Loop has 25 letters. [2020-07-29 03:18:35,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 26 letters. [2020-07-29 03:18:35,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 26 letters. [2020-07-29 03:18:35,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 44 letters. Loop has 26 letters. [2020-07-29 03:18:35,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:18:35,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:18:35,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:18:35,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 25 letters. [2020-07-29 03:18:35,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 25 letters. [2020-07-29 03:18:35,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 41 letters. Loop has 25 letters. [2020-07-29 03:18:35,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 40 letters. Loop has 25 letters. [2020-07-29 03:18:35,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 25 letters. [2020-07-29 03:18:35,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 40 letters. Loop has 25 letters. [2020-07-29 03:18:35,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 40 letters. Loop has 25 letters. [2020-07-29 03:18:35,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 25 letters. [2020-07-29 03:18:35,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 40 letters. Loop has 25 letters. [2020-07-29 03:18:35,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:18:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:18:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:18:35,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 40 letters. Loop has 26 letters. [2020-07-29 03:18:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 26 letters. [2020-07-29 03:18:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 40 letters. Loop has 26 letters. [2020-07-29 03:18:35,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 25 letters. [2020-07-29 03:18:35,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 25 letters. [2020-07-29 03:18:35,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 63 letters. Loop has 25 letters. [2020-07-29 03:18:35,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 25 letters. [2020-07-29 03:18:35,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 25 letters. [2020-07-29 03:18:35,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 62 letters. Loop has 25 letters. [2020-07-29 03:18:35,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 25 letters. [2020-07-29 03:18:35,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 25 letters. [2020-07-29 03:18:35,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 61 letters. Loop has 25 letters. [2020-07-29 03:18:35,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 25 letters. [2020-07-29 03:18:35,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 25 letters. [2020-07-29 03:18:35,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 61 letters. Loop has 25 letters. [2020-07-29 03:18:35,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 25 letters. [2020-07-29 03:18:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 25 letters. [2020-07-29 03:18:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 60 letters. Loop has 25 letters. [2020-07-29 03:18:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 146 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 263 transitions. cyclomatic complexity: 80 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,188 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:18:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-29 03:18:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2020-07-29 03:18:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2020-07-29 03:18:35,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2020-07-29 03:18:35,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:35,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. cyclomatic complexity: 80 [2020-07-29 03:18:35,206 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:35,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2020-07-29 03:18:35,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:35,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:35,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:35,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:35,207 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:35,207 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:35,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:35,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:35,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:35,208 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:18:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:35,209 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:18:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:18:35,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:35,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:35,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:18:35,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:35,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:18:35,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:35,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:35,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:35,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:35,285 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:35,285 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:35,285 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:35,285 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:18:35,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:18:35,286 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:35,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:35,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:18:35 BoogieIcfgContainer [2020-07-29 03:18:35,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:18:35,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:18:35,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:18:35,295 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:18:35,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:27" (3/4) ... [2020-07-29 03:18:35,299 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:18:35,299 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:18:35,303 INFO L168 Benchmark]: Toolchain (without parser) took 8824.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 956.2 MB in the beginning and 903.1 MB in the end (delta: 53.1 MB). Peak memory consumption was 379.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:35,304 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:35,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:35,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:35,309 INFO L168 Benchmark]: Boogie Preprocessor took 67.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:35,310 INFO L168 Benchmark]: RCFGBuilder took 827.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:35,311 INFO L168 Benchmark]: BuchiAutomizer took 7341.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 903.1 MB in the end (delta: 169.4 MB). Peak memory consumption was 344.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:35,311 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 903.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:35,315 INFO L336 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 503.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 827.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7341.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 903.1 MB in the end (delta: 169.4 MB). Peak memory consumption was 344.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 903.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 216 SDslu, 752 SDs, 0 SdLazy, 46 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax132 hnf107 lsp24 ukn100 mio100 lsp100 div127 bol100 ite100 ukn100 eq178 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...