./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.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_floodmax.4.2.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 0284916d1cac69bb9a0e1d14b90889a72fcac63c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:15:03,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:15:03,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:15:03,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:15:03,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:15:03,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:15:03,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:15:03,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:15:03,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:15:03,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:15:03,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:15:03,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:15:03,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:15:03,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:15:03,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:15:03,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:15:03,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:15:03,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:15:03,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:15:03,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:15:03,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:15:03,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:15:03,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:15:03,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:15:03,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:15:03,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:15:03,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:15:03,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:15:03,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:15:03,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:15:03,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:15:03,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:15:03,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:15:03,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:15:03,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:15:03,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:15:03,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:15:03,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:15:03,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:15:03,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:15:03,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:15:03,122 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:15:03,150 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:15:03,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:15:03,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:15:03,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:15:03,153 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:15:03,153 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:15:03,154 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:15:03,154 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:15:03,154 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:15:03,154 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:15:03,155 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:15:03,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:15:03,156 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:15:03,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:15:03,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:15:03,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:15:03,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:15:03,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:15:03,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:15:03,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:15:03,158 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:15:03,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:15:03,159 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:15:03,159 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:15:03,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:15:03,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:15:03,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:15:03,160 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:15:03,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:15:03,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:15:03,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:15:03,162 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:15:03,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:15:03,164 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 -> 0284916d1cac69bb9a0e1d14b90889a72fcac63c [2020-07-29 03:15:03,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:15:03,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:15:03,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:15:03,467 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:15:03,467 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:15:03,468 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2020-07-29 03:15:03,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419c69eb3/0528f1d5c57348d6a1ffee2b777a1118/FLAG9e2f2a1ce [2020-07-29 03:15:04,046 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:15:04,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2020-07-29 03:15:04,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419c69eb3/0528f1d5c57348d6a1ffee2b777a1118/FLAG9e2f2a1ce [2020-07-29 03:15:04,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419c69eb3/0528f1d5c57348d6a1ffee2b777a1118 [2020-07-29 03:15:04,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:15:04,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:15:04,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:15:04,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:15:04,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:15:04,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:15:04" (1/1) ... [2020-07-29 03:15:04,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472db69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:04, skipping insertion in model container [2020-07-29 03:15:04,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:15:04" (1/1) ... [2020-07-29 03:15:04,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:15:04,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:15:04,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:15:04,964 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:15:05,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:15:05,155 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:15:05,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05 WrapperNode [2020-07-29 03:15:05,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:15:05,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:15:05,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:15:05,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:15:05,163 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:15:05" (1/1) ... [2020-07-29 03:15:05,180 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:15:05" (1/1) ... [2020-07-29 03:15:05,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:15:05,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:15:05,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:15:05,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:15:05,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (1/1) ... [2020-07-29 03:15:05,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:15:05,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:15:05,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:15:05,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:15:05,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (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:15:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:15:05,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:15:07,262 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:15:07,266 INFO L295 CfgBuilder]: Removed 21 assume(true) statements. [2020-07-29 03:15:07,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:15:07 BoogieIcfgContainer [2020-07-29 03:15:07,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:15:07,282 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:15:07,285 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:15:07,292 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:15:07,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:15:07,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:15:04" (1/3) ... [2020-07-29 03:15:07,295 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c254ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:15:07, skipping insertion in model container [2020-07-29 03:15:07,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:15:07,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:05" (2/3) ... [2020-07-29 03:15:07,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c254ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:15:07, skipping insertion in model container [2020-07-29 03:15:07,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:15:07,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:15:07" (3/3) ... [2020-07-29 03:15:07,304 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2020-07-29 03:15:07,371 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:15:07,371 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:15:07,372 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:15:07,372 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:15:07,372 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:15:07,373 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:15:07,373 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:15:07,373 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:15:07,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states. [2020-07-29 03:15:07,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2020-07-29 03:15:07,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:07,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:07,488 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, 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:15:07,488 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:15:07,489 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:15:07,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states. [2020-07-29 03:15:07,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2020-07-29 03:15:07,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:07,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:07,550 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, 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:15:07,550 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:15:07,562 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; 17#L-1true havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 34#L439true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 32#L450true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 236#L460true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 234#L471true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 292#L481true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 291#L492true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 208#L502true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 206#L513true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 117#L523true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 116#L534true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 15#L544true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 14#L555true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 70#L565true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 69#L576true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 272#L586true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 270#L597true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 181#L607true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 180#L618true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 225#L628true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 88#L639true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 136#L649true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 135#L660true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 39#L670true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 38#L681true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 245#L691true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 244#L702true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 303#L712true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 302#L723true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 217#L733true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 216#L744true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 124#L754true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 123#L765true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 25#L775true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 22#L786true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 77#L796true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 76#L807true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 280#L817true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 278#L828true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 191#L838true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 187#L849true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 97#L859true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 96#L870true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 161#L880true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 160#L891true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 57#L901true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 56#L912true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 261#L922true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 260#L933true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 175#L943true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 165#L943-1true init_#res := init_~tmp___23~0; 111#L1112true main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 126#L66true assume !(0 == assume_abort_if_not_~cond); 23#L65true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 149#L1249-2true [2020-07-29 03:15:07,563 INFO L796 eck$LassoCheckResult]: Loop: 149#L1249-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 104#L154true assume !(0 != ~mode1~0 % 256); 4#L186true assume !(~r1~0 < 3); 27#L186-1true ~mode1~0 := 1; 127#L154-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 59#L207true assume !(0 != ~mode2~0 % 256); 263#L239true assume !(~r2~0 < 3); 284#L239-1true ~mode2~0 := 1; 80#L207-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 197#L260true assume !(0 != ~mode3~0 % 256); 103#L292true assume !(~r3~0 < 3); 100#L292-1true ~mode3~0 := 1; 189#L260-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 143#L313true assume !(0 != ~mode4~0 % 256); 43#L345true assume !(~r4~0 < 3); 44#L345-1true ~mode4~0 := 1; 145#L313-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 271#L1120true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 273#L1120-1true check_#res := check_~tmp~1; 137#L1172true main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 45#L1292true assume !(0 == assert_~arg % 256); 24#L1287true main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 149#L1249-2true [2020-07-29 03:15:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 1 times [2020-07-29 03:15:07,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:07,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938826162] [2020-07-29 03:15:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:08,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; {307#true} is VALID [2020-07-29 03:15:08,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#true} havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {307#true} is VALID [2020-07-29 03:15:08,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,065 INFO L280 TraceCheckUtils]: 3: Hoare triple {307#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,066 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {307#true} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {307#true} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {307#true} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,068 INFO L280 TraceCheckUtils]: 9: Hoare triple {307#true} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,068 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#true} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,068 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#true} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,069 INFO L280 TraceCheckUtils]: 12: Hoare triple {307#true} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#true} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,070 INFO L280 TraceCheckUtils]: 14: Hoare triple {307#true} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,070 INFO L280 TraceCheckUtils]: 15: Hoare triple {307#true} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,070 INFO L280 TraceCheckUtils]: 16: Hoare triple {307#true} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,071 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#true} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,071 INFO L280 TraceCheckUtils]: 18: Hoare triple {307#true} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,071 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#true} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,072 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#true} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,072 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#true} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,073 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#true} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,073 INFO L280 TraceCheckUtils]: 23: Hoare triple {307#true} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,073 INFO L280 TraceCheckUtils]: 24: Hoare triple {307#true} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,074 INFO L280 TraceCheckUtils]: 25: Hoare triple {307#true} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,074 INFO L280 TraceCheckUtils]: 26: Hoare triple {307#true} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,074 INFO L280 TraceCheckUtils]: 27: Hoare triple {307#true} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,075 INFO L280 TraceCheckUtils]: 28: Hoare triple {307#true} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,075 INFO L280 TraceCheckUtils]: 29: Hoare triple {307#true} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,076 INFO L280 TraceCheckUtils]: 30: Hoare triple {307#true} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,076 INFO L280 TraceCheckUtils]: 31: Hoare triple {307#true} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,076 INFO L280 TraceCheckUtils]: 32: Hoare triple {307#true} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,077 INFO L280 TraceCheckUtils]: 33: Hoare triple {307#true} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,077 INFO L280 TraceCheckUtils]: 34: Hoare triple {307#true} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,078 INFO L280 TraceCheckUtils]: 35: Hoare triple {307#true} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,078 INFO L280 TraceCheckUtils]: 36: Hoare triple {307#true} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,078 INFO L280 TraceCheckUtils]: 37: Hoare triple {307#true} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,079 INFO L280 TraceCheckUtils]: 38: Hoare triple {307#true} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,079 INFO L280 TraceCheckUtils]: 39: Hoare triple {307#true} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,079 INFO L280 TraceCheckUtils]: 40: Hoare triple {307#true} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,080 INFO L280 TraceCheckUtils]: 41: Hoare triple {307#true} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,080 INFO L280 TraceCheckUtils]: 42: Hoare triple {307#true} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,080 INFO L280 TraceCheckUtils]: 43: Hoare triple {307#true} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,081 INFO L280 TraceCheckUtils]: 44: Hoare triple {307#true} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,081 INFO L280 TraceCheckUtils]: 45: Hoare triple {307#true} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,082 INFO L280 TraceCheckUtils]: 46: Hoare triple {307#true} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,082 INFO L280 TraceCheckUtils]: 47: Hoare triple {307#true} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,082 INFO L280 TraceCheckUtils]: 48: Hoare triple {307#true} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {307#true} is VALID [2020-07-29 03:15:08,083 INFO L280 TraceCheckUtils]: 49: Hoare triple {307#true} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {307#true} is VALID [2020-07-29 03:15:08,084 INFO L280 TraceCheckUtils]: 50: Hoare triple {307#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {309#(= 0 ULTIMATE.start_init_~tmp___23~0)} is VALID [2020-07-29 03:15:08,085 INFO L280 TraceCheckUtils]: 51: Hoare triple {309#(= 0 ULTIMATE.start_init_~tmp___23~0)} init_#res := init_~tmp___23~0; {310#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:15:08,086 INFO L280 TraceCheckUtils]: 52: Hoare triple {310#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {311#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:15:08,087 INFO L280 TraceCheckUtils]: 53: Hoare triple {311#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {308#false} is VALID [2020-07-29 03:15:08,087 INFO L280 TraceCheckUtils]: 54: Hoare triple {308#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {308#false} is VALID [2020-07-29 03:15:08,098 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:15:08,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938826162] [2020-07-29 03:15:08,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:08,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:08,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014627324] [2020-07-29 03:15:08,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:15:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1319514639, now seen corresponding path program 1 times [2020-07-29 03:15:08,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:08,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818155622] [2020-07-29 03:15:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:08,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; {312#true} is VALID [2020-07-29 03:15:08,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(0 != ~mode1~0 % 256); {312#true} is VALID [2020-07-29 03:15:08,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(~r1~0 < 3); {312#true} is VALID [2020-07-29 03:15:08,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {312#true} ~mode1~0 := 1; {312#true} is VALID [2020-07-29 03:15:08,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {312#true} havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; {312#true} is VALID [2020-07-29 03:15:08,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} assume !(0 != ~mode2~0 % 256); {312#true} is VALID [2020-07-29 03:15:08,279 INFO L280 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~r2~0 < 3); {312#true} is VALID [2020-07-29 03:15:08,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {312#true} ~mode2~0 := 1; {312#true} is VALID [2020-07-29 03:15:08,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {312#true} havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; {312#true} is VALID [2020-07-29 03:15:08,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(0 != ~mode3~0 % 256); {312#true} is VALID [2020-07-29 03:15:08,280 INFO L280 TraceCheckUtils]: 10: Hoare triple {312#true} assume !(~r3~0 < 3); {312#true} is VALID [2020-07-29 03:15:08,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {312#true} ~mode3~0 := 1; {312#true} is VALID [2020-07-29 03:15:08,282 INFO L280 TraceCheckUtils]: 12: Hoare triple {312#true} havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; {312#true} is VALID [2020-07-29 03:15:08,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {312#true} assume !(0 != ~mode4~0 % 256); {312#true} is VALID [2020-07-29 03:15:08,282 INFO L280 TraceCheckUtils]: 14: Hoare triple {312#true} assume !(~r4~0 < 3); {312#true} is VALID [2020-07-29 03:15:08,283 INFO L280 TraceCheckUtils]: 15: Hoare triple {312#true} ~mode4~0 := 1; {312#true} is VALID [2020-07-29 03:15:08,283 INFO L280 TraceCheckUtils]: 16: Hoare triple {312#true} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {312#true} is VALID [2020-07-29 03:15:08,284 INFO L280 TraceCheckUtils]: 17: Hoare triple {312#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; {314#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:15:08,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {314#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {315#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:15:08,287 INFO L280 TraceCheckUtils]: 19: Hoare triple {315#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {316#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:15:08,288 INFO L280 TraceCheckUtils]: 20: Hoare triple {316#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {313#false} is VALID [2020-07-29 03:15:08,288 INFO L280 TraceCheckUtils]: 21: Hoare triple {313#false} main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; {313#false} is VALID [2020-07-29 03:15:08,290 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:15:08,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818155622] [2020-07-29 03:15:08,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:08,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:08,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027633642] [2020-07-29 03:15:08,293 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:15:08,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:08,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:15:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:15:08,311 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 5 states. [2020-07-29 03:15:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:10,124 INFO L93 Difference]: Finished difference Result 307 states and 545 transitions. [2020-07-29 03:15:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:15:10,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:15:10,160 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:15:10,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 545 transitions. [2020-07-29 03:15:10,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2020-07-29 03:15:10,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 298 states and 528 transitions. [2020-07-29 03:15:10,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2020-07-29 03:15:10,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2020-07-29 03:15:10,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 528 transitions. [2020-07-29 03:15:10,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:10,217 INFO L688 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2020-07-29 03:15:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 528 transitions. [2020-07-29 03:15:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-07-29 03:15:10,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:15:10,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states and 528 transitions. Second operand 298 states. [2020-07-29 03:15:10,263 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states and 528 transitions. Second operand 298 states. [2020-07-29 03:15:10,265 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. Second operand 298 states. [2020-07-29 03:15:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:10,283 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2020-07-29 03:15:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2020-07-29 03:15:10,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:10,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:10,287 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand 298 states and 528 transitions. [2020-07-29 03:15:10,287 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 298 states and 528 transitions. [2020-07-29 03:15:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:10,304 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2020-07-29 03:15:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2020-07-29 03:15:10,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:10,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:10,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:15:10,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:15:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-07-29 03:15:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 528 transitions. [2020-07-29 03:15:10,323 INFO L711 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2020-07-29 03:15:10,324 INFO L591 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2020-07-29 03:15:10,324 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:15:10,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 528 transitions. [2020-07-29 03:15:10,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2020-07-29 03:15:10,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:10,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:10,329 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, 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:15:10,330 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, 1, 1, 1, 1, 1] [2020-07-29 03:15:10,330 INFO L794 eck$LassoCheckResult]: Stem: 839#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; 660#L-1 havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 661#L439 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 694#L450 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 695#L460 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 689#L471 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 918#L481 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 906#L492 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 904#L502 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 834#L513 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 831#L523 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 658#L534 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 655#L544 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 653#L555 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 654#L565 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 652#L576 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 763#L586 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 762#L597 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 892#L607 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 819#L618 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 891#L628 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 638#L639 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 792#L649 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 710#L660 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 706#L670 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 704#L681 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 705#L691 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 724#L702 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 922#L712 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 787#L723 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 910#L733 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 842#L744 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 840#L754 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 680#L765 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 677#L775 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 674#L786 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 675#L796 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 671#L807 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 773#L817 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 772#L828 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 898#L838 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 811#L849 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 808#L859 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 702#L870 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 806#L880 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 743#L891 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 740#L901 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 738#L912 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 739#L922 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 737#L933 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 885#L943 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 687#L943-1 init_#res := init_~tmp___23~0; 826#L1112 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 827#L66 assume !(0 == assume_abort_if_not_~cond); 676#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 673#L1249-2 [2020-07-29 03:15:10,331 INFO L796 eck$LassoCheckResult]: Loop: 673#L1249-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 816#L154 assume !(0 != ~mode1~0 % 256); 630#L186 assume !(~r1~0 < 3); 631#L186-1 ~mode1~0 := 1; 682#L154-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 745#L207 assume !(0 != ~mode2~0 % 256); 747#L239 assume !(~r2~0 < 3); 866#L239-1 ~mode2~0 := 1; 641#L207-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 778#L260 assume !(0 != ~mode3~0 % 256); 814#L292 assume !(~r3~0 < 3); 650#L292-1 ~mode3~0 := 1; 809#L260-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 856#L313 assume !(0 != ~mode4~0 % 256); 714#L345 assume !(~r4~0 < 3); 715#L345-1 ~mode4~0 := 1; 717#L313-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 858#L1120 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 760#L1121 assume ~st1~0 + ~nl1~0 <= 1; 646#L1122 assume ~st2~0 + ~nl2~0 <= 1; 647#L1123 assume ~st3~0 + ~nl3~0 <= 1; 818#L1124 assume ~st4~0 + ~nl4~0 <= 1; 899#L1125 assume ~r1~0 >= 3; 855#L1129 assume ~r1~0 < 3; 636#L1134 assume ~r1~0 >= 3; 712#L1139 assume ~r1~0 < 3;check_~tmp~1 := 1; 756#L1120-1 check_#res := check_~tmp~1; 851#L1172 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 718#L1292 assume !(0 == assert_~arg % 256); 672#L1287 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 673#L1249-2 [2020-07-29 03:15:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 2 times [2020-07-29 03:15:10,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:10,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256847824] [2020-07-29 03:15:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:10,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {1525#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; {1525#true} is VALID [2020-07-29 03:15:10,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {1525#true} havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {1525#true} is VALID [2020-07-29 03:15:10,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {1525#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {1525#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,505 INFO L280 TraceCheckUtils]: 4: Hoare triple {1525#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,506 INFO L280 TraceCheckUtils]: 5: Hoare triple {1525#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {1525#true} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {1525#true} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {1525#true} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {1525#true} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {1525#true} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {1525#true} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {1525#true} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,508 INFO L280 TraceCheckUtils]: 13: Hoare triple {1525#true} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {1525#true} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {1525#true} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,509 INFO L280 TraceCheckUtils]: 16: Hoare triple {1525#true} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,509 INFO L280 TraceCheckUtils]: 17: Hoare triple {1525#true} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {1525#true} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,510 INFO L280 TraceCheckUtils]: 19: Hoare triple {1525#true} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,510 INFO L280 TraceCheckUtils]: 20: Hoare triple {1525#true} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,511 INFO L280 TraceCheckUtils]: 21: Hoare triple {1525#true} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {1525#true} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,511 INFO L280 TraceCheckUtils]: 23: Hoare triple {1525#true} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,512 INFO L280 TraceCheckUtils]: 24: Hoare triple {1525#true} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,512 INFO L280 TraceCheckUtils]: 25: Hoare triple {1525#true} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,512 INFO L280 TraceCheckUtils]: 26: Hoare triple {1525#true} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,512 INFO L280 TraceCheckUtils]: 27: Hoare triple {1525#true} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,513 INFO L280 TraceCheckUtils]: 28: Hoare triple {1525#true} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,513 INFO L280 TraceCheckUtils]: 29: Hoare triple {1525#true} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,513 INFO L280 TraceCheckUtils]: 30: Hoare triple {1525#true} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,514 INFO L280 TraceCheckUtils]: 31: Hoare triple {1525#true} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,514 INFO L280 TraceCheckUtils]: 32: Hoare triple {1525#true} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,514 INFO L280 TraceCheckUtils]: 33: Hoare triple {1525#true} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,515 INFO L280 TraceCheckUtils]: 34: Hoare triple {1525#true} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,515 INFO L280 TraceCheckUtils]: 35: Hoare triple {1525#true} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,515 INFO L280 TraceCheckUtils]: 36: Hoare triple {1525#true} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,516 INFO L280 TraceCheckUtils]: 37: Hoare triple {1525#true} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,516 INFO L280 TraceCheckUtils]: 38: Hoare triple {1525#true} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,516 INFO L280 TraceCheckUtils]: 39: Hoare triple {1525#true} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,516 INFO L280 TraceCheckUtils]: 40: Hoare triple {1525#true} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,517 INFO L280 TraceCheckUtils]: 41: Hoare triple {1525#true} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,517 INFO L280 TraceCheckUtils]: 42: Hoare triple {1525#true} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,517 INFO L280 TraceCheckUtils]: 43: Hoare triple {1525#true} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,518 INFO L280 TraceCheckUtils]: 44: Hoare triple {1525#true} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,518 INFO L280 TraceCheckUtils]: 45: Hoare triple {1525#true} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,518 INFO L280 TraceCheckUtils]: 46: Hoare triple {1525#true} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,519 INFO L280 TraceCheckUtils]: 47: Hoare triple {1525#true} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,519 INFO L280 TraceCheckUtils]: 48: Hoare triple {1525#true} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {1525#true} is VALID [2020-07-29 03:15:10,519 INFO L280 TraceCheckUtils]: 49: Hoare triple {1525#true} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {1525#true} is VALID [2020-07-29 03:15:10,520 INFO L280 TraceCheckUtils]: 50: Hoare triple {1525#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {1527#(= 0 ULTIMATE.start_init_~tmp___23~0)} is VALID [2020-07-29 03:15:10,521 INFO L280 TraceCheckUtils]: 51: Hoare triple {1527#(= 0 ULTIMATE.start_init_~tmp___23~0)} init_#res := init_~tmp___23~0; {1528#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:15:10,522 INFO L280 TraceCheckUtils]: 52: Hoare triple {1528#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1529#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:15:10,524 INFO L280 TraceCheckUtils]: 53: Hoare triple {1529#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {1526#false} is VALID [2020-07-29 03:15:10,525 INFO L280 TraceCheckUtils]: 54: Hoare triple {1526#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {1526#false} is VALID [2020-07-29 03:15:10,528 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:15:10,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256847824] [2020-07-29 03:15:10,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:10,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:10,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729220719] [2020-07-29 03:15:10,529 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:15:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:10,530 INFO L82 PathProgramCache]: Analyzing trace with hash 94444480, now seen corresponding path program 1 times [2020-07-29 03:15:10,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:10,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416738268] [2020-07-29 03:15:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:10,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {1530#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; {1530#true} is VALID [2020-07-29 03:15:10,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume !(0 != ~mode1~0 % 256); {1530#true} is VALID [2020-07-29 03:15:10,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {1530#true} assume !(~r1~0 < 3); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {1532#(< 2 ~r1~0)} ~mode1~0 := 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {1532#(< 2 ~r1~0)} havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {1532#(< 2 ~r1~0)} assume !(0 != ~mode2~0 % 256); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {1532#(< 2 ~r1~0)} assume !(~r2~0 < 3); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {1532#(< 2 ~r1~0)} ~mode2~0 := 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,569 INFO L280 TraceCheckUtils]: 8: Hoare triple {1532#(< 2 ~r1~0)} havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {1532#(< 2 ~r1~0)} assume !(0 != ~mode3~0 % 256); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {1532#(< 2 ~r1~0)} assume !(~r3~0 < 3); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {1532#(< 2 ~r1~0)} ~mode3~0 := 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {1532#(< 2 ~r1~0)} havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,572 INFO L280 TraceCheckUtils]: 13: Hoare triple {1532#(< 2 ~r1~0)} assume !(0 != ~mode4~0 % 256); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {1532#(< 2 ~r1~0)} assume !(~r4~0 < 3); {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,573 INFO L280 TraceCheckUtils]: 15: Hoare triple {1532#(< 2 ~r1~0)} ~mode4~0 := 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,574 INFO L280 TraceCheckUtils]: 16: Hoare triple {1532#(< 2 ~r1~0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {1532#(< 2 ~r1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,575 INFO L280 TraceCheckUtils]: 18: Hoare triple {1532#(< 2 ~r1~0)} assume ~st1~0 + ~nl1~0 <= 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {1532#(< 2 ~r1~0)} assume ~st2~0 + ~nl2~0 <= 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,576 INFO L280 TraceCheckUtils]: 20: Hoare triple {1532#(< 2 ~r1~0)} assume ~st3~0 + ~nl3~0 <= 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,577 INFO L280 TraceCheckUtils]: 21: Hoare triple {1532#(< 2 ~r1~0)} assume ~st4~0 + ~nl4~0 <= 1; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,577 INFO L280 TraceCheckUtils]: 22: Hoare triple {1532#(< 2 ~r1~0)} assume ~r1~0 >= 3; {1532#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:10,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {1532#(< 2 ~r1~0)} assume ~r1~0 < 3; {1531#false} is VALID [2020-07-29 03:15:10,578 INFO L280 TraceCheckUtils]: 24: Hoare triple {1531#false} assume ~r1~0 >= 3; {1531#false} is VALID [2020-07-29 03:15:10,579 INFO L280 TraceCheckUtils]: 25: Hoare triple {1531#false} assume ~r1~0 < 3;check_~tmp~1 := 1; {1531#false} is VALID [2020-07-29 03:15:10,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {1531#false} check_#res := check_~tmp~1; {1531#false} is VALID [2020-07-29 03:15:10,579 INFO L280 TraceCheckUtils]: 27: Hoare triple {1531#false} main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1531#false} is VALID [2020-07-29 03:15:10,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {1531#false} assume !(0 == assert_~arg % 256); {1531#false} is VALID [2020-07-29 03:15:10,580 INFO L280 TraceCheckUtils]: 29: Hoare triple {1531#false} main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; {1531#false} is VALID [2020-07-29 03:15:10,582 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:15:10,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416738268] [2020-07-29 03:15:10,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:10,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:15:10,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121835318] [2020-07-29 03:15:10,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:15:10,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:10,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:15:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:15:10,584 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. cyclomatic complexity: 231 Second operand 3 states. [2020-07-29 03:15:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:11,249 INFO L93 Difference]: Finished difference Result 382 states and 661 transitions. [2020-07-29 03:15:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:15:11,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:15:11,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:11,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 661 transitions. [2020-07-29 03:15:11,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 190 [2020-07-29 03:15:11,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 382 states and 661 transitions. [2020-07-29 03:15:11,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2020-07-29 03:15:11,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2020-07-29 03:15:11,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 382 states and 661 transitions. [2020-07-29 03:15:11,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:11,337 INFO L688 BuchiCegarLoop]: Abstraction has 382 states and 661 transitions. [2020-07-29 03:15:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states and 661 transitions. [2020-07-29 03:15:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2020-07-29 03:15:11,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:15:11,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states and 661 transitions. Second operand 382 states. [2020-07-29 03:15:11,354 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states and 661 transitions. Second operand 382 states. [2020-07-29 03:15:11,354 INFO L87 Difference]: Start difference. First operand 382 states and 661 transitions. Second operand 382 states. [2020-07-29 03:15:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:11,371 INFO L93 Difference]: Finished difference Result 382 states and 661 transitions. [2020-07-29 03:15:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 661 transitions. [2020-07-29 03:15:11,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:11,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:11,373 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand 382 states and 661 transitions. [2020-07-29 03:15:11,373 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 382 states and 661 transitions. [2020-07-29 03:15:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:11,391 INFO L93 Difference]: Finished difference Result 382 states and 661 transitions. [2020-07-29 03:15:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 661 transitions. [2020-07-29 03:15:11,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:11,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:11,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:15:11,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:15:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-07-29 03:15:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 661 transitions. [2020-07-29 03:15:11,408 INFO L711 BuchiCegarLoop]: Abstraction has 382 states and 661 transitions. [2020-07-29 03:15:11,408 INFO L591 BuchiCegarLoop]: Abstraction has 382 states and 661 transitions. [2020-07-29 03:15:11,408 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:15:11,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 661 transitions. [2020-07-29 03:15:11,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 190 [2020-07-29 03:15:11,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:11,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:11,414 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, 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:15:11,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:15:11,414 INFO L794 eck$LassoCheckResult]: Stem: 2128#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; 1946#L-1 havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1947#L439 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1979#L450 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1980#L460 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1974#L471 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 2211#L481 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 2199#L492 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 2197#L502 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 2123#L513 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 2120#L523 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1944#L534 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1941#L544 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1939#L555 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1940#L565 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1938#L576 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 2050#L586 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 2049#L597 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 2182#L607 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 2106#L618 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 2181#L628 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1920#L639 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 2079#L649 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1997#L660 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1993#L670 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1991#L681 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1992#L691 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 2011#L702 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 2216#L712 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 2074#L723 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 2203#L733 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 2131#L744 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 2129#L754 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1967#L765 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1964#L775 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1958#L786 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1959#L796 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1957#L807 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 2060#L817 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 2059#L828 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 2189#L838 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 2097#L849 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 2094#L859 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1989#L870 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 2093#L880 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 2030#L891 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 2027#L901 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 2025#L912 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 2026#L922 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 2024#L933 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 2175#L943 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1976#L943-1 init_#res := init_~tmp___23~0; 2115#L1112 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 2116#L66 assume !(0 == assume_abort_if_not_~cond); 1960#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1961#L1249-2 [2020-07-29 03:15:11,415 INFO L796 eck$LassoCheckResult]: Loop: 1961#L1249-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 2291#L154 assume !(0 != ~mode1~0 % 256); 2290#L186 assume ~r1~0 < 3; 2109#L187 assume !(0 != ~ep12~0 % 256); 2110#L187-2 assume !(0 != ~ep13~0 % 256); 1987#L190-1 assume !(0 != ~ep14~0 % 256); 2185#L186-1 ~mode1~0 := 1; 2195#L154-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 2285#L207 assume !(0 != ~mode2~0 % 256); 2271#L239 assume !(~r2~0 < 3); 2261#L239-1 ~mode2~0 := 1; 2256#L207-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 2254#L260 assume !(0 != ~mode3~0 % 256); 2255#L292 assume !(~r3~0 < 3); 2243#L292-1 ~mode3~0 := 1; 2242#L260-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 2238#L313 assume !(0 != ~mode4~0 % 256); 2234#L345 assume !(~r4~0 < 3); 2227#L345-1 ~mode4~0 := 1; 2226#L313-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 2225#L1120 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2224#L1121 assume ~st1~0 + ~nl1~0 <= 1; 2223#L1122 assume ~st2~0 + ~nl2~0 <= 1; 2222#L1123 assume ~st3~0 + ~nl3~0 <= 1; 2221#L1124 assume ~st4~0 + ~nl4~0 <= 1; 2220#L1125 assume !(~r1~0 >= 3); 2143#L1128 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2144#L1129 assume ~r1~0 < 3; 2296#L1134 assume !(~r1~0 >= 3); 1998#L1138 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1999#L1139 assume ~r1~0 < 3;check_~tmp~1 := 1; 2295#L1120-1 check_#res := check_~tmp~1; 2294#L1172 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 2293#L1292 assume !(0 == assert_~arg % 256); 2292#L1287 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 1961#L1249-2 [2020-07-29 03:15:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:11,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 3 times [2020-07-29 03:15:11,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:11,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378405841] [2020-07-29 03:15:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:11,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {3064#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; {3064#true} is VALID [2020-07-29 03:15:11,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {3064#true} havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {3064#true} is VALID [2020-07-29 03:15:11,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {3064#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,525 INFO L280 TraceCheckUtils]: 3: Hoare triple {3064#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {3064#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,526 INFO L280 TraceCheckUtils]: 5: Hoare triple {3064#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {3064#true} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {3064#true} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {3064#true} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {3064#true} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,527 INFO L280 TraceCheckUtils]: 10: Hoare triple {3064#true} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {3064#true} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {3064#true} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {3064#true} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {3064#true} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {3064#true} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,528 INFO L280 TraceCheckUtils]: 16: Hoare triple {3064#true} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,529 INFO L280 TraceCheckUtils]: 17: Hoare triple {3064#true} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,529 INFO L280 TraceCheckUtils]: 18: Hoare triple {3064#true} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,529 INFO L280 TraceCheckUtils]: 19: Hoare triple {3064#true} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {3064#true} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,530 INFO L280 TraceCheckUtils]: 21: Hoare triple {3064#true} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,530 INFO L280 TraceCheckUtils]: 22: Hoare triple {3064#true} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,531 INFO L280 TraceCheckUtils]: 23: Hoare triple {3064#true} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,531 INFO L280 TraceCheckUtils]: 24: Hoare triple {3064#true} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,533 INFO L280 TraceCheckUtils]: 25: Hoare triple {3064#true} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,533 INFO L280 TraceCheckUtils]: 26: Hoare triple {3064#true} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,534 INFO L280 TraceCheckUtils]: 27: Hoare triple {3064#true} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,534 INFO L280 TraceCheckUtils]: 28: Hoare triple {3064#true} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,534 INFO L280 TraceCheckUtils]: 29: Hoare triple {3064#true} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,535 INFO L280 TraceCheckUtils]: 30: Hoare triple {3064#true} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,535 INFO L280 TraceCheckUtils]: 31: Hoare triple {3064#true} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,535 INFO L280 TraceCheckUtils]: 32: Hoare triple {3064#true} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,536 INFO L280 TraceCheckUtils]: 33: Hoare triple {3064#true} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,536 INFO L280 TraceCheckUtils]: 34: Hoare triple {3064#true} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,537 INFO L280 TraceCheckUtils]: 35: Hoare triple {3064#true} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,537 INFO L280 TraceCheckUtils]: 36: Hoare triple {3064#true} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,537 INFO L280 TraceCheckUtils]: 37: Hoare triple {3064#true} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,538 INFO L280 TraceCheckUtils]: 38: Hoare triple {3064#true} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,538 INFO L280 TraceCheckUtils]: 39: Hoare triple {3064#true} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,538 INFO L280 TraceCheckUtils]: 40: Hoare triple {3064#true} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,539 INFO L280 TraceCheckUtils]: 41: Hoare triple {3064#true} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,539 INFO L280 TraceCheckUtils]: 42: Hoare triple {3064#true} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,539 INFO L280 TraceCheckUtils]: 43: Hoare triple {3064#true} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,540 INFO L280 TraceCheckUtils]: 44: Hoare triple {3064#true} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,540 INFO L280 TraceCheckUtils]: 45: Hoare triple {3064#true} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,540 INFO L280 TraceCheckUtils]: 46: Hoare triple {3064#true} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,541 INFO L280 TraceCheckUtils]: 47: Hoare triple {3064#true} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,541 INFO L280 TraceCheckUtils]: 48: Hoare triple {3064#true} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {3064#true} is VALID [2020-07-29 03:15:11,541 INFO L280 TraceCheckUtils]: 49: Hoare triple {3064#true} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {3064#true} is VALID [2020-07-29 03:15:11,542 INFO L280 TraceCheckUtils]: 50: Hoare triple {3064#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {3066#(= 0 ULTIMATE.start_init_~tmp___23~0)} is VALID [2020-07-29 03:15:11,543 INFO L280 TraceCheckUtils]: 51: Hoare triple {3066#(= 0 ULTIMATE.start_init_~tmp___23~0)} init_#res := init_~tmp___23~0; {3067#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:15:11,544 INFO L280 TraceCheckUtils]: 52: Hoare triple {3067#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3068#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:15:11,545 INFO L280 TraceCheckUtils]: 53: Hoare triple {3068#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {3065#false} is VALID [2020-07-29 03:15:11,545 INFO L280 TraceCheckUtils]: 54: Hoare triple {3065#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {3065#false} is VALID [2020-07-29 03:15:11,550 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:15:11,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378405841] [2020-07-29 03:15:11,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:11,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:11,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608136579] [2020-07-29 03:15:11,552 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:15:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1683797340, now seen corresponding path program 1 times [2020-07-29 03:15:11,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:11,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937794674] [2020-07-29 03:15:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:15:11,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:15:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:15:11,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:15:11,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:15:12,126 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2020-07-29 03:15:12,587 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-29 03:15:12,609 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:15:12,610 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:15:12,610 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:15:12,610 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:15:12,611 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:15:12,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:12,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:15:12,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:15:12,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2020-07-29 03:15:12,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:15:12,612 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:15:12,697 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:15:12,717 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:15:12,722 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:15:12,728 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:15:12,730 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:15:12,733 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:15:12,737 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:15:12,748 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:15:12,753 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:15:12,760 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:15:12,764 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:15:12,767 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:15:12,777 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:15:12,781 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:15:12,785 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:15:12,789 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:15:12,792 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:15:12,797 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:15:12,800 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:15:12,804 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:15:12,811 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:15:12,818 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:15:12,822 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:15:12,830 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:15:12,835 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:15:12,839 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:15:12,854 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:15:12,858 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:15:12,862 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:15:12,916 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:15:12,922 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:15:12,926 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:15:12,929 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:15:12,937 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:15:12,941 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:15:12,944 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:15:12,949 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:15:12,953 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:15:13,698 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:14,241 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:14,464 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:15:14,464 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:15:14,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:15:14,469 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:14,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:15:14,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:15:14,589 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:15:14,592 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:15:14,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:15:14,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:15:14,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:15:14,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:15:14,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:14,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:15:14,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:15:14,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2020-07-29 03:15:14,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:15:14,594 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:15:14,647 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:15:14,661 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:15:14,667 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:15:14,669 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:15:14,672 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:15:14,675 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:15:14,684 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:15:14,689 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:15:14,692 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:15:14,699 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:15:14,704 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:15:14,709 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:15:14,718 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:15:14,726 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:15:14,732 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:15:14,785 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:15:14,789 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:15:14,792 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:15:14,798 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:15:14,801 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:15:14,806 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:15:14,813 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:15:14,819 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:15:14,828 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:15:14,834 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:15:14,837 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:15:14,845 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:15:14,849 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:15:14,866 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:15:14,872 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:15:14,876 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:15:14,880 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:15:14,884 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:15:14,887 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:15:14,895 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:15:14,898 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:15:14,901 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:15:14,907 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:15:15,518 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:16,014 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:16,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:15:16,267 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:15:16,278 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:15:16,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,320 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:15:16,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:16,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:16,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,362 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:15:16,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,390 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:15:16,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,417 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:15:16,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,443 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:15:16,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,477 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:15:16,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,506 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:15:16,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:16,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:16,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,537 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:15:16,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,565 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:15:16,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:16,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:16,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,600 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:15:16,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,628 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:15:16,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:16,688 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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:16,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:16,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,726 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:15:16,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,772 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:15:16,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:16,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:16,842 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:15:16,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:16,920 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:15:16,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:16,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:16,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:16,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:16,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:16,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:16,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:17,005 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:15:17,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:17,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:17,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:17,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:17,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:17,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:17,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:17,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:17,060 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:15:17,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:17,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:17,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:17,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:17,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:17,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:17,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:17,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:17,104 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:15:17,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:17,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:17,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:17,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:17,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:17,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:17,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:17,145 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:15:17,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:17,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:17,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:17,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:17,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:17,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:17,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:17,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:17,175 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:15:17,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:17,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:17,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:17,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:17,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:17,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:17,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:17,179 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:15:17,188 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:15:17,188 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:17,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:15:17,200 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:15:17,200 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:17,201 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:15:17,239 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:15:17,252 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 3;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "assume !(0 != ~ep14~0 % 256);" "~mode1~0 := 1;" "havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_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 ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;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~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54;" [2020-07-29 03:15:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:17,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:15:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:17,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:15:17,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {3071#unseeded} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~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]; {3071#unseeded} is VALID [2020-07-29 03:15:17,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {3071#unseeded} havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {3071#unseeded} is VALID [2020-07-29 03:15:17,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {3071#unseeded} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,465 INFO L280 TraceCheckUtils]: 3: Hoare triple {3071#unseeded} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {3071#unseeded} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {3071#unseeded} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,467 INFO L280 TraceCheckUtils]: 6: Hoare triple {3071#unseeded} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,467 INFO L280 TraceCheckUtils]: 7: Hoare triple {3071#unseeded} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,468 INFO L280 TraceCheckUtils]: 8: Hoare triple {3071#unseeded} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,468 INFO L280 TraceCheckUtils]: 9: Hoare triple {3071#unseeded} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,469 INFO L280 TraceCheckUtils]: 10: Hoare triple {3071#unseeded} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,470 INFO L280 TraceCheckUtils]: 11: Hoare triple {3071#unseeded} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,470 INFO L280 TraceCheckUtils]: 12: Hoare triple {3071#unseeded} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,471 INFO L280 TraceCheckUtils]: 13: Hoare triple {3071#unseeded} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,472 INFO L280 TraceCheckUtils]: 14: Hoare triple {3071#unseeded} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,472 INFO L280 TraceCheckUtils]: 15: Hoare triple {3071#unseeded} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,473 INFO L280 TraceCheckUtils]: 16: Hoare triple {3071#unseeded} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,473 INFO L280 TraceCheckUtils]: 17: Hoare triple {3071#unseeded} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,474 INFO L280 TraceCheckUtils]: 18: Hoare triple {3071#unseeded} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,475 INFO L280 TraceCheckUtils]: 19: Hoare triple {3071#unseeded} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,475 INFO L280 TraceCheckUtils]: 20: Hoare triple {3071#unseeded} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,476 INFO L280 TraceCheckUtils]: 21: Hoare triple {3071#unseeded} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,476 INFO L280 TraceCheckUtils]: 22: Hoare triple {3071#unseeded} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,477 INFO L280 TraceCheckUtils]: 23: Hoare triple {3071#unseeded} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,478 INFO L280 TraceCheckUtils]: 24: Hoare triple {3071#unseeded} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {3071#unseeded} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {3071#unseeded} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,479 INFO L280 TraceCheckUtils]: 27: Hoare triple {3071#unseeded} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,480 INFO L280 TraceCheckUtils]: 28: Hoare triple {3071#unseeded} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,481 INFO L280 TraceCheckUtils]: 29: Hoare triple {3071#unseeded} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,481 INFO L280 TraceCheckUtils]: 30: Hoare triple {3071#unseeded} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,482 INFO L280 TraceCheckUtils]: 31: Hoare triple {3071#unseeded} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,482 INFO L280 TraceCheckUtils]: 32: Hoare triple {3071#unseeded} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,483 INFO L280 TraceCheckUtils]: 33: Hoare triple {3071#unseeded} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,484 INFO L280 TraceCheckUtils]: 34: Hoare triple {3071#unseeded} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,484 INFO L280 TraceCheckUtils]: 35: Hoare triple {3071#unseeded} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,485 INFO L280 TraceCheckUtils]: 36: Hoare triple {3071#unseeded} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,486 INFO L280 TraceCheckUtils]: 37: Hoare triple {3071#unseeded} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,486 INFO L280 TraceCheckUtils]: 38: Hoare triple {3071#unseeded} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,487 INFO L280 TraceCheckUtils]: 39: Hoare triple {3071#unseeded} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,488 INFO L280 TraceCheckUtils]: 40: Hoare triple {3071#unseeded} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,488 INFO L280 TraceCheckUtils]: 41: Hoare triple {3071#unseeded} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,489 INFO L280 TraceCheckUtils]: 42: Hoare triple {3071#unseeded} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,489 INFO L280 TraceCheckUtils]: 43: Hoare triple {3071#unseeded} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,490 INFO L280 TraceCheckUtils]: 44: Hoare triple {3071#unseeded} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,491 INFO L280 TraceCheckUtils]: 45: Hoare triple {3071#unseeded} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,491 INFO L280 TraceCheckUtils]: 46: Hoare triple {3071#unseeded} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,492 INFO L280 TraceCheckUtils]: 47: Hoare triple {3071#unseeded} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,493 INFO L280 TraceCheckUtils]: 48: Hoare triple {3071#unseeded} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {3071#unseeded} is VALID [2020-07-29 03:15:17,493 INFO L280 TraceCheckUtils]: 49: Hoare triple {3071#unseeded} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {3071#unseeded} is VALID [2020-07-29 03:15:17,494 INFO L280 TraceCheckUtils]: 50: Hoare triple {3071#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {3071#unseeded} is VALID [2020-07-29 03:15:17,494 INFO L280 TraceCheckUtils]: 51: Hoare triple {3071#unseeded} init_#res := init_~tmp___23~0; {3071#unseeded} is VALID [2020-07-29 03:15:17,495 INFO L280 TraceCheckUtils]: 52: Hoare triple {3071#unseeded} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3071#unseeded} is VALID [2020-07-29 03:15:17,496 INFO L280 TraceCheckUtils]: 53: Hoare triple {3071#unseeded} assume !(0 == assume_abort_if_not_~cond); {3071#unseeded} is VALID [2020-07-29 03:15:17,496 INFO L280 TraceCheckUtils]: 54: Hoare triple {3071#unseeded} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {3071#unseeded} is VALID [2020-07-29 03:15:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:17,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:15:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:17,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:15:17,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {3074#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15))} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode1~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 3; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~ep12~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~ep13~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~ep14~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,614 INFO L280 TraceCheckUtils]: 6: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode2~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r2~0 < 3); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode3~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,618 INFO L280 TraceCheckUtils]: 13: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r3~0 < 3); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,618 INFO L280 TraceCheckUtils]: 14: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,619 INFO L280 TraceCheckUtils]: 15: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,619 INFO L280 TraceCheckUtils]: 16: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode4~0 % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r4~0 < 3); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,620 INFO L280 TraceCheckUtils]: 18: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,622 INFO L280 TraceCheckUtils]: 20: Hoare triple {3251#(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; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,622 INFO L280 TraceCheckUtils]: 21: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~nl1~0 <= 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,623 INFO L280 TraceCheckUtils]: 22: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st2~0 + ~nl2~0 <= 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,623 INFO L280 TraceCheckUtils]: 23: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st3~0 + ~nl3~0 <= 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,624 INFO L280 TraceCheckUtils]: 24: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st4~0 + ~nl4~0 <= 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,624 INFO L280 TraceCheckUtils]: 25: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 3); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,625 INFO L280 TraceCheckUtils]: 26: Hoare triple {3251#(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; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,625 INFO L280 TraceCheckUtils]: 27: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 3; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,626 INFO L280 TraceCheckUtils]: 28: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 3); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,626 INFO L280 TraceCheckUtils]: 29: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,627 INFO L280 TraceCheckUtils]: 30: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 3;check_~tmp~1 := 1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,627 INFO L280 TraceCheckUtils]: 31: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,628 INFO L280 TraceCheckUtils]: 32: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,629 INFO L280 TraceCheckUtils]: 33: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:17,629 INFO L280 TraceCheckUtils]: 34: Hoare triple {3251#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; {3084#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:15:17,630 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:15:17,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:15:17,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:17,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,688 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:15:17,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 382 states and 661 transitions. cyclomatic complexity: 280 Second operand 3 states. [2020-07-29 03:15:18,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 382 states and 661 transitions. cyclomatic complexity: 280. Second operand 3 states. Result 571 states and 968 transitions. Complement of second has 4 states. [2020-07-29 03:15:18,567 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:15:18,567 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:15:18,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 661 transitions. cyclomatic complexity: 280 [2020-07-29 03:15:18,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:18,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:18,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:15:18,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:15:18,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:18,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:18,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 968 transitions. [2020-07-29 03:15:18,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:18,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:18,593 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 382 states and 661 transitions. cyclomatic complexity: 280 [2020-07-29 03:15:18,709 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 190 examples of accepted words. [2020-07-29 03:15:18,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:15:18,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:15:18,715 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:15:18,715 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 571 states and 968 transitions. cyclomatic complexity: 398 [2020-07-29 03:15:18,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 968 transitions. cyclomatic complexity: 398 [2020-07-29 03:15:18,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:18,716 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:15:18,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:18,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:18,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:18,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 571 letters. Loop has 571 letters. [2020-07-29 03:15:18,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 571 letters. Loop has 571 letters. [2020-07-29 03:15:18,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 571 letters. Loop has 571 letters. [2020-07-29 03:15:18,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 382 letters. Loop has 382 letters. [2020-07-29 03:15:18,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 382 letters. Loop has 382 letters. [2020-07-29 03:15:18,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 382 letters. Loop has 382 letters. [2020-07-29 03:15:18,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:18,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:18,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:18,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:15:18,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:15:18,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:15:18,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 36 letters. [2020-07-29 03:15:18,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 36 letters. [2020-07-29 03:15:18,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 36 letters. [2020-07-29 03:15:18,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 36 letters. [2020-07-29 03:15:18,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 36 letters. [2020-07-29 03:15:18,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 36 letters. [2020-07-29 03:15:18,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:15:18,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:15:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:15:18,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:15:18,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:15:18,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:15:18,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 36 letters. [2020-07-29 03:15:18,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 36 letters. [2020-07-29 03:15:18,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 36 letters. [2020-07-29 03:15:18,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:15:18,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:15:18,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:15:18,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 32 letters. [2020-07-29 03:15:18,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 32 letters. [2020-07-29 03:15:18,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 32 letters. [2020-07-29 03:15:18,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:18,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:18,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:18,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 32 letters. [2020-07-29 03:15:18,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 32 letters. [2020-07-29 03:15:18,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 32 letters. [2020-07-29 03:15:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 32 letters. [2020-07-29 03:15:18,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 32 letters. [2020-07-29 03:15:18,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 32 letters. [2020-07-29 03:15:18,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:15:18,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:15:18,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:15:18,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:18,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 36 letters. [2020-07-29 03:15:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 36 letters. [2020-07-29 03:15:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 36 letters. [2020-07-29 03:15:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 32 letters. [2020-07-29 03:15:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 32 letters. [2020-07-29 03:15:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 32 letters. [2020-07-29 03:15:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 35 letters. [2020-07-29 03:15:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 35 letters. [2020-07-29 03:15:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 35 letters. [2020-07-29 03:15:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 35 letters. [2020-07-29 03:15:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 35 letters. [2020-07-29 03:15:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 35 letters. [2020-07-29 03:15:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 32 letters. [2020-07-29 03:15:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 32 letters. [2020-07-29 03:15:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 32 letters. [2020-07-29 03:15:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 32 letters. [2020-07-29 03:15:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 32 letters. [2020-07-29 03:15:18,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 32 letters. [2020-07-29 03:15:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 36 letters. [2020-07-29 03:15:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 36 letters. [2020-07-29 03:15:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 36 letters. [2020-07-29 03:15:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 36 letters. [2020-07-29 03:15:18,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 36 letters. [2020-07-29 03:15:18,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 36 letters. [2020-07-29 03:15:18,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:15:18,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:15:18,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:15:18,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:15:18,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:15:18,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:15:18,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 40 letters. [2020-07-29 03:15:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 40 letters. [2020-07-29 03:15:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 40 letters. [2020-07-29 03:15:18,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 36 letters. [2020-07-29 03:15:18,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 36 letters. [2020-07-29 03:15:18,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 36 letters. [2020-07-29 03:15:18,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 32 letters. [2020-07-29 03:15:18,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 32 letters. [2020-07-29 03:15:18,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 32 letters. [2020-07-29 03:15:18,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:15:18,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:15:18,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:15:18,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 36 letters. [2020-07-29 03:15:18,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 36 letters. [2020-07-29 03:15:18,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 36 letters. [2020-07-29 03:15:18,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:15:18,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:15:18,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:15:18,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 32 letters. [2020-07-29 03:15:18,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 32 letters. [2020-07-29 03:15:18,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 32 letters. [2020-07-29 03:15:18,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 32 letters. [2020-07-29 03:15:18,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 32 letters. [2020-07-29 03:15:18,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 32 letters. [2020-07-29 03:15:18,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:15:18,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:15:18,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:15:18,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:15:18,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:15:18,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:15:18,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:15:18,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:15:18,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:15:18,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:15:18,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:15:18,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:15:18,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 32 letters. [2020-07-29 03:15:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 32 letters. [2020-07-29 03:15:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 32 letters. [2020-07-29 03:15:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 32 letters. [2020-07-29 03:15:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 32 letters. [2020-07-29 03:15:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 32 letters. [2020-07-29 03:15:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:15:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:15:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:15:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 36 letters. [2020-07-29 03:15:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 36 letters. [2020-07-29 03:15:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 36 letters. [2020-07-29 03:15:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:18,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:18,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:15:18,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:15:18,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:15:18,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 32 letters. [2020-07-29 03:15:18,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 32 letters. [2020-07-29 03:15:18,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 32 letters. [2020-07-29 03:15:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 36 letters. [2020-07-29 03:15:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 36 letters. [2020-07-29 03:15:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 36 letters. [2020-07-29 03:15:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:18,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:18,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:18,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 36 letters. [2020-07-29 03:15:18,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 36 letters. [2020-07-29 03:15:18,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 36 letters. [2020-07-29 03:15:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:15:18,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:15:18,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:15:18,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 32 letters. [2020-07-29 03:15:18,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 32 letters. [2020-07-29 03:15:18,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 32 letters. [2020-07-29 03:15:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:18,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:18,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 32 letters. [2020-07-29 03:15:18,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 32 letters. [2020-07-29 03:15:18,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 32 letters. [2020-07-29 03:15:18,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 35 letters. [2020-07-29 03:15:18,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 35 letters. [2020-07-29 03:15:18,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 35 letters. [2020-07-29 03:15:18,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 35 letters. [2020-07-29 03:15:18,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 35 letters. [2020-07-29 03:15:18,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 35 letters. [2020-07-29 03:15:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 35 letters. [2020-07-29 03:15:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 35 letters. [2020-07-29 03:15:18,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 35 letters. [2020-07-29 03:15:18,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 35 letters. [2020-07-29 03:15:18,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 35 letters. [2020-07-29 03:15:18,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 35 letters. [2020-07-29 03:15:18,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 35 letters. [2020-07-29 03:15:18,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 35 letters. [2020-07-29 03:15:18,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 35 letters. [2020-07-29 03:15:18,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:15:18,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:15:18,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:15:18,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 35 letters. [2020-07-29 03:15:18,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 35 letters. [2020-07-29 03:15:18,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 35 letters. [2020-07-29 03:15:18,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 35 letters. [2020-07-29 03:15:18,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 35 letters. [2020-07-29 03:15:18,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 35 letters. [2020-07-29 03:15:18,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:18,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:18,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:18,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 38 letters. [2020-07-29 03:15:18,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 38 letters. [2020-07-29 03:15:18,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 38 letters. [2020-07-29 03:15:18,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:15:18,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:15:18,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:15:18,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:18,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:18,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:18,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 40 letters. [2020-07-29 03:15:18,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 40 letters. [2020-07-29 03:15:18,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 40 letters. [2020-07-29 03:15:18,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:18,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:18,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:18,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:18,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:18,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:18,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:18,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:18,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:18,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 39 letters. [2020-07-29 03:15:18,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 39 letters. [2020-07-29 03:15:18,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 39 letters. [2020-07-29 03:15:18,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:18,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:18,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:18,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:18,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:18,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:18,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:18,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:18,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:18,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 39 letters. [2020-07-29 03:15:18,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 39 letters. [2020-07-29 03:15:18,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 39 letters. [2020-07-29 03:15:18,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:18,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:18,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:18,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:18,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:18,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:18,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 39 letters. [2020-07-29 03:15:18,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 39 letters. [2020-07-29 03:15:18,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 39 letters. [2020-07-29 03:15:18,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:18,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:18,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:18,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:15:18,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:15:18,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:15:18,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 39 letters. [2020-07-29 03:15:18,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 39 letters. [2020-07-29 03:15:18,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 39 letters. [2020-07-29 03:15:18,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 39 letters. [2020-07-29 03:15:18,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 39 letters. [2020-07-29 03:15:18,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 39 letters. [2020-07-29 03:15:18,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 39 letters. [2020-07-29 03:15:18,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 39 letters. [2020-07-29 03:15:18,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 39 letters. [2020-07-29 03:15:18,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 35 letters. [2020-07-29 03:15:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 35 letters. [2020-07-29 03:15:18,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 35 letters. [2020-07-29 03:15:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 35 letters. [2020-07-29 03:15:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 35 letters. [2020-07-29 03:15:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 35 letters. [2020-07-29 03:15:18,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:15:18,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:15:18,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:15:18,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 40 letters. [2020-07-29 03:15:18,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 40 letters. [2020-07-29 03:15:18,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 40 letters. [2020-07-29 03:15:18,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:15:18,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:15:18,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:15:18,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:18,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:18,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:18,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:15:18,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:15:18,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:15:18,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 32 letters. [2020-07-29 03:15:18,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 32 letters. [2020-07-29 03:15:18,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 32 letters. [2020-07-29 03:15:18,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:15:18,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:15:18,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:15:18,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 40 letters. [2020-07-29 03:15:18,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 40 letters. [2020-07-29 03:15:18,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 40 letters. [2020-07-29 03:15:18,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 39 letters. [2020-07-29 03:15:18,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 39 letters. [2020-07-29 03:15:18,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 39 letters. [2020-07-29 03:15:18,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 36 letters. [2020-07-29 03:15:18,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 36 letters. [2020-07-29 03:15:18,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 36 letters. [2020-07-29 03:15:19,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 39 letters. [2020-07-29 03:15:19,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 39 letters. [2020-07-29 03:15:19,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 39 letters. [2020-07-29 03:15:19,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:19,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:19,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:19,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:19,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:19,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:19,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:19,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:19,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:19,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:19,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:19,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:19,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:19,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:19,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:19,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:19,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:19,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:19,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:19,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:19,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:19,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:19,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:19,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:19,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 40 letters. [2020-07-29 03:15:19,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 40 letters. [2020-07-29 03:15:19,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 40 letters. [2020-07-29 03:15:19,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:19,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:19,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:19,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 38 letters. [2020-07-29 03:15:19,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 38 letters. [2020-07-29 03:15:19,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 38 letters. [2020-07-29 03:15:19,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 39 letters. [2020-07-29 03:15:19,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 39 letters. [2020-07-29 03:15:19,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 39 letters. [2020-07-29 03:15:19,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:19,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:19,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:19,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:15:19,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:15:19,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:15:19,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 40 letters. [2020-07-29 03:15:19,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 40 letters. [2020-07-29 03:15:19,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 40 letters. [2020-07-29 03:15:19,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:19,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:19,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:19,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:15:19,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:15:19,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:15:19,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:19,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:19,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:19,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:19,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:19,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:19,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 56 letters. Loop has 35 letters. [2020-07-29 03:15:19,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 35 letters. [2020-07-29 03:15:19,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 56 letters. Loop has 35 letters. [2020-07-29 03:15:19,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 35 letters. [2020-07-29 03:15:19,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 35 letters. [2020-07-29 03:15:19,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 35 letters. [2020-07-29 03:15:19,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 36 letters. [2020-07-29 03:15:19,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 36 letters. [2020-07-29 03:15:19,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 36 letters. [2020-07-29 03:15:19,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 35 letters. [2020-07-29 03:15:19,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 35 letters. [2020-07-29 03:15:19,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 35 letters. [2020-07-29 03:15:19,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:19,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:19,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:19,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:15:19,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:15:19,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:15:19,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:19,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:19,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:19,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 35 letters. [2020-07-29 03:15:19,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 35 letters. [2020-07-29 03:15:19,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 35 letters. [2020-07-29 03:15:19,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 35 letters. [2020-07-29 03:15:19,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 35 letters. [2020-07-29 03:15:19,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 35 letters. [2020-07-29 03:15:19,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:19,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:19,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:19,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 36 letters. [2020-07-29 03:15:19,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 36 letters. [2020-07-29 03:15:19,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 36 letters. [2020-07-29 03:15:19,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 32 letters. [2020-07-29 03:15:19,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 32 letters. [2020-07-29 03:15:19,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 32 letters. [2020-07-29 03:15:19,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 32 letters. [2020-07-29 03:15:19,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 32 letters. [2020-07-29 03:15:19,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 32 letters. [2020-07-29 03:15:19,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 36 letters. [2020-07-29 03:15:19,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 36 letters. [2020-07-29 03:15:19,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 36 letters. [2020-07-29 03:15:19,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:19,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:19,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 32 letters. [2020-07-29 03:15:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 32 letters. [2020-07-29 03:15:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 32 letters. [2020-07-29 03:15:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,050 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:15:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:15:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-07-29 03:15:19,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:19,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 90 letters. Loop has 35 letters. [2020-07-29 03:15:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 70 letters. [2020-07-29 03:15:19,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:19,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 571 states and 968 transitions. cyclomatic complexity: 398 [2020-07-29 03:15:19,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:19,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 571 states to 0 states and 0 transitions. [2020-07-29 03:15:19,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:15:19,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:15:19,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:15:19,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:19,082 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:19,083 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:19,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:15:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:15:19,083 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2020-07-29 03:15:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:19,084 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:15:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:15:19,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:15:19,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:19,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:15:19,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:19,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:15:19,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:15:19,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:15:19,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:15:19,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:19,150 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:19,150 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:19,150 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:19,150 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:15:19,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:15:19,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:19,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:19,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:15:19 BoogieIcfgContainer [2020-07-29 03:15:19,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:15:19,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:15:19,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:15:19,159 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:15:19,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:15:07" (3/4) ... [2020-07-29 03:15:19,163 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:15:19,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:15:19,165 INFO L168 Benchmark]: Toolchain (without parser) took 14758.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 961.6 MB in the beginning and 905.1 MB in the end (delta: 56.4 MB). Peak memory consumption was 497.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:19,166 INFO L168 Benchmark]: CDTParser took 0.28 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:15:19,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:19,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.06 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:15:19,168 INFO L168 Benchmark]: Boogie Preprocessor took 81.25 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:15:19,168 INFO L168 Benchmark]: RCFGBuilder took 1929.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 189.3 MB). Peak memory consumption was 189.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:19,169 INFO L168 Benchmark]: BuchiAutomizer took 11875.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 922.8 MB in the beginning and 905.1 MB in the end (delta: 17.7 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:19,169 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.5 GB. Free memory is still 905.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:15:19,172 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.28 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 746.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.06 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 81.25 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. * RCFGBuilder took 1929.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 189.3 MB). Peak memory consumption was 189.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11875.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 922.8 MB in the beginning and 905.1 MB in the end (delta: 17.7 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.5 GB. Free memory is still 905.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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.8s. Construction of modules took 0.0s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 382 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1591 SDtfs, 784 SDslu, 2287 SDs, 0 SdLazy, 36 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax124 hnf105 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...