./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.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_opt-floodmax.3.2.ufo.BOUNDED-6.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 c6cc89ff56775e4265311f548ee6496a5a53262e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:49,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:20:49,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:20:49,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:20:49,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:20:49,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:20:49,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:20:49,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:20:49,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:20:49,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:20:49,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:20:49,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:20:49,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:20:49,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:20:49,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:20:49,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:20:49,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:20:49,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:20:49,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:20:49,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:20:49,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:20:49,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:20:49,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:20:49,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:20:49,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:20:49,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:20:49,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:20:49,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:20:49,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:20:49,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:20:49,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:20:49,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:20:49,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:20:49,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:20:49,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:20:49,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:20:49,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:20:49,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:20:49,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:20:49,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:20:49,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:20:49,600 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:20:49,619 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:20:49,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:20:49,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:20:49,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:20:49,622 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:20:49,622 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:20:49,623 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:20:49,623 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:20:49,623 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:20:49,623 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:20:49,625 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:20:49,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:20:49,625 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:20:49,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:20:49,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:20:49,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:20:49,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:20:49,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:20:49,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:20:49,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:20:49,628 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:20:49,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:20:49,628 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:20:49,629 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:20:49,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:20:49,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:20:49,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:20:49,630 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:20:49,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:20:49,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:20:49,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:20:49,632 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:20:49,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:20:49,634 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 -> c6cc89ff56775e4265311f548ee6496a5a53262e [2020-07-29 03:20:49,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:20:49,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:20:49,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:20:49,943 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:20:49,944 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:20:49,944 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-07-29 03:20:50,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdec0ae97/64771289f2284622b70cf9d2560934ad/FLAG3c74aabf1 [2020-07-29 03:20:50,520 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:20:50,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-07-29 03:20:50,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdec0ae97/64771289f2284622b70cf9d2560934ad/FLAG3c74aabf1 [2020-07-29 03:20:50,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdec0ae97/64771289f2284622b70cf9d2560934ad [2020-07-29 03:20:50,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:20:50,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:20:50,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:20:50,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:20:50,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:20:50,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:20:50" (1/1) ... [2020-07-29 03:20:50,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ade0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:50, skipping insertion in model container [2020-07-29 03:20:50,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:20:50" (1/1) ... [2020-07-29 03:20:50,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:20:50,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:20:51,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:20:51,288 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:20:51,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:20:51,403 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:20:51,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51 WrapperNode [2020-07-29 03:20:51,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:20:51,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:20:51,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:20:51,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:20:51,414 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:20:51" (1/1) ... [2020-07-29 03:20:51,426 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:20:51" (1/1) ... [2020-07-29 03:20:51,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:20:51,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:20:51,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:20:51,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:20:51,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (1/1) ... [2020-07-29 03:20:51,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:20:51,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:20:51,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:20:51,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:20:51,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (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:20:51,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:20:51,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:20:52,678 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:20:52,678 INFO L295 CfgBuilder]: Removed 19 assume(true) statements. [2020-07-29 03:20:52,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:52 BoogieIcfgContainer [2020-07-29 03:20:52,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:20:52,685 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:20:52,685 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:20:52,689 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:20:52,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:52,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:20:50" (1/3) ... [2020-07-29 03:20:52,692 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e5833d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:20:52, skipping insertion in model container [2020-07-29 03:20:52,692 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:52,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:51" (2/3) ... [2020-07-29 03:20:52,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e5833d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:20:52, skipping insertion in model container [2020-07-29 03:20:52,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:52,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:52" (3/3) ... [2020-07-29 03:20:52,695 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-07-29 03:20:52,737 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:20:52,737 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:20:52,737 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:20:52,737 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:20:52,738 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:20:52,738 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:20:52,738 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:20:52,738 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:20:52,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2020-07-29 03:20:52,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:20:52,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:52,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:52,822 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] [2020-07-29 03:20:52,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:52,823 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:20:52,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2020-07-29 03:20:52,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:20:52,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:52,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:52,861 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] [2020-07-29 03:20:52,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:52,869 INFO L794 eck$LassoCheckResult]: Stem: 106#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 34#L304true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 14#L307-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 63#L317true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 60#L320-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 115#L330true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 98#L333-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 8#L343true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 130#L346-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 37#L356true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 33#L359-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 85#L369true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 62#L372-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 120#L382true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 123#L382-1true init_#res := init_~tmp___5~0; 134#L503true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 107#L66true assume !(0 == assume_abort_if_not_~cond); 15#L65true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 70#L614-2true [2020-07-29 03:20:52,870 INFO L796 eck$LassoCheckResult]: Loop: 70#L614-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 80#L127true assume !(0 != ~mode1~0 % 256); 40#L155true assume !(~r1~0 < 2); 38#L155-1true ~mode1~0 := 1; 58#L127-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 136#L178true assume !(0 != ~mode2~0 % 256); 129#L206true assume !(~r2~0 < 2); 127#L206-1true ~mode2~0 := 1; 131#L178-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 54#L229true assume !(0 != ~mode3~0 % 256); 49#L257true assume !(~r3~0 < 2); 48#L257-1true ~mode3~0 := 1; 68#L229-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 11#L511true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 137#L511-1true check_#res := check_~tmp~1; 90#L559true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 93#L644true assume !(0 == assert_~arg % 256); 79#L639true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 70#L614-2true [2020-07-29 03:20:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2020-07-29 03:20:52,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:52,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57363986] [2020-07-29 03:20:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:53,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; {146#true} is VALID [2020-07-29 03:20:53,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {146#true} is VALID [2020-07-29 03:20:53,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {146#true} is VALID [2020-07-29 03:20:53,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:20:53,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {146#true} is VALID [2020-07-29 03:20:53,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:20:53,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {146#true} is VALID [2020-07-29 03:20:53,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:20:53,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {146#true} is VALID [2020-07-29 03:20:53,245 INFO L280 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:20:53,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {146#true} is VALID [2020-07-29 03:20:53,246 INFO L280 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:20:53,247 INFO L280 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {146#true} is VALID [2020-07-29 03:20:53,247 INFO L280 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:20:53,249 INFO L280 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; {148#(= 0 ULTIMATE.start_init_~tmp___5~0)} is VALID [2020-07-29 03:20:53,250 INFO L280 TraceCheckUtils]: 15: Hoare triple {148#(= 0 ULTIMATE.start_init_~tmp___5~0)} init_#res := init_~tmp___5~0; {149#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:20:53,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {149#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {150#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:20:53,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {150#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {147#false} is VALID [2020-07-29 03:20:53,253 INFO L280 TraceCheckUtils]: 18: Hoare triple {147#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {147#false} is VALID [2020-07-29 03:20:53,259 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:20:53,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57363986] [2020-07-29 03:20:53,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:53,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:53,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916223162] [2020-07-29 03:20:53,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:20:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 339208114, now seen corresponding path program 1 times [2020-07-29 03:20:53,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:53,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188710469] [2020-07-29 03:20:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:53,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {151#true} is VALID [2020-07-29 03:20:53,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume !(0 != ~mode1~0 % 256); {151#true} is VALID [2020-07-29 03:20:53,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume !(~r1~0 < 2); {151#true} is VALID [2020-07-29 03:20:53,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {151#true} ~mode1~0 := 1; {151#true} is VALID [2020-07-29 03:20:53,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {151#true} is VALID [2020-07-29 03:20:53,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} assume !(0 != ~mode2~0 % 256); {151#true} is VALID [2020-07-29 03:20:53,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#true} assume !(~r2~0 < 2); {151#true} is VALID [2020-07-29 03:20:53,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#true} ~mode2~0 := 1; {151#true} is VALID [2020-07-29 03:20:53,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {151#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {151#true} is VALID [2020-07-29 03:20:53,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {151#true} assume !(0 != ~mode3~0 % 256); {151#true} is VALID [2020-07-29 03:20:53,412 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#true} assume !(~r3~0 < 2); {151#true} is VALID [2020-07-29 03:20:53,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {151#true} ~mode3~0 := 1; {151#true} is VALID [2020-07-29 03:20:53,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {151#true} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {151#true} is VALID [2020-07-29 03:20:53,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {151#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {153#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:20:53,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {153#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {154#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:20:53,417 INFO L280 TraceCheckUtils]: 15: Hoare triple {154#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {155#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:20:53,418 INFO L280 TraceCheckUtils]: 16: Hoare triple {155#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {152#false} is VALID [2020-07-29 03:20:53,418 INFO L280 TraceCheckUtils]: 17: Hoare triple {152#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {152#false} is VALID [2020-07-29 03:20:53,420 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:20:53,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188710469] [2020-07-29 03:20:53,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:53,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:53,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191678406] [2020-07-29 03:20:53,424 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:53,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:20:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:20:53,442 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2020-07-29 03:20:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:54,321 INFO L93 Difference]: Finished difference Result 146 states and 247 transitions. [2020-07-29 03:20:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:20:54,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:20:54,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:54,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 247 transitions. [2020-07-29 03:20:54,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:20:54,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 137 states and 231 transitions. [2020-07-29 03:20:54,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2020-07-29 03:20:54,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2020-07-29 03:20:54,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 231 transitions. [2020-07-29 03:20:54,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:54,379 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2020-07-29 03:20:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 231 transitions. [2020-07-29 03:20:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-29 03:20:54,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:54,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 231 transitions. Second operand 137 states. [2020-07-29 03:20:54,414 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 231 transitions. Second operand 137 states. [2020-07-29 03:20:54,416 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. Second operand 137 states. [2020-07-29 03:20:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:54,425 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2020-07-29 03:20:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2020-07-29 03:20:54,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:54,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:54,427 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states and 231 transitions. [2020-07-29 03:20:54,428 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states and 231 transitions. [2020-07-29 03:20:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:54,435 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2020-07-29 03:20:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2020-07-29 03:20:54,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:54,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:54,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:54,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-29 03:20:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 231 transitions. [2020-07-29 03:20:54,453 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2020-07-29 03:20:54,453 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2020-07-29 03:20:54,453 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:20:54,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 231 transitions. [2020-07-29 03:20:54,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:20:54,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:54,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:54,458 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] [2020-07-29 03:20:54,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:54,458 INFO L794 eck$LassoCheckResult]: Stem: 433#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 328#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 329#L304 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 331#L307-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 333#L317 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 323#L320-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 404#L330 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 375#L333-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 319#L343 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 320#L346-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 371#L356 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 364#L359-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 367#L369 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 354#L372-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 406#L382 assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 307#L382-1 init_#res := init_~tmp___5~0; 440#L503 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 434#L66 assume !(0 == assume_abort_if_not_~cond); 334#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 335#L614-2 [2020-07-29 03:20:54,459 INFO L796 eck$LassoCheckResult]: Loop: 335#L614-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 410#L127 assume !(0 != ~mode1~0 % 256); 376#L155 assume !(~r1~0 < 2); 372#L155-1 ~mode1~0 := 1; 373#L127-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 402#L178 assume !(0 != ~mode2~0 % 256); 442#L206 assume !(~r2~0 < 2); 386#L206-1 ~mode2~0 := 1; 339#L178-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 397#L229 assume !(0 != ~mode3~0 % 256); 389#L257 assume !(~r3~0 < 2); 379#L257-1 ~mode3~0 := 1; 388#L229-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 326#L511 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 327#L512 assume ~st1~0 + ~nl1~0 <= 1; 382#L513 assume ~st2~0 + ~nl2~0 <= 1; 383#L514 assume ~st3~0 + ~nl3~0 <= 1; 411#L515 assume ~r1~0 >= 2; 336#L519 assume ~r1~0 < 2; 338#L524 assume ~r1~0 >= 2; 380#L529 assume ~r1~0 < 2;check_~tmp~1 := 1; 325#L511-1 check_#res := check_~tmp~1; 424#L559 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 425#L644 assume !(0 == assert_~arg % 256); 416#L639 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 335#L614-2 [2020-07-29 03:20:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2020-07-29 03:20:54,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:54,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694440802] [2020-07-29 03:20:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:54,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {720#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; {720#true} is VALID [2020-07-29 03:20:54,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {720#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {720#true} is VALID [2020-07-29 03:20:54,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {720#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {720#true} is VALID [2020-07-29 03:20:54,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {720#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:20:54,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {720#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {720#true} is VALID [2020-07-29 03:20:54,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {720#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:20:54,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {720#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {720#true} is VALID [2020-07-29 03:20:54,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {720#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:20:54,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {720#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {720#true} is VALID [2020-07-29 03:20:54,599 INFO L280 TraceCheckUtils]: 9: Hoare triple {720#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:20:54,599 INFO L280 TraceCheckUtils]: 10: Hoare triple {720#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {720#true} is VALID [2020-07-29 03:20:54,599 INFO L280 TraceCheckUtils]: 11: Hoare triple {720#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:20:54,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {720#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {720#true} is VALID [2020-07-29 03:20:54,600 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:20:54,601 INFO L280 TraceCheckUtils]: 14: Hoare triple {720#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; {722#(= 0 ULTIMATE.start_init_~tmp___5~0)} is VALID [2020-07-29 03:20:54,602 INFO L280 TraceCheckUtils]: 15: Hoare triple {722#(= 0 ULTIMATE.start_init_~tmp___5~0)} init_#res := init_~tmp___5~0; {723#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:20:54,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {723#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {724#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:20:54,603 INFO L280 TraceCheckUtils]: 17: Hoare triple {724#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {721#false} is VALID [2020-07-29 03:20:54,604 INFO L280 TraceCheckUtils]: 18: Hoare triple {721#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {721#false} is VALID [2020-07-29 03:20:54,605 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:20:54,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694440802] [2020-07-29 03:20:54,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:54,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:54,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169705133] [2020-07-29 03:20:54,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:20:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 1 times [2020-07-29 03:20:54,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:54,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996344248] [2020-07-29 03:20:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:54,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {725#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {725#true} is VALID [2020-07-29 03:20:54,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {725#true} assume !(0 != ~mode1~0 % 256); {725#true} is VALID [2020-07-29 03:20:54,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {725#true} assume !(~r1~0 < 2); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,651 INFO L280 TraceCheckUtils]: 3: Hoare triple {727#(< 1 ~r1~0)} ~mode1~0 := 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {727#(< 1 ~r1~0)} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,653 INFO L280 TraceCheckUtils]: 5: Hoare triple {727#(< 1 ~r1~0)} assume !(0 != ~mode2~0 % 256); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,653 INFO L280 TraceCheckUtils]: 6: Hoare triple {727#(< 1 ~r1~0)} assume !(~r2~0 < 2); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {727#(< 1 ~r1~0)} ~mode2~0 := 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {727#(< 1 ~r1~0)} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {727#(< 1 ~r1~0)} assume !(0 != ~mode3~0 % 256); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,657 INFO L280 TraceCheckUtils]: 10: Hoare triple {727#(< 1 ~r1~0)} assume !(~r3~0 < 2); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {727#(< 1 ~r1~0)} ~mode3~0 := 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,658 INFO L280 TraceCheckUtils]: 12: Hoare triple {727#(< 1 ~r1~0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#(< 1 ~r1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,660 INFO L280 TraceCheckUtils]: 14: Hoare triple {727#(< 1 ~r1~0)} assume ~st1~0 + ~nl1~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,661 INFO L280 TraceCheckUtils]: 15: Hoare triple {727#(< 1 ~r1~0)} assume ~st2~0 + ~nl2~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,661 INFO L280 TraceCheckUtils]: 16: Hoare triple {727#(< 1 ~r1~0)} assume ~st3~0 + ~nl3~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,662 INFO L280 TraceCheckUtils]: 17: Hoare triple {727#(< 1 ~r1~0)} assume ~r1~0 >= 2; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:54,663 INFO L280 TraceCheckUtils]: 18: Hoare triple {727#(< 1 ~r1~0)} assume ~r1~0 < 2; {726#false} is VALID [2020-07-29 03:20:54,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {726#false} assume ~r1~0 >= 2; {726#false} is VALID [2020-07-29 03:20:54,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {726#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {726#false} is VALID [2020-07-29 03:20:54,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {726#false} check_#res := check_~tmp~1; {726#false} is VALID [2020-07-29 03:20:54,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {726#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {726#false} is VALID [2020-07-29 03:20:54,665 INFO L280 TraceCheckUtils]: 23: Hoare triple {726#false} assume !(0 == assert_~arg % 256); {726#false} is VALID [2020-07-29 03:20:54,665 INFO L280 TraceCheckUtils]: 24: Hoare triple {726#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {726#false} is VALID [2020-07-29 03:20:54,667 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:20:54,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996344248] [2020-07-29 03:20:54,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:54,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:54,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271361680] [2020-07-29 03:20:54,669 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:54,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:20:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:20:54,670 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. cyclomatic complexity: 95 Second operand 5 states. [2020-07-29 03:20:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:55,350 INFO L93 Difference]: Finished difference Result 140 states and 233 transitions. [2020-07-29 03:20:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:20:55,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:20:55,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:55,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 233 transitions. [2020-07-29 03:20:55,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:20:55,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 201 transitions. [2020-07-29 03:20:55,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2020-07-29 03:20:55,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2020-07-29 03:20:55,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 201 transitions. [2020-07-29 03:20:55,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:55,405 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2020-07-29 03:20:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 201 transitions. [2020-07-29 03:20:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-29 03:20:55,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:55,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 201 transitions. Second operand 137 states. [2020-07-29 03:20:55,426 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 201 transitions. Second operand 137 states. [2020-07-29 03:20:55,427 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand 137 states. [2020-07-29 03:20:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:55,433 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2020-07-29 03:20:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2020-07-29 03:20:55,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:55,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:55,440 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states and 201 transitions. [2020-07-29 03:20:55,443 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states and 201 transitions. [2020-07-29 03:20:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:55,449 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2020-07-29 03:20:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2020-07-29 03:20:55,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:55,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:55,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:55,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-29 03:20:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2020-07-29 03:20:55,457 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2020-07-29 03:20:55,457 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2020-07-29 03:20:55,460 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:20:55,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 201 transitions. [2020-07-29 03:20:55,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:20:55,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:55,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:55,468 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] [2020-07-29 03:20:55,468 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:55,470 INFO L794 eck$LassoCheckResult]: Stem: 999#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 893#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 894#L304 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 896#L307-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 900#L317 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 888#L320-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 970#L330 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 940#L333-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 884#L343 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 885#L346-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 936#L356 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 929#L359-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 932#L369 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 920#L372-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 972#L382 assume ~id1~0 != ~id2~0; 983#L383 assume ~id1~0 != ~id3~0; 916#L384 assume ~id2~0 != ~id3~0; 917#L385 assume ~id1~0 >= 0; 967#L386 assume ~id2~0 >= 0; 882#L387 assume ~id3~0 >= 0; 883#L388 assume 0 == ~r1~0; 960#L389 assume 0 == ~r2~0; 961#L390 assume 0 == ~r3~0; 986#L391 assume 0 != init_~r122~0 % 256; 925#L392 assume 0 != init_~r132~0 % 256; 926#L393 assume 0 != init_~r212~0 % 256; 981#L394 assume 0 != init_~r232~0 % 256; 909#L395 assume 0 != init_~r312~0 % 256; 910#L396 assume 0 != init_~r322~0 % 256; 966#L397 assume ~max1~0 == ~id1~0; 874#L398 assume ~max2~0 == ~id2~0; 875#L399 assume ~max3~0 == ~id3~0; 958#L400 assume 0 == ~st1~0; 959#L401 assume 0 == ~st2~0; 985#L402 assume 0 == ~st3~0; 923#L403 assume 0 == ~nl1~0; 924#L404 assume 0 == ~nl2~0; 980#L405 assume 0 == ~nl3~0; 907#L406 assume 0 == ~mode1~0 % 256; 908#L407 assume 0 == ~mode2~0 % 256; 965#L408 assume 0 == ~mode3~0 % 256; 872#L409 assume 0 != ~newmax1~0 % 256; 873#L410 assume 0 != ~newmax2~0 % 256; 956#L411 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 957#L382-1 init_#res := init_~tmp___5~0; 1006#L503 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 1000#L66 assume !(0 == assume_abort_if_not_~cond); 898#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 899#L614-2 [2020-07-29 03:20:55,471 INFO L796 eck$LassoCheckResult]: Loop: 899#L614-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 976#L127 assume !(0 != ~mode1~0 % 256); 941#L155 assume !(~r1~0 < 2); 937#L155-1 ~mode1~0 := 1; 938#L127-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 968#L178 assume !(0 != ~mode2~0 % 256); 1008#L206 assume !(~r2~0 < 2); 951#L206-1 ~mode2~0 := 1; 904#L178-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 963#L229 assume !(0 != ~mode3~0 % 256); 954#L257 assume !(~r3~0 < 2); 944#L257-1 ~mode3~0 := 1; 953#L229-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 891#L511 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 892#L512 assume ~st1~0 + ~nl1~0 <= 1; 947#L513 assume ~st2~0 + ~nl2~0 <= 1; 948#L514 assume ~st3~0 + ~nl3~0 <= 1; 977#L515 assume ~r1~0 >= 2; 901#L519 assume ~r1~0 < 2; 903#L524 assume ~r1~0 >= 2; 945#L529 assume ~r1~0 < 2;check_~tmp~1 := 1; 890#L511-1 check_#res := check_~tmp~1; 990#L559 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 991#L644 assume !(0 == assert_~arg % 256); 982#L639 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 899#L614-2 [2020-07-29 03:20:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2020-07-29 03:20:55,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:55,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260430700] [2020-07-29 03:20:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:55,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:55,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:55,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 2 times [2020-07-29 03:20:55,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:55,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473096333] [2020-07-29 03:20:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:55,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {1288#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {1288#true} is VALID [2020-07-29 03:20:55,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {1288#true} assume !(0 != ~mode1~0 % 256); {1288#true} is VALID [2020-07-29 03:20:55,771 INFO L280 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(~r1~0 < 2); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {1290#(< 1 ~r1~0)} ~mode1~0 := 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,773 INFO L280 TraceCheckUtils]: 4: Hoare triple {1290#(< 1 ~r1~0)} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {1290#(< 1 ~r1~0)} assume !(0 != ~mode2~0 % 256); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,774 INFO L280 TraceCheckUtils]: 6: Hoare triple {1290#(< 1 ~r1~0)} assume !(~r2~0 < 2); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,775 INFO L280 TraceCheckUtils]: 7: Hoare triple {1290#(< 1 ~r1~0)} ~mode2~0 := 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {1290#(< 1 ~r1~0)} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {1290#(< 1 ~r1~0)} assume !(0 != ~mode3~0 % 256); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {1290#(< 1 ~r1~0)} assume !(~r3~0 < 2); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,778 INFO L280 TraceCheckUtils]: 11: Hoare triple {1290#(< 1 ~r1~0)} ~mode3~0 := 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {1290#(< 1 ~r1~0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,780 INFO L280 TraceCheckUtils]: 13: Hoare triple {1290#(< 1 ~r1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {1290#(< 1 ~r1~0)} assume ~st1~0 + ~nl1~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {1290#(< 1 ~r1~0)} assume ~st2~0 + ~nl2~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {1290#(< 1 ~r1~0)} assume ~st3~0 + ~nl3~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {1290#(< 1 ~r1~0)} assume ~r1~0 >= 2; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:20:55,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {1290#(< 1 ~r1~0)} assume ~r1~0 < 2; {1289#false} is VALID [2020-07-29 03:20:55,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {1289#false} assume ~r1~0 >= 2; {1289#false} is VALID [2020-07-29 03:20:55,784 INFO L280 TraceCheckUtils]: 20: Hoare triple {1289#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {1289#false} is VALID [2020-07-29 03:20:55,784 INFO L280 TraceCheckUtils]: 21: Hoare triple {1289#false} check_#res := check_~tmp~1; {1289#false} is VALID [2020-07-29 03:20:55,785 INFO L280 TraceCheckUtils]: 22: Hoare triple {1289#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1289#false} is VALID [2020-07-29 03:20:55,785 INFO L280 TraceCheckUtils]: 23: Hoare triple {1289#false} assume !(0 == assert_~arg % 256); {1289#false} is VALID [2020-07-29 03:20:55,785 INFO L280 TraceCheckUtils]: 24: Hoare triple {1289#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1289#false} is VALID [2020-07-29 03:20:55,787 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:20:55,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473096333] [2020-07-29 03:20:55,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:55,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:55,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173867097] [2020-07-29 03:20:55,789 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:55,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:20:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:20:55,790 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. cyclomatic complexity: 65 Second operand 3 states. [2020-07-29 03:20:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:56,101 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2020-07-29 03:20:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:20:56,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:56,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:56,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. [2020-07-29 03:20:56,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2020-07-29 03:20:56,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 287 transitions. [2020-07-29 03:20:56,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2020-07-29 03:20:56,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2020-07-29 03:20:56,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 287 transitions. [2020-07-29 03:20:56,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:56,151 INFO L688 BuchiCegarLoop]: Abstraction has 194 states and 287 transitions. [2020-07-29 03:20:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 287 transitions. [2020-07-29 03:20:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-07-29 03:20:56,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:56,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states and 287 transitions. Second operand 194 states. [2020-07-29 03:20:56,173 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states and 287 transitions. Second operand 194 states. [2020-07-29 03:20:56,173 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 194 states. [2020-07-29 03:20:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:56,180 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2020-07-29 03:20:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2020-07-29 03:20:56,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:56,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:56,182 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 194 states and 287 transitions. [2020-07-29 03:20:56,182 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 194 states and 287 transitions. [2020-07-29 03:20:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:56,189 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2020-07-29 03:20:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2020-07-29 03:20:56,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:56,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:56,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:56,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-29 03:20:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2020-07-29 03:20:56,197 INFO L711 BuchiCegarLoop]: Abstraction has 194 states and 287 transitions. [2020-07-29 03:20:56,198 INFO L591 BuchiCegarLoop]: Abstraction has 194 states and 287 transitions. [2020-07-29 03:20:56,198 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:20:56,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. [2020-07-29 03:20:56,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2020-07-29 03:20:56,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:56,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:56,203 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] [2020-07-29 03:20:56,203 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] [2020-07-29 03:20:56,204 INFO L794 eck$LassoCheckResult]: Stem: 1614#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 1506#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 1507#L304 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1509#L307-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1511#L317 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1501#L320-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1581#L330 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 1552#L333-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1497#L343 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 1498#L346-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1548#L356 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 1541#L359-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1544#L369 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 1531#L372-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1583#L382 assume ~id1~0 != ~id2~0; 1597#L383 assume ~id1~0 != ~id3~0; 1523#L384 assume ~id2~0 != ~id3~0; 1524#L385 assume ~id1~0 >= 0; 1578#L386 assume ~id2~0 >= 0; 1492#L387 assume ~id3~0 >= 0; 1493#L388 assume 0 == ~r1~0; 1571#L389 assume 0 == ~r2~0; 1572#L390 assume 0 == ~r3~0; 1601#L391 assume 0 != init_~r122~0 % 256; 1537#L392 assume 0 != init_~r132~0 % 256; 1538#L393 assume 0 != init_~r212~0 % 256; 1596#L394 assume 0 != init_~r232~0 % 256; 1521#L395 assume 0 != init_~r312~0 % 256; 1522#L396 assume 0 != init_~r322~0 % 256; 1577#L397 assume ~max1~0 == ~id1~0; 1487#L398 assume ~max2~0 == ~id2~0; 1488#L399 assume ~max3~0 == ~id3~0; 1569#L400 assume 0 == ~st1~0; 1570#L401 assume 0 == ~st2~0; 1600#L402 assume 0 == ~st3~0; 1535#L403 assume 0 == ~nl1~0; 1536#L404 assume 0 == ~nl2~0; 1595#L405 assume 0 == ~nl3~0; 1519#L406 assume 0 == ~mode1~0 % 256; 1520#L407 assume 0 == ~mode2~0 % 256; 1576#L408 assume 0 == ~mode3~0 % 256; 1485#L409 assume 0 != ~newmax1~0 % 256; 1486#L410 assume 0 != ~newmax2~0 % 256; 1567#L411 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 1568#L382-1 init_#res := init_~tmp___5~0; 1621#L503 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 1615#L66 assume !(0 == assume_abort_if_not_~cond); 1512#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1513#L614-2 [2020-07-29 03:20:56,204 INFO L796 eck$LassoCheckResult]: Loop: 1513#L614-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1628#L127 assume !(0 != ~mode1~0 % 256); 1627#L155 assume ~r1~0 < 2; 1626#L156 assume !(0 != ~ep12~0 % 256); 1518#L156-1 assume !(0 != ~ep13~0 % 256); 1585#L155-1 ~mode1~0 := 1; 1592#L127-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1669#L178 assume !(0 != ~mode2~0 % 256); 1670#L206 assume !(~r2~0 < 2); 1659#L206-1 ~mode2~0 := 1; 1656#L178-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1653#L229 assume !(0 != ~mode3~0 % 256); 1644#L257 assume !(~r3~0 < 2); 1640#L257-1 ~mode3~0 := 1; 1639#L229-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1638#L511 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1637#L512 assume ~st1~0 + ~nl1~0 <= 1; 1636#L513 assume ~st2~0 + ~nl2~0 <= 1; 1635#L514 assume ~st3~0 + ~nl3~0 <= 1; 1634#L515 assume !(~r1~0 >= 2); 1586#L518 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1587#L519 assume ~r1~0 < 2; 1630#L524 assume !(~r1~0 >= 2); 1623#L528 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1624#L529 assume ~r1~0 < 2;check_~tmp~1 := 1; 1633#L511-1 check_#res := check_~tmp~1; 1632#L559 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1631#L644 assume !(0 == assert_~arg % 256); 1629#L639 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 1513#L614-2 [2020-07-29 03:20:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2020-07-29 03:20:56,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:56,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680738581] [2020-07-29 03:20:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:56,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:56,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:56,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1983288549, now seen corresponding path program 1 times [2020-07-29 03:20:56,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:56,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798452009] [2020-07-29 03:20:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:56,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:56,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:56,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2100705208, now seen corresponding path program 1 times [2020-07-29 03:20:56,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:56,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978215263] [2020-07-29 03:20:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:56,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {2074#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; {2074#true} is VALID [2020-07-29 03:20:56,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {2074#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {2074#true} is VALID [2020-07-29 03:20:56,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {2074#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2074#true} is VALID [2020-07-29 03:20:56,439 INFO L280 TraceCheckUtils]: 3: Hoare triple {2074#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2074#true} is VALID [2020-07-29 03:20:56,440 INFO L280 TraceCheckUtils]: 4: Hoare triple {2074#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2074#true} is VALID [2020-07-29 03:20:56,440 INFO L280 TraceCheckUtils]: 5: Hoare triple {2074#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2074#true} is VALID [2020-07-29 03:20:56,440 INFO L280 TraceCheckUtils]: 6: Hoare triple {2074#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {2074#true} is VALID [2020-07-29 03:20:56,441 INFO L280 TraceCheckUtils]: 7: Hoare triple {2074#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2074#true} is VALID [2020-07-29 03:20:56,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {2074#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {2074#true} is VALID [2020-07-29 03:20:56,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {2074#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2074#true} is VALID [2020-07-29 03:20:56,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {2074#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {2074#true} is VALID [2020-07-29 03:20:56,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {2074#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2074#true} is VALID [2020-07-29 03:20:56,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {2074#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {2074#true} is VALID [2020-07-29 03:20:56,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {2074#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2074#true} is VALID [2020-07-29 03:20:56,442 INFO L280 TraceCheckUtils]: 14: Hoare triple {2074#true} assume ~id1~0 != ~id2~0; {2074#true} is VALID [2020-07-29 03:20:56,442 INFO L280 TraceCheckUtils]: 15: Hoare triple {2074#true} assume ~id1~0 != ~id3~0; {2074#true} is VALID [2020-07-29 03:20:56,443 INFO L280 TraceCheckUtils]: 16: Hoare triple {2074#true} assume ~id2~0 != ~id3~0; {2074#true} is VALID [2020-07-29 03:20:56,443 INFO L280 TraceCheckUtils]: 17: Hoare triple {2074#true} assume ~id1~0 >= 0; {2074#true} is VALID [2020-07-29 03:20:56,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {2074#true} assume ~id2~0 >= 0; {2074#true} is VALID [2020-07-29 03:20:56,444 INFO L280 TraceCheckUtils]: 19: Hoare triple {2074#true} assume ~id3~0 >= 0; {2074#true} is VALID [2020-07-29 03:20:56,444 INFO L280 TraceCheckUtils]: 20: Hoare triple {2074#true} assume 0 == ~r1~0; {2074#true} is VALID [2020-07-29 03:20:56,446 INFO L280 TraceCheckUtils]: 21: Hoare triple {2074#true} assume 0 == ~r2~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,446 INFO L280 TraceCheckUtils]: 22: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~r3~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,447 INFO L280 TraceCheckUtils]: 23: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != init_~r122~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,447 INFO L280 TraceCheckUtils]: 24: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != init_~r132~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,448 INFO L280 TraceCheckUtils]: 25: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != init_~r212~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,449 INFO L280 TraceCheckUtils]: 26: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != init_~r232~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,449 INFO L280 TraceCheckUtils]: 27: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != init_~r312~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,450 INFO L280 TraceCheckUtils]: 28: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != init_~r322~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,450 INFO L280 TraceCheckUtils]: 29: Hoare triple {2076#(= 0 ~r2~0)} assume ~max1~0 == ~id1~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,451 INFO L280 TraceCheckUtils]: 30: Hoare triple {2076#(= 0 ~r2~0)} assume ~max2~0 == ~id2~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,452 INFO L280 TraceCheckUtils]: 31: Hoare triple {2076#(= 0 ~r2~0)} assume ~max3~0 == ~id3~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,452 INFO L280 TraceCheckUtils]: 32: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~st1~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,453 INFO L280 TraceCheckUtils]: 33: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~st2~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,453 INFO L280 TraceCheckUtils]: 34: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~st3~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,454 INFO L280 TraceCheckUtils]: 35: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~nl1~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,455 INFO L280 TraceCheckUtils]: 36: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~nl2~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,455 INFO L280 TraceCheckUtils]: 37: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~nl3~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,456 INFO L280 TraceCheckUtils]: 38: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~mode1~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,456 INFO L280 TraceCheckUtils]: 39: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~mode2~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,457 INFO L280 TraceCheckUtils]: 40: Hoare triple {2076#(= 0 ~r2~0)} assume 0 == ~mode3~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,458 INFO L280 TraceCheckUtils]: 41: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != ~newmax1~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,458 INFO L280 TraceCheckUtils]: 42: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != ~newmax2~0 % 256; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,459 INFO L280 TraceCheckUtils]: 43: Hoare triple {2076#(= 0 ~r2~0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,459 INFO L280 TraceCheckUtils]: 44: Hoare triple {2076#(= 0 ~r2~0)} init_#res := init_~tmp___5~0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,460 INFO L280 TraceCheckUtils]: 45: Hoare triple {2076#(= 0 ~r2~0)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,461 INFO L280 TraceCheckUtils]: 46: Hoare triple {2076#(= 0 ~r2~0)} assume !(0 == assume_abort_if_not_~cond); {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,461 INFO L280 TraceCheckUtils]: 47: Hoare triple {2076#(= 0 ~r2~0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,462 INFO L280 TraceCheckUtils]: 48: Hoare triple {2076#(= 0 ~r2~0)} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,462 INFO L280 TraceCheckUtils]: 49: Hoare triple {2076#(= 0 ~r2~0)} assume !(0 != ~mode1~0 % 256); {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,463 INFO L280 TraceCheckUtils]: 50: Hoare triple {2076#(= 0 ~r2~0)} assume ~r1~0 < 2; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,463 INFO L280 TraceCheckUtils]: 51: Hoare triple {2076#(= 0 ~r2~0)} assume !(0 != ~ep12~0 % 256); {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,464 INFO L280 TraceCheckUtils]: 52: Hoare triple {2076#(= 0 ~r2~0)} assume !(0 != ~ep13~0 % 256); {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,464 INFO L280 TraceCheckUtils]: 53: Hoare triple {2076#(= 0 ~r2~0)} ~mode1~0 := 1; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,465 INFO L280 TraceCheckUtils]: 54: Hoare triple {2076#(= 0 ~r2~0)} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,466 INFO L280 TraceCheckUtils]: 55: Hoare triple {2076#(= 0 ~r2~0)} assume !(0 != ~mode2~0 % 256); {2076#(= 0 ~r2~0)} is VALID [2020-07-29 03:20:56,466 INFO L280 TraceCheckUtils]: 56: Hoare triple {2076#(= 0 ~r2~0)} assume !(~r2~0 < 2); {2075#false} is VALID [2020-07-29 03:20:56,467 INFO L280 TraceCheckUtils]: 57: Hoare triple {2075#false} ~mode2~0 := 1; {2075#false} is VALID [2020-07-29 03:20:56,467 INFO L280 TraceCheckUtils]: 58: Hoare triple {2075#false} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {2075#false} is VALID [2020-07-29 03:20:56,467 INFO L280 TraceCheckUtils]: 59: Hoare triple {2075#false} assume !(0 != ~mode3~0 % 256); {2075#false} is VALID [2020-07-29 03:20:56,467 INFO L280 TraceCheckUtils]: 60: Hoare triple {2075#false} assume !(~r3~0 < 2); {2075#false} is VALID [2020-07-29 03:20:56,467 INFO L280 TraceCheckUtils]: 61: Hoare triple {2075#false} ~mode3~0 := 1; {2075#false} is VALID [2020-07-29 03:20:56,468 INFO L280 TraceCheckUtils]: 62: Hoare triple {2075#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2075#false} is VALID [2020-07-29 03:20:56,468 INFO L280 TraceCheckUtils]: 63: Hoare triple {2075#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2075#false} is VALID [2020-07-29 03:20:56,468 INFO L280 TraceCheckUtils]: 64: Hoare triple {2075#false} assume ~st1~0 + ~nl1~0 <= 1; {2075#false} is VALID [2020-07-29 03:20:56,469 INFO L280 TraceCheckUtils]: 65: Hoare triple {2075#false} assume ~st2~0 + ~nl2~0 <= 1; {2075#false} is VALID [2020-07-29 03:20:56,469 INFO L280 TraceCheckUtils]: 66: Hoare triple {2075#false} assume ~st3~0 + ~nl3~0 <= 1; {2075#false} is VALID [2020-07-29 03:20:56,469 INFO L280 TraceCheckUtils]: 67: Hoare triple {2075#false} assume !(~r1~0 >= 2); {2075#false} is VALID [2020-07-29 03:20:56,469 INFO L280 TraceCheckUtils]: 68: Hoare triple {2075#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2075#false} is VALID [2020-07-29 03:20:56,469 INFO L280 TraceCheckUtils]: 69: Hoare triple {2075#false} assume ~r1~0 < 2; {2075#false} is VALID [2020-07-29 03:20:56,470 INFO L280 TraceCheckUtils]: 70: Hoare triple {2075#false} assume !(~r1~0 >= 2); {2075#false} is VALID [2020-07-29 03:20:56,470 INFO L280 TraceCheckUtils]: 71: Hoare triple {2075#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2075#false} is VALID [2020-07-29 03:20:56,470 INFO L280 TraceCheckUtils]: 72: Hoare triple {2075#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {2075#false} is VALID [2020-07-29 03:20:56,470 INFO L280 TraceCheckUtils]: 73: Hoare triple {2075#false} check_#res := check_~tmp~1; {2075#false} is VALID [2020-07-29 03:20:56,471 INFO L280 TraceCheckUtils]: 74: Hoare triple {2075#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2075#false} is VALID [2020-07-29 03:20:56,471 INFO L280 TraceCheckUtils]: 75: Hoare triple {2075#false} assume !(0 == assert_~arg % 256); {2075#false} is VALID [2020-07-29 03:20:56,471 INFO L280 TraceCheckUtils]: 76: Hoare triple {2075#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {2075#false} is VALID [2020-07-29 03:20:56,477 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:20:56,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978215263] [2020-07-29 03:20:56,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:56,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:56,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640119523] [2020-07-29 03:20:56,779 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2020-07-29 03:20:57,092 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2020-07-29 03:20:57,110 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:20:57,111 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:20:57,111 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:20:57,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:20:57,112 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:20:57,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:57,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:20:57,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:20:57,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:20:57,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:20:57,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:20:57,193 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:20:57,204 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:20:57,212 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:20:57,217 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:20:57,238 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:20:57,243 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:20:57,251 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:20:57,255 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:20:57,259 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:20:57,264 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:20:57,268 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:20:57,272 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:20:57,277 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:20:57,286 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:20:57,290 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:20:57,293 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:20:57,303 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:20:57,315 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:20:57,323 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:20:57,327 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:20:57,355 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:20:57,359 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:20:57,364 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:20:57,367 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:20:57,371 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:20:57,378 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:20:57,384 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:20:57,388 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:20:57,392 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:20:57,396 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:20:58,437 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:20:58,438 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:20:58,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:20:58,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:20:58,460 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:20:58,460 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:20:58,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:20:58,487 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-07-29 03:20:58,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:20:58,548 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:58,684 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:20:58,686 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:20:58,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:20:58,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:20:58,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:20:58,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:20:58,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:58,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:20:58,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:20:58,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:20:58,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:20:58,687 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:20:58,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:20:58,735 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:20:58,744 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:20:58,749 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:20:58,762 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:20:58,769 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:20:58,774 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:20:58,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:20:58,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:20:58,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:20:58,796 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:20:58,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:20:58,805 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:20:58,808 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:20:58,812 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:20:58,816 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:20:58,823 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:20:58,829 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:20:58,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:20:58,841 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:20:58,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:20:58,848 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:20:58,856 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:20:58,860 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:20:58,864 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:20:58,870 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:20:58,873 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:20:58,877 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:20:58,881 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:20:58,912 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:20:59,864 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:20:59,872 INFO L489 LassoAnalysis]: Using template 'affine'. 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:20:59,876 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:20:59,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:59,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:59,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:59,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:59,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:59,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:59,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:59,885 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:20:59,908 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:20:59,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:59,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:59,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:59,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:59,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:59,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:59,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:59,914 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:20:59,938 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:20:59,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:59,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:59,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:59,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:59,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:59,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:59,947 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:20:59,975 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:20:59,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:59,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:59,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:59,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:59,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:59,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:59,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:59,983 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:21:00,007 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:21:00,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,011 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:21:00,036 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:21:00,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:21:00,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:21:00,044 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:21:00,069 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:21:00,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,075 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) [2020-07-29 03:21:00,123 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:21:00,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,128 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:21:00,155 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:21:00,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,162 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:21:00,183 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:21:00,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,187 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) [2020-07-29 03:21:00,209 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:21:00,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,215 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,240 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:21:00,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,243 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:21:00,270 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:21:00,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,275 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:21:00,297 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:21:00,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,300 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,325 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:21:00,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:21:00,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:21:00,331 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,353 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:21:00,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,358 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,381 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:21:00,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:00,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:00,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:00,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:00,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:00,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:00,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:00,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:21:00,398 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:21:00,398 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:00,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:21:00,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:21:00,410 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:21:00,410 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2020-07-29 03:21:00,443 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:21:00,454 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 2;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "~mode1~0 := 1;" "havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38;" [2020-07-29 03:21:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:00,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:21:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:00,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:21:00,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {2077#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;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; {2077#unseeded} is VALID [2020-07-29 03:21:00,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {2077#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {2077#unseeded} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {2077#unseeded} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2077#unseeded} is VALID [2020-07-29 03:21:00,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {2077#unseeded} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,690 INFO L280 TraceCheckUtils]: 5: Hoare triple {2077#unseeded} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2077#unseeded} is VALID [2020-07-29 03:21:00,690 INFO L280 TraceCheckUtils]: 6: Hoare triple {2077#unseeded} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {2077#unseeded} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2077#unseeded} is VALID [2020-07-29 03:21:00,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {2077#unseeded} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {2077#unseeded} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2077#unseeded} is VALID [2020-07-29 03:21:00,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {2077#unseeded} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {2077#unseeded} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2077#unseeded} is VALID [2020-07-29 03:21:00,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {2077#unseeded} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {2077#unseeded} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2077#unseeded} is VALID [2020-07-29 03:21:00,700 INFO L280 TraceCheckUtils]: 14: Hoare triple {2077#unseeded} assume ~id1~0 != ~id2~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,701 INFO L280 TraceCheckUtils]: 15: Hoare triple {2077#unseeded} assume ~id1~0 != ~id3~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,702 INFO L280 TraceCheckUtils]: 16: Hoare triple {2077#unseeded} assume ~id2~0 != ~id3~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,702 INFO L280 TraceCheckUtils]: 17: Hoare triple {2077#unseeded} assume ~id1~0 >= 0; {2077#unseeded} is VALID [2020-07-29 03:21:00,703 INFO L280 TraceCheckUtils]: 18: Hoare triple {2077#unseeded} assume ~id2~0 >= 0; {2077#unseeded} is VALID [2020-07-29 03:21:00,704 INFO L280 TraceCheckUtils]: 19: Hoare triple {2077#unseeded} assume ~id3~0 >= 0; {2077#unseeded} is VALID [2020-07-29 03:21:00,704 INFO L280 TraceCheckUtils]: 20: Hoare triple {2077#unseeded} assume 0 == ~r1~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,705 INFO L280 TraceCheckUtils]: 21: Hoare triple {2077#unseeded} assume 0 == ~r2~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,712 INFO L280 TraceCheckUtils]: 22: Hoare triple {2077#unseeded} assume 0 == ~r3~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,713 INFO L280 TraceCheckUtils]: 23: Hoare triple {2077#unseeded} assume 0 != init_~r122~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,714 INFO L280 TraceCheckUtils]: 24: Hoare triple {2077#unseeded} assume 0 != init_~r132~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,714 INFO L280 TraceCheckUtils]: 25: Hoare triple {2077#unseeded} assume 0 != init_~r212~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,716 INFO L280 TraceCheckUtils]: 26: Hoare triple {2077#unseeded} assume 0 != init_~r232~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {2077#unseeded} assume 0 != init_~r312~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,717 INFO L280 TraceCheckUtils]: 28: Hoare triple {2077#unseeded} assume 0 != init_~r322~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {2077#unseeded} assume ~max1~0 == ~id1~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,719 INFO L280 TraceCheckUtils]: 30: Hoare triple {2077#unseeded} assume ~max2~0 == ~id2~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {2077#unseeded} assume ~max3~0 == ~id3~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,720 INFO L280 TraceCheckUtils]: 32: Hoare triple {2077#unseeded} assume 0 == ~st1~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,721 INFO L280 TraceCheckUtils]: 33: Hoare triple {2077#unseeded} assume 0 == ~st2~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,722 INFO L280 TraceCheckUtils]: 34: Hoare triple {2077#unseeded} assume 0 == ~st3~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,722 INFO L280 TraceCheckUtils]: 35: Hoare triple {2077#unseeded} assume 0 == ~nl1~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,723 INFO L280 TraceCheckUtils]: 36: Hoare triple {2077#unseeded} assume 0 == ~nl2~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,724 INFO L280 TraceCheckUtils]: 37: Hoare triple {2077#unseeded} assume 0 == ~nl3~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,725 INFO L280 TraceCheckUtils]: 38: Hoare triple {2077#unseeded} assume 0 == ~mode1~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,725 INFO L280 TraceCheckUtils]: 39: Hoare triple {2077#unseeded} assume 0 == ~mode2~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,726 INFO L280 TraceCheckUtils]: 40: Hoare triple {2077#unseeded} assume 0 == ~mode3~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,727 INFO L280 TraceCheckUtils]: 41: Hoare triple {2077#unseeded} assume 0 != ~newmax1~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,727 INFO L280 TraceCheckUtils]: 42: Hoare triple {2077#unseeded} assume 0 != ~newmax2~0 % 256; {2077#unseeded} is VALID [2020-07-29 03:21:00,728 INFO L280 TraceCheckUtils]: 43: Hoare triple {2077#unseeded} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; {2077#unseeded} is VALID [2020-07-29 03:21:00,729 INFO L280 TraceCheckUtils]: 44: Hoare triple {2077#unseeded} init_#res := init_~tmp___5~0; {2077#unseeded} is VALID [2020-07-29 03:21:00,729 INFO L280 TraceCheckUtils]: 45: Hoare triple {2077#unseeded} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {2077#unseeded} is VALID [2020-07-29 03:21:00,730 INFO L280 TraceCheckUtils]: 46: Hoare triple {2077#unseeded} assume !(0 == assume_abort_if_not_~cond); {2077#unseeded} is VALID [2020-07-29 03:21:00,730 INFO L280 TraceCheckUtils]: 47: Hoare triple {2077#unseeded} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {2077#unseeded} is VALID [2020-07-29 03:21:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:00,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:21:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:00,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:21:00,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {2080#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode1~0 % 256); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~ep12~0 % 256); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~ep13~0 % 256); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode1~0 := 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode2~0 % 256); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r2~0 < 2); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,864 INFO L280 TraceCheckUtils]: 9: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode2~0 := 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,865 INFO L280 TraceCheckUtils]: 10: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,866 INFO L280 TraceCheckUtils]: 11: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode3~0 % 256); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r3~0 < 2); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,867 INFO L280 TraceCheckUtils]: 13: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode3~0 := 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,870 INFO L280 TraceCheckUtils]: 15: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,871 INFO L280 TraceCheckUtils]: 16: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~nl1~0 <= 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,872 INFO L280 TraceCheckUtils]: 17: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st2~0 + ~nl2~0 <= 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,873 INFO L280 TraceCheckUtils]: 18: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st3~0 + ~nl3~0 <= 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,874 INFO L280 TraceCheckUtils]: 19: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 2); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,876 INFO L280 TraceCheckUtils]: 20: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,877 INFO L280 TraceCheckUtils]: 21: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,881 INFO L280 TraceCheckUtils]: 22: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 2); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,882 INFO L280 TraceCheckUtils]: 23: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,884 INFO L280 TraceCheckUtils]: 24: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2;check_~tmp~1 := 1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,887 INFO L280 TraceCheckUtils]: 25: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} check_#res := check_~tmp~1; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,889 INFO L280 TraceCheckUtils]: 26: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,890 INFO L280 TraceCheckUtils]: 27: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 == assert_~arg % 256); {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:00,895 INFO L280 TraceCheckUtils]: 28: Hoare triple {2236#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {2090#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))) unseeded)} is VALID [2020-07-29 03:21:00,896 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:21:00,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:21:00,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:00,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:00,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:00,947 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:21:00,948 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 287 transitions. cyclomatic complexity: 94 Second operand 3 states. [2020-07-29 03:21:01,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 287 transitions. cyclomatic complexity: 94. Second operand 3 states. Result 327 states and 496 transitions. Complement of second has 4 states. [2020-07-29 03:21:01,415 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:21:01,415 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:21:01,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:21:01,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:01,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:01,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:21:01,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:21:01,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:01,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:01,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 496 transitions. [2020-07-29 03:21:01,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:01,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:21:01,437 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:21:01,553 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 134 examples of accepted words. [2020-07-29 03:21:01,553 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:21:01,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:21:01,558 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:21:01,558 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 327 states and 496 transitions. cyclomatic complexity: 170 [2020-07-29 03:21:01,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 496 transitions. cyclomatic complexity: 170 [2020-07-29 03:21:01,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:21:01,559 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:21:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 327 letters. Loop has 327 letters. [2020-07-29 03:21:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 327 letters. Loop has 327 letters. [2020-07-29 03:21:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 327 letters. Loop has 327 letters. [2020-07-29 03:21:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:21:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:21:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:21:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:21:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:21:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:21:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 30 letters. [2020-07-29 03:21:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 30 letters. [2020-07-29 03:21:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 30 letters. [2020-07-29 03:21:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:01,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:21:01,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:21:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:21:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:21:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:21:01,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:21:01,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 77 letters. Loop has 27 letters. [2020-07-29 03:21:01,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 27 letters. [2020-07-29 03:21:01,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 77 letters. Loop has 27 letters. [2020-07-29 03:21:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:21:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:21:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:21:01,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:21:01,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:21:01,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:21:01,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:21:01,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:21:01,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:21:01,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:21:01,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:21:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:21:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:21:01,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:21:01,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:21:01,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:01,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:01,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:01,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:21:01,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:21:01,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:21:01,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:21:01,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:21:01,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:21:01,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:21:01,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:21:01,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:21:01,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:01,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:01,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:01,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:21:01,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:21:01,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:21:01,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:01,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:01,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:01,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:21:01,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:21:01,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:21:01,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:21:01,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:21:01,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:21:01,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:21:01,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:21:01,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:21:01,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:21:01,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:21:01,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:21:01,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:21:01,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:21:01,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:21:01,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:01,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:01,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:01,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:21:01,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:21:01,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:21:01,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 27 letters. [2020-07-29 03:21:01,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 27 letters. [2020-07-29 03:21:01,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 27 letters. [2020-07-29 03:21:01,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:21:01,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:21:01,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:21:01,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:21:01,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:21:01,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:21:01,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:01,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:01,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:01,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:01,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:01,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:01,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:21:01,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:21:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:21:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:21:01,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:21:01,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:21:01,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:01,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:01,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:01,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:01,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:01,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:01,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:21:01,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:21:01,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:21:01,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:21:01,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:21:01,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:21:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:21:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:21:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:21:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:21:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:21:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:21:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:21:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:21:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:21:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:01,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:01,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:21:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:21:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:21:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:21:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:21:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:21:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:21:01,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:21:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:21:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:01,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:01,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:21:01,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:21:01,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:21:01,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:21:01,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:21:01,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:21:01,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:21:01,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:21:01,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:21:01,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:21:01,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:21:01,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:21:01,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:21:01,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:21:01,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:21:01,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:21:01,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:21:01,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:21:01,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:21:01,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:21:01,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:21:01,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:21:01,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:21:01,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:21:01,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:21:01,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:21:01,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:21:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:21:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:21:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:21:01,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:21:01,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:21:01,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:21:01,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:21:01,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:21:01,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:21:01,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:21:01,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:21:01,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:21:01,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:21:01,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:21:01,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:21:01,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:21:01,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:21:01,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:21:01,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:21:01,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:21:01,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:21:01,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:21:01,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:21:01,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:21:01,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:21:01,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:21:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:21:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:21:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:21:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:21:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:21:01,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:21:01,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:21:01,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:01,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:21:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:21:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:21:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:21:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:21:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:21:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:01,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:01,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:01,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:01,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:01,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:01,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:01,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:01,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:21:01,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:21:01,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:21:01,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:01,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:01,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:01,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:01,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:01,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:01,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:01,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:21:01,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:21:01,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:21:01,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:21:01,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:21:01,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:21:01,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:01,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:01,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:01,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:21:01,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:21:01,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:21:01,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:01,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:01,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:01,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:21:01,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:21:01,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:21:01,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:21:01,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:21:01,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:21:01,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:21:01,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:21:01,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:21:01,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:01,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:01,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:01,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:21:01,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:21:01,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:21:01,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2020-07-29 03:21:01,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 32 letters. [2020-07-29 03:21:01,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2020-07-29 03:21:01,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:01,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:01,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:01,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:01,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:01,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:01,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:01,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:01,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:01,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:01,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:01,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:01,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:01,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:21:01,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:21:01,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:21:01,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:21:01,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:21:01,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:21:01,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:01,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:01,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:01,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:01,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:21:01,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:21:01,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:21:01,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:01,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:01,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:01,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:01,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:01,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:01,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:01,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:01,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:01,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:01,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:01,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:01,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:01,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:01,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:01,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:01,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:01,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:01,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:21:01,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:21:01,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:21:01,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:21:01,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:21:01,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:21:01,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:21:01,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:21:01,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:21:01,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:21:01,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:21:01,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:21:01,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:21:01,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:21:01,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:21:01,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:21:01,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:21:01,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:21:01,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:21:01,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:21:01,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:21:01,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:01,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:01,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:01,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:21:01,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:21:01,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:21:01,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:21:01,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:21:01,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:21:01,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:01,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:01,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:21:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:21:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:21:01,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:21:01,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:21:01,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:21:01,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:01,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:01,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:01,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:21:01,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:21:01,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:21:01,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:01,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:01,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:01,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,780 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:21:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:21:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-29 03:21:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:21:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 58 letters. [2020-07-29 03:21:01,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:01,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 496 transitions. cyclomatic complexity: 170 [2020-07-29 03:21:01,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:01,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 0 states and 0 transitions. [2020-07-29 03:21:01,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:21:01,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:21:01,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:21:01,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:01,800 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:01,800 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:01,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:21:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:21:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:21:01,802 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:21:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:01,802 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:21:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:21:01,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:21:01,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:01,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:21:01,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:01,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:21:01,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:21:01,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:21:01,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:21:01,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:01,894 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:01,894 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:01,894 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:01,894 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:21:01,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:21:01,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:01,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:21:01,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:21:01 BoogieIcfgContainer [2020-07-29 03:21:01,901 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:21:01,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:21:01,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:21:01,903 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:21:01,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:52" (3/4) ... [2020-07-29 03:21:01,906 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:21:01,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:21:01,909 INFO L168 Benchmark]: Toolchain (without parser) took 11093.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 958.9 MB in the beginning and 986.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 302.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:01,910 INFO L168 Benchmark]: CDTParser took 0.27 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:21:01,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:01,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:21:01,915 INFO L168 Benchmark]: Boogie Preprocessor took 53.40 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:01,916 INFO L168 Benchmark]: RCFGBuilder took 1117.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.6 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:01,917 INFO L168 Benchmark]: BuchiAutomizer took 9216.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 986.4 MB in the end (delta: 45.4 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:01,917 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.4 GB. Free memory is still 986.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:21:01,927 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.27 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 586.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.40 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1117.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.6 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9216.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 986.4 MB in the end (delta: 45.4 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.4 GB. Free memory is still 986.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.1s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 194 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 868 SDtfs, 373 SDslu, 1671 SDs, 0 SdLazy, 46 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...