./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.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_floodmax.3.4.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 36af3e8ff1c07cad68d63a2859c127e07e8622cb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:14:52,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:14:52,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:14:52,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:14:52,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:14:52,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:14:52,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:14:52,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:14:52,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:14:52,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:14:52,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:14:52,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:14:52,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:14:52,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:14:52,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:14:52,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:14:52,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:14:52,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:14:52,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:14:52,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:14:52,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:14:52,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:14:52,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:14:52,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:14:52,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:14:52,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:14:52,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:14:52,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:14:52,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:14:52,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:14:52,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:14:52,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:14:52,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:14:52,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:14:52,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:14:52,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:14:52,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:14:52,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:14:52,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:14:52,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:14:52,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:14:52,534 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:14:52,577 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:14:52,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:14:52,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:14:52,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:14:52,582 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:14:52,583 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:14:52,583 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:14:52,583 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:14:52,583 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:14:52,584 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:14:52,584 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:14:52,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:14:52,584 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:14:52,584 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:14:52,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:14:52,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:14:52,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:14:52,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:14:52,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:14:52,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:14:52,589 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:14:52,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:14:52,589 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:14:52,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:14:52,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:14:52,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:14:52,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:14:52,591 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:14:52,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:14:52,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:14:52,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:14:52,594 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:14:52,595 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:14:52,596 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 -> 36af3e8ff1c07cad68d63a2859c127e07e8622cb [2020-07-29 03:14:52,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:14:52,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:14:52,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:14:52,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:14:52,930 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:14:52,931 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-07-29 03:14:52,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e36cfd/f3490b9b67ac4813a806126f158df08a/FLAG64d7401d2 [2020-07-29 03:14:53,479 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:14:53,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-07-29 03:14:53,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e36cfd/f3490b9b67ac4813a806126f158df08a/FLAG64d7401d2 [2020-07-29 03:14:53,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e36cfd/f3490b9b67ac4813a806126f158df08a [2020-07-29 03:14:53,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:14:53,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:14:53,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:14:53,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:14:53,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:14:53,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:14:53" (1/1) ... [2020-07-29 03:14:53,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ac154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:53, skipping insertion in model container [2020-07-29 03:14:53,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:14:53" (1/1) ... [2020-07-29 03:14:53,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:14:53,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:14:54,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:14:54,152 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:14:54,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:14:54,312 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:14:54,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54 WrapperNode [2020-07-29 03:14:54,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:14:54,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:14:54,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:14:54,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:14:54,327 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:14:54" (1/1) ... [2020-07-29 03:14:54,339 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:14:54" (1/1) ... [2020-07-29 03:14:54,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:14:54,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:14:54,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:14:54,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:14:54,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (1/1) ... [2020-07-29 03:14:54,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:14:54,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:14:54,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:14:54,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:14:54,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (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:14:54,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:14:54,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:14:55,644 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:14:55,646 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-29 03:14:55,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:14:55 BoogieIcfgContainer [2020-07-29 03:14:55,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:14:55,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:14:55,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:14:55,664 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:14:55,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:14:55,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:14:53" (1/3) ... [2020-07-29 03:14:55,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c3f8641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:14:55, skipping insertion in model container [2020-07-29 03:14:55,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:14:55,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:14:54" (2/3) ... [2020-07-29 03:14:55,668 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c3f8641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:14:55, skipping insertion in model container [2020-07-29 03:14:55,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:14:55,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:14:55" (3/3) ... [2020-07-29 03:14:55,671 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-07-29 03:14:55,732 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:14:55,732 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:14:55,734 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:14:55,734 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:14:55,734 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:14:55,735 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:14:55,735 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:14:55,735 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:14:55,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states. [2020-07-29 03:14:55,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2020-07-29 03:14:55,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:14:55,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:14:55,862 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:14:55,863 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:14:55,863 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:14:55,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states. [2020-07-29 03:14:55,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2020-07-29 03:14:55,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:14:55,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:14:55,898 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:14:55,898 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:14:55,909 INFO L794 eck$LassoCheckResult]: Stem: 90#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 14#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; 11#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 126#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 58#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 47#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 92#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 82#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 113#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 110#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 35#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 17#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 61#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 57#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 100#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 103#L352-1true init_#res := init_~tmp___5~0; 22#L461true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; 12#L555true assume !(0 == main_~i2~0); 127#L555-2true ~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; 117#L569-2true [2020-07-29 03:14:55,915 INFO L796 eck$LassoCheckResult]: Loop: 117#L569-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 20#L120true assume !(0 != ~mode1~0 % 256); 116#L145true assume !(~r1~0 < 1); 114#L145-1true ~mode1~0 := 1; 18#L120-2true havoc node2_#t~ite2, node2_#t~ite3; 64#L163true assume !(0 != ~mode2~0 % 256); 42#L188true assume !(~r2~0 < 2); 40#L188-1true ~mode2~0 := 1; 63#L163-2true havoc node3_#t~ite4, node3_#t~ite5; 111#L206true assume !(0 != ~mode3~0 % 256); 88#L231true assume !(~r3~0 < 2); 87#L231-1true ~mode3~0 := 1; 108#L206-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; 45#L469true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 30#L469-1true check_#res := check_~tmp~1; 112#L517true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 10#L599true assume !(0 == assert_~arg % 256); 107#L594true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 117#L569-2true [2020-07-29 03:14:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2020-07-29 03:14:55,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:55,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624086927] [2020-07-29 03:14:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:14:56,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; {134#true} is VALID [2020-07-29 03:14:56,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; {134#true} is VALID [2020-07-29 03:14:56,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {134#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {134#true} is VALID [2020-07-29 03:14:56,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {134#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {134#true} is VALID [2020-07-29 03:14:56,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {134#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {134#true} is VALID [2020-07-29 03:14:56,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {134#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {134#true} is VALID [2020-07-29 03:14:56,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {134#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {134#true} is VALID [2020-07-29 03:14:56,262 INFO L280 TraceCheckUtils]: 7: Hoare triple {134#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {134#true} is VALID [2020-07-29 03:14:56,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {134#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {134#true} is VALID [2020-07-29 03:14:56,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {134#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {134#true} is VALID [2020-07-29 03:14:56,263 INFO L280 TraceCheckUtils]: 10: Hoare triple {134#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {134#true} is VALID [2020-07-29 03:14:56,263 INFO L280 TraceCheckUtils]: 11: Hoare triple {134#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {134#true} is VALID [2020-07-29 03:14:56,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {134#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {134#true} is VALID [2020-07-29 03:14:56,264 INFO L280 TraceCheckUtils]: 13: Hoare triple {134#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {134#true} is VALID [2020-07-29 03:14:56,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {134#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; {136#(= 0 ULTIMATE.start_init_~tmp___5~0)} is VALID [2020-07-29 03:14:56,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {136#(= 0 ULTIMATE.start_init_~tmp___5~0)} init_#res := init_~tmp___5~0; {137#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:14:56,268 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; {138#(= 0 ULTIMATE.start_main_~i2~0)} is VALID [2020-07-29 03:14:56,269 INFO L280 TraceCheckUtils]: 17: Hoare triple {138#(= 0 ULTIMATE.start_main_~i2~0)} assume !(0 == main_~i2~0); {135#false} is VALID [2020-07-29 03:14:56,270 INFO L280 TraceCheckUtils]: 18: Hoare triple {135#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; {135#false} is VALID [2020-07-29 03:14:56,274 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:14:56,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624086927] [2020-07-29 03:14:56,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:14:56,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:14:56,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467636372] [2020-07-29 03:14:56,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:14:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2020-07-29 03:14:56,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:56,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077585450] [2020-07-29 03:14:56,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:14:56,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {139#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; {139#true} is VALID [2020-07-29 03:14:56,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#true} assume !(0 != ~mode1~0 % 256); {139#true} is VALID [2020-07-29 03:14:56,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {139#true} assume !(~r1~0 < 1); {139#true} is VALID [2020-07-29 03:14:56,436 INFO L280 TraceCheckUtils]: 3: Hoare triple {139#true} ~mode1~0 := 1; {139#true} is VALID [2020-07-29 03:14:56,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {139#true} havoc node2_#t~ite2, node2_#t~ite3; {139#true} is VALID [2020-07-29 03:14:56,437 INFO L280 TraceCheckUtils]: 5: Hoare triple {139#true} assume !(0 != ~mode2~0 % 256); {139#true} is VALID [2020-07-29 03:14:56,437 INFO L280 TraceCheckUtils]: 6: Hoare triple {139#true} assume !(~r2~0 < 2); {139#true} is VALID [2020-07-29 03:14:56,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {139#true} ~mode2~0 := 1; {139#true} is VALID [2020-07-29 03:14:56,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {139#true} havoc node3_#t~ite4, node3_#t~ite5; {139#true} is VALID [2020-07-29 03:14:56,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {139#true} assume !(0 != ~mode3~0 % 256); {139#true} is VALID [2020-07-29 03:14:56,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {139#true} assume !(~r3~0 < 2); {139#true} is VALID [2020-07-29 03:14:56,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {139#true} ~mode3~0 := 1; {139#true} is VALID [2020-07-29 03:14:56,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {139#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; {139#true} is VALID [2020-07-29 03:14:56,441 INFO L280 TraceCheckUtils]: 13: Hoare triple {139#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {141#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:14:56,442 INFO L280 TraceCheckUtils]: 14: Hoare triple {141#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {142#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:14:56,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {143#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:14:56,445 INFO L280 TraceCheckUtils]: 16: Hoare triple {143#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {140#false} is VALID [2020-07-29 03:14:56,446 INFO L280 TraceCheckUtils]: 17: Hoare triple {140#false} main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; {140#false} is VALID [2020-07-29 03:14:56,448 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:14:56,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077585450] [2020-07-29 03:14:56,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:14:56,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:14:56,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809746471] [2020-07-29 03:14:56,451 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:14:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:14:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:14:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:14:56,470 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2020-07-29 03:14:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:57,316 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2020-07-29 03:14:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:14:57,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:14:57,348 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:14:57,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 226 transitions. [2020-07-29 03:14:57,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-07-29 03:14:57,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 125 states and 210 transitions. [2020-07-29 03:14:57,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2020-07-29 03:14:57,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2020-07-29 03:14:57,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2020-07-29 03:14:57,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:14:57,377 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2020-07-29 03:14:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2020-07-29 03:14:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-07-29 03:14:57,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:14:57,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states and 210 transitions. Second operand 125 states. [2020-07-29 03:14:57,417 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states and 210 transitions. Second operand 125 states. [2020-07-29 03:14:57,419 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. Second operand 125 states. [2020-07-29 03:14:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:57,428 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2020-07-29 03:14:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 210 transitions. [2020-07-29 03:14:57,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:14:57,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:14:57,431 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 125 states and 210 transitions. [2020-07-29 03:14:57,431 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 125 states and 210 transitions. [2020-07-29 03:14:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:57,439 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2020-07-29 03:14:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 210 transitions. [2020-07-29 03:14:57,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:14:57,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:14:57,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:14:57,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:14:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-29 03:14:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2020-07-29 03:14:57,449 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2020-07-29 03:14:57,450 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2020-07-29 03:14:57,450 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:14:57,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2020-07-29 03:14:57,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-07-29 03:14:57,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:14:57,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:14:57,454 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:14:57,454 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:14:57,454 INFO L794 eck$LassoCheckResult]: Stem: 400#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 307#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; 300#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 301#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 376#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 362#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 363#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 344#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 397#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 380#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 342#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 310#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 312#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 299#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 375#L352 assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 290#L352-1 init_#res := init_~tmp___5~0; 322#L461 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; 303#L555 assume !(0 == main_~i2~0); 304#L555-2 ~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; 403#L569-2 [2020-07-29 03:14:57,455 INFO L796 eck$LassoCheckResult]: Loop: 403#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 317#L120 assume !(0 != ~mode1~0 % 256); 319#L145 assume !(~r1~0 < 1); 306#L145-1 ~mode1~0 := 1; 313#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 314#L163 assume !(0 != ~mode2~0 % 256); 352#L188 assume !(~r2~0 < 2); 347#L188-1 ~mode2~0 := 1; 348#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 381#L206 assume !(0 != ~mode3~0 % 256); 399#L231 assume !(~r3~0 < 2); 350#L231-1 ~mode3~0 := 1; 398#L206-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; 357#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 358#L470 assume ~st1~0 + ~nl1~0 <= 1; 386#L471 assume ~st2~0 + ~nl2~0 <= 1; 320#L472 assume ~st3~0 + ~nl3~0 <= 1; 321#L473 assume ~r1~0 >= 2; 359#L477 assume ~r1~0 < 2; 360#L482 assume ~r1~0 >= 2; 316#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 335#L469-1 check_#res := check_~tmp~1; 336#L517 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 296#L599 assume !(0 == assert_~arg % 256); 297#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 403#L569-2 [2020-07-29 03:14:57,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:57,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2020-07-29 03:14:57,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:57,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894906491] [2020-07-29 03:14:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:14:57,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {660#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; {660#true} is VALID [2020-07-29 03:14:57,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; {660#true} is VALID [2020-07-29 03:14:57,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {660#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {660#true} is VALID [2020-07-29 03:14:57,624 INFO L280 TraceCheckUtils]: 3: Hoare triple {660#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {660#true} is VALID [2020-07-29 03:14:57,624 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {660#true} is VALID [2020-07-29 03:14:57,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {660#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {660#true} is VALID [2020-07-29 03:14:57,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {660#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {660#true} is VALID [2020-07-29 03:14:57,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {660#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {660#true} is VALID [2020-07-29 03:14:57,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {660#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {660#true} is VALID [2020-07-29 03:14:57,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {660#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {660#true} is VALID [2020-07-29 03:14:57,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {660#true} is VALID [2020-07-29 03:14:57,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {660#true} is VALID [2020-07-29 03:14:57,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {660#true} is VALID [2020-07-29 03:14:57,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {660#true} is VALID [2020-07-29 03:14:57,628 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; {662#(= 0 ULTIMATE.start_init_~tmp___5~0)} is VALID [2020-07-29 03:14:57,632 INFO L280 TraceCheckUtils]: 15: Hoare triple {662#(= 0 ULTIMATE.start_init_~tmp___5~0)} init_#res := init_~tmp___5~0; {663#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:14:57,633 INFO L280 TraceCheckUtils]: 16: Hoare triple {663#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; {664#(= 0 ULTIMATE.start_main_~i2~0)} is VALID [2020-07-29 03:14:57,634 INFO L280 TraceCheckUtils]: 17: Hoare triple {664#(= 0 ULTIMATE.start_main_~i2~0)} assume !(0 == main_~i2~0); {661#false} is VALID [2020-07-29 03:14:57,634 INFO L280 TraceCheckUtils]: 18: Hoare triple {661#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; {661#false} is VALID [2020-07-29 03:14:57,635 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:14:57,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894906491] [2020-07-29 03:14:57,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:14:57,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:14:57,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845488551] [2020-07-29 03:14:57,637 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:14:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2020-07-29 03:14:57,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:57,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524517064] [2020-07-29 03:14:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:14:57,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {665#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; {665#true} is VALID [2020-07-29 03:14:57,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume !(0 != ~mode1~0 % 256); {665#true} is VALID [2020-07-29 03:14:57,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {665#true} assume !(~r1~0 < 1); {665#true} is VALID [2020-07-29 03:14:57,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {665#true} ~mode1~0 := 1; {665#true} is VALID [2020-07-29 03:14:57,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} havoc node2_#t~ite2, node2_#t~ite3; {665#true} is VALID [2020-07-29 03:14:57,692 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} assume !(0 != ~mode2~0 % 256); {665#true} is VALID [2020-07-29 03:14:57,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#true} assume !(~r2~0 < 2); {665#true} is VALID [2020-07-29 03:14:57,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {665#true} ~mode2~0 := 1; {665#true} is VALID [2020-07-29 03:14:57,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#true} havoc node3_#t~ite4, node3_#t~ite5; {665#true} is VALID [2020-07-29 03:14:57,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {665#true} assume !(0 != ~mode3~0 % 256); {665#true} is VALID [2020-07-29 03:14:57,693 INFO L280 TraceCheckUtils]: 10: Hoare triple {665#true} assume !(~r3~0 < 2); {665#true} is VALID [2020-07-29 03:14:57,694 INFO L280 TraceCheckUtils]: 11: Hoare triple {665#true} ~mode3~0 := 1; {665#true} is VALID [2020-07-29 03:14:57,694 INFO L280 TraceCheckUtils]: 12: Hoare triple {665#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; {665#true} is VALID [2020-07-29 03:14:57,694 INFO L280 TraceCheckUtils]: 13: Hoare triple {665#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {665#true} is VALID [2020-07-29 03:14:57,694 INFO L280 TraceCheckUtils]: 14: Hoare triple {665#true} assume ~st1~0 + ~nl1~0 <= 1; {665#true} is VALID [2020-07-29 03:14:57,695 INFO L280 TraceCheckUtils]: 15: Hoare triple {665#true} assume ~st2~0 + ~nl2~0 <= 1; {665#true} is VALID [2020-07-29 03:14:57,695 INFO L280 TraceCheckUtils]: 16: Hoare triple {665#true} assume ~st3~0 + ~nl3~0 <= 1; {665#true} is VALID [2020-07-29 03:14:57,696 INFO L280 TraceCheckUtils]: 17: Hoare triple {665#true} assume ~r1~0 >= 2; {667#(< 1 ~r1~0)} is VALID [2020-07-29 03:14:57,697 INFO L280 TraceCheckUtils]: 18: Hoare triple {667#(< 1 ~r1~0)} assume ~r1~0 < 2; {666#false} is VALID [2020-07-29 03:14:57,697 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} assume ~r1~0 >= 2; {666#false} is VALID [2020-07-29 03:14:57,697 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {666#false} is VALID [2020-07-29 03:14:57,698 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} check_#res := check_~tmp~1; {666#false} is VALID [2020-07-29 03:14:57,698 INFO L280 TraceCheckUtils]: 22: Hoare triple {666#false} main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {666#false} is VALID [2020-07-29 03:14:57,698 INFO L280 TraceCheckUtils]: 23: Hoare triple {666#false} assume !(0 == assert_~arg % 256); {666#false} is VALID [2020-07-29 03:14:57,699 INFO L280 TraceCheckUtils]: 24: Hoare triple {666#false} main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; {666#false} is VALID [2020-07-29 03:14:57,700 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:14:57,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524517064] [2020-07-29 03:14:57,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:14:57,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:14:57,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268887368] [2020-07-29 03:14:57,701 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:14:57,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:14:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:14:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:14:57,702 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand 5 states. [2020-07-29 03:14:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:58,450 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2020-07-29 03:14:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:14:58,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:14:58,487 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:14:58,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 320 transitions. [2020-07-29 03:14:58,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-07-29 03:14:58,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 193 states and 291 transitions. [2020-07-29 03:14:58,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2020-07-29 03:14:58,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2020-07-29 03:14:58,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 291 transitions. [2020-07-29 03:14:58,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:14:58,522 INFO L688 BuchiCegarLoop]: Abstraction has 193 states and 291 transitions. [2020-07-29 03:14:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 291 transitions. [2020-07-29 03:14:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2020-07-29 03:14:58,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:14:58,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states and 291 transitions. Second operand 125 states. [2020-07-29 03:14:58,542 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states and 291 transitions. Second operand 125 states. [2020-07-29 03:14:58,542 INFO L87 Difference]: Start difference. First operand 193 states and 291 transitions. Second operand 125 states. [2020-07-29 03:14:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:58,551 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2020-07-29 03:14:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2020-07-29 03:14:58,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:14:58,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:14:58,557 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 193 states and 291 transitions. [2020-07-29 03:14:58,560 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 193 states and 291 transitions. [2020-07-29 03:14:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:58,569 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2020-07-29 03:14:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2020-07-29 03:14:58,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:14:58,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:14:58,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:14:58,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:14:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-29 03:14:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2020-07-29 03:14:58,574 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2020-07-29 03:14:58,575 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2020-07-29 03:14:58,582 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:14:58,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2020-07-29 03:14:58,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-07-29 03:14:58,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:14:58,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:14:58,590 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] [2020-07-29 03:14:58,590 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:14:58,590 INFO L794 eck$LassoCheckResult]: Stem: 986#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 892#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; 885#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 886#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 962#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 947#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 948#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 929#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 983#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 966#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 927#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 895#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 897#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 882#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 961#L352 assume ~id1~0 != ~id2~0; 959#L353 assume ~id1~0 != ~id3~0; 879#L354 assume ~id2~0 != ~id3~0; 880#L355 assume ~id1~0 >= 0; 930#L356 assume ~id2~0 >= 0; 931#L357 assume ~id3~0 >= 0; 982#L358 assume 0 == ~r1~0; 925#L359 assume 0 == ~r2~0; 926#L360 assume 0 == ~r3~0; 964#L361 assume 0 != init_~r122~0 % 256; 916#L362 assume 0 != init_~r132~0 % 256; 917#L363 assume 0 != init_~r212~0 % 256; 958#L364 assume 0 != init_~r232~0 % 256; 877#L365 assume 0 != init_~r312~0 % 256; 878#L366 assume 0 != init_~r322~0 % 256; 955#L367 assume ~max1~0 == ~id1~0; 956#L368 assume ~max2~0 == ~id2~0; 981#L369 assume ~max3~0 == ~id3~0; 923#L370 assume 0 == ~st1~0; 924#L371 assume 0 == ~st2~0; 963#L372 assume 0 == ~st3~0; 914#L373 assume 0 == ~nl1~0; 915#L374 assume 0 == ~nl2~0; 957#L375 assume 0 == ~nl3~0; 875#L376 assume 0 == ~mode1~0 % 256; 876#L377 assume 0 == ~mode2~0 % 256; 951#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 952#L352-1 init_#res := init_~tmp___5~0; 907#L461 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; 888#L555 assume !(0 == main_~i2~0); 889#L555-2 ~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; 989#L569-2 [2020-07-29 03:14:58,591 INFO L796 eck$LassoCheckResult]: Loop: 989#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 902#L120 assume !(0 != ~mode1~0 % 256); 904#L145 assume !(~r1~0 < 1); 891#L145-1 ~mode1~0 := 1; 898#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 899#L163 assume !(0 != ~mode2~0 % 256); 937#L188 assume !(~r2~0 < 2); 932#L188-1 ~mode2~0 := 1; 933#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 967#L206 assume !(0 != ~mode3~0 % 256); 985#L231 assume !(~r3~0 < 2); 935#L231-1 ~mode3~0 := 1; 984#L206-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; 942#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 943#L470 assume ~st1~0 + ~nl1~0 <= 1; 972#L471 assume ~st2~0 + ~nl2~0 <= 1; 905#L472 assume ~st3~0 + ~nl3~0 <= 1; 906#L473 assume ~r1~0 >= 2; 944#L477 assume ~r1~0 < 2; 945#L482 assume ~r1~0 >= 2; 901#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 920#L469-1 check_#res := check_~tmp~1; 921#L517 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 883#L599 assume !(0 == assert_~arg % 256); 884#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 989#L569-2 [2020-07-29 03:14:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2020-07-29 03:14:58,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:58,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392938460] [2020-07-29 03:14:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:14:58,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:14:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:14:58,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:14:58,800 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:14:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2020-07-29 03:14:58,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:58,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679428282] [2020-07-29 03:14:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:14:58,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; {1384#true} is VALID [2020-07-29 03:14:58,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {1384#true} assume !(0 != ~mode1~0 % 256); {1384#true} is VALID [2020-07-29 03:14:58,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {1384#true} assume !(~r1~0 < 1); {1384#true} is VALID [2020-07-29 03:14:58,837 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~mode1~0 := 1; {1384#true} is VALID [2020-07-29 03:14:58,837 INFO L280 TraceCheckUtils]: 4: Hoare triple {1384#true} havoc node2_#t~ite2, node2_#t~ite3; {1384#true} is VALID [2020-07-29 03:14:58,838 INFO L280 TraceCheckUtils]: 5: Hoare triple {1384#true} assume !(0 != ~mode2~0 % 256); {1384#true} is VALID [2020-07-29 03:14:58,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {1384#true} assume !(~r2~0 < 2); {1384#true} is VALID [2020-07-29 03:14:58,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {1384#true} ~mode2~0 := 1; {1384#true} is VALID [2020-07-29 03:14:58,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {1384#true} havoc node3_#t~ite4, node3_#t~ite5; {1384#true} is VALID [2020-07-29 03:14:58,839 INFO L280 TraceCheckUtils]: 9: Hoare triple {1384#true} assume !(0 != ~mode3~0 % 256); {1384#true} is VALID [2020-07-29 03:14:58,839 INFO L280 TraceCheckUtils]: 10: Hoare triple {1384#true} assume !(~r3~0 < 2); {1384#true} is VALID [2020-07-29 03:14:58,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#true} ~mode3~0 := 1; {1384#true} is VALID [2020-07-29 03:14:58,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {1384#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; {1384#true} is VALID [2020-07-29 03:14:58,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {1384#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1384#true} is VALID [2020-07-29 03:14:58,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {1384#true} assume ~st1~0 + ~nl1~0 <= 1; {1384#true} is VALID [2020-07-29 03:14:58,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {1384#true} assume ~st2~0 + ~nl2~0 <= 1; {1384#true} is VALID [2020-07-29 03:14:58,840 INFO L280 TraceCheckUtils]: 16: Hoare triple {1384#true} assume ~st3~0 + ~nl3~0 <= 1; {1384#true} is VALID [2020-07-29 03:14:58,841 INFO L280 TraceCheckUtils]: 17: Hoare triple {1384#true} assume ~r1~0 >= 2; {1386#(< 1 ~r1~0)} is VALID [2020-07-29 03:14:58,841 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(< 1 ~r1~0)} assume ~r1~0 < 2; {1385#false} is VALID [2020-07-29 03:14:58,841 INFO L280 TraceCheckUtils]: 19: Hoare triple {1385#false} assume ~r1~0 >= 2; {1385#false} is VALID [2020-07-29 03:14:58,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {1385#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {1385#false} is VALID [2020-07-29 03:14:58,842 INFO L280 TraceCheckUtils]: 21: Hoare triple {1385#false} check_#res := check_~tmp~1; {1385#false} is VALID [2020-07-29 03:14:58,842 INFO L280 TraceCheckUtils]: 22: Hoare triple {1385#false} main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1385#false} is VALID [2020-07-29 03:14:58,842 INFO L280 TraceCheckUtils]: 23: Hoare triple {1385#false} assume !(0 == assert_~arg % 256); {1385#false} is VALID [2020-07-29 03:14:58,842 INFO L280 TraceCheckUtils]: 24: Hoare triple {1385#false} main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; {1385#false} is VALID [2020-07-29 03:14:58,843 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:14:58,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679428282] [2020-07-29 03:14:58,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:14:58,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:14:58,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623147225] [2020-07-29 03:14:58,844 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:14:58,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:14:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:14:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:14:58,845 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand 3 states. [2020-07-29 03:14:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:59,175 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2020-07-29 03:14:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:14:59,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:14:59,203 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:14:59,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2020-07-29 03:14:59,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2020-07-29 03:14:59,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2020-07-29 03:14:59,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2020-07-29 03:14:59,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2020-07-29 03:14:59,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2020-07-29 03:14:59,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:14:59,219 INFO L688 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2020-07-29 03:14:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2020-07-29 03:14:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-07-29 03:14:59,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:14:59,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states and 260 transitions. Second operand 177 states. [2020-07-29 03:14:59,226 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states and 260 transitions. Second operand 177 states. [2020-07-29 03:14:59,226 INFO L87 Difference]: Start difference. First operand 177 states and 260 transitions. Second operand 177 states. [2020-07-29 03:14:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:59,233 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2020-07-29 03:14:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2020-07-29 03:14:59,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:14:59,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:14:59,234 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states and 260 transitions. [2020-07-29 03:14:59,234 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states and 260 transitions. [2020-07-29 03:14:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:14:59,242 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2020-07-29 03:14:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2020-07-29 03:14:59,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:14:59,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:14:59,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:14:59,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:14:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-29 03:14:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2020-07-29 03:14:59,250 INFO L711 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2020-07-29 03:14:59,250 INFO L591 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2020-07-29 03:14:59,250 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:14:59,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2020-07-29 03:14:59,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2020-07-29 03:14:59,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:14:59,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:14:59,253 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] [2020-07-29 03:14:59,253 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] [2020-07-29 03:14:59,254 INFO L794 eck$LassoCheckResult]: Stem: 1684#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 1588#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; 1581#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1582#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1658#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1643#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1644#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 1625#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1681#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 1662#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1623#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 1591#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1593#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 1580#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1657#L352 assume ~id1~0 != ~id2~0; 1655#L353 assume ~id1~0 != ~id3~0; 1575#L354 assume ~id2~0 != ~id3~0; 1576#L355 assume ~id1~0 >= 0; 1626#L356 assume ~id2~0 >= 0; 1627#L357 assume ~id3~0 >= 0; 1680#L358 assume 0 == ~r1~0; 1621#L359 assume 0 == ~r2~0; 1622#L360 assume 0 == ~r3~0; 1660#L361 assume 0 != init_~r122~0 % 256; 1612#L362 assume 0 != init_~r132~0 % 256; 1613#L363 assume 0 != init_~r212~0 % 256; 1654#L364 assume 0 != init_~r232~0 % 256; 1573#L365 assume 0 != init_~r312~0 % 256; 1574#L366 assume 0 != init_~r322~0 % 256; 1651#L367 assume ~max1~0 == ~id1~0; 1652#L368 assume ~max2~0 == ~id2~0; 1679#L369 assume ~max3~0 == ~id3~0; 1619#L370 assume 0 == ~st1~0; 1620#L371 assume 0 == ~st2~0; 1659#L372 assume 0 == ~st3~0; 1610#L373 assume 0 == ~nl1~0; 1611#L374 assume 0 == ~nl2~0; 1653#L375 assume 0 == ~nl3~0; 1571#L376 assume 0 == ~mode1~0 % 256; 1572#L377 assume 0 == ~mode2~0 % 256; 1647#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 1648#L352-1 init_#res := init_~tmp___5~0; 1603#L461 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; 1584#L555 assume !(0 == main_~i2~0); 1585#L555-2 ~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; 1688#L569-2 [2020-07-29 03:14:59,254 INFO L796 eck$LassoCheckResult]: Loop: 1688#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 1598#L120 assume !(0 != ~mode1~0 % 256); 1600#L145 assume !(~r1~0 < 1); 1587#L145-1 ~mode1~0 := 1; 1730#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 1726#L163 assume !(0 != ~mode2~0 % 256); 1723#L188 assume !(~r2~0 < 2); 1720#L188-1 ~mode2~0 := 1; 1718#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 1714#L206 assume !(0 != ~mode3~0 % 256); 1710#L231 assume !(~r3~0 < 2); 1706#L231-1 ~mode3~0 := 1; 1704#L206-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; 1703#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1702#L470 assume ~st1~0 + ~nl1~0 <= 1; 1701#L471 assume ~st2~0 + ~nl2~0 <= 1; 1700#L472 assume ~st3~0 + ~nl3~0 <= 1; 1699#L473 assume !(~r1~0 >= 2); 1685#L476 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1686#L477 assume ~r1~0 < 2; 1697#L482 assume !(~r1~0 >= 2); 1596#L486 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1597#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 1616#L469-1 check_#res := check_~tmp~1; 1617#L517 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1577#L599 assume !(0 == assert_~arg % 256); 1578#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 1688#L569-2 [2020-07-29 03:14:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2020-07-29 03:14:59,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:59,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639340562] [2020-07-29 03:14:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:14:59,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:14:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:14:59,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:14:59,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:14:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -77605116, now seen corresponding path program 1 times [2020-07-29 03:14:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:59,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392512913] [2020-07-29 03:14:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:14:59,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:14:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:14:59,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:14:59,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:14:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:14:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2113327686, now seen corresponding path program 1 times [2020-07-29 03:14:59,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:14:59,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242496308] [2020-07-29 03:14:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:14:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:14:59,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {2102#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; {2102#true} is VALID [2020-07-29 03:14:59,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {2102#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; {2102#true} is VALID [2020-07-29 03:14:59,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {2102#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2102#true} is VALID [2020-07-29 03:14:59,504 INFO L280 TraceCheckUtils]: 3: Hoare triple {2102#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2102#true} is VALID [2020-07-29 03:14:59,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {2102#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2102#true} is VALID [2020-07-29 03:14:59,505 INFO L280 TraceCheckUtils]: 5: Hoare triple {2102#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2102#true} is VALID [2020-07-29 03:14:59,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {2102#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {2102#true} is VALID [2020-07-29 03:14:59,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {2102#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2102#true} is VALID [2020-07-29 03:14:59,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {2102#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {2102#true} is VALID [2020-07-29 03:14:59,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {2102#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2102#true} is VALID [2020-07-29 03:14:59,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {2102#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {2102#true} is VALID [2020-07-29 03:14:59,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {2102#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2102#true} is VALID [2020-07-29 03:14:59,507 INFO L280 TraceCheckUtils]: 12: Hoare triple {2102#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {2102#true} is VALID [2020-07-29 03:14:59,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {2102#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2102#true} is VALID [2020-07-29 03:14:59,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {2102#true} assume ~id1~0 != ~id2~0; {2102#true} is VALID [2020-07-29 03:14:59,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {2102#true} assume ~id1~0 != ~id3~0; {2102#true} is VALID [2020-07-29 03:14:59,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {2102#true} assume ~id2~0 != ~id3~0; {2102#true} is VALID [2020-07-29 03:14:59,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {2102#true} assume ~id1~0 >= 0; {2102#true} is VALID [2020-07-29 03:14:59,509 INFO L280 TraceCheckUtils]: 18: Hoare triple {2102#true} assume ~id2~0 >= 0; {2102#true} is VALID [2020-07-29 03:14:59,509 INFO L280 TraceCheckUtils]: 19: Hoare triple {2102#true} assume ~id3~0 >= 0; {2102#true} is VALID [2020-07-29 03:14:59,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {2102#true} assume 0 == ~r1~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,517 INFO L280 TraceCheckUtils]: 21: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~r2~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,518 INFO L280 TraceCheckUtils]: 22: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~r3~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,519 INFO L280 TraceCheckUtils]: 23: Hoare triple {2104#(= 0 ~r1~0)} assume 0 != init_~r122~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,520 INFO L280 TraceCheckUtils]: 24: Hoare triple {2104#(= 0 ~r1~0)} assume 0 != init_~r132~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,521 INFO L280 TraceCheckUtils]: 25: Hoare triple {2104#(= 0 ~r1~0)} assume 0 != init_~r212~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,521 INFO L280 TraceCheckUtils]: 26: Hoare triple {2104#(= 0 ~r1~0)} assume 0 != init_~r232~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,522 INFO L280 TraceCheckUtils]: 27: Hoare triple {2104#(= 0 ~r1~0)} assume 0 != init_~r312~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,523 INFO L280 TraceCheckUtils]: 28: Hoare triple {2104#(= 0 ~r1~0)} assume 0 != init_~r322~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,524 INFO L280 TraceCheckUtils]: 29: Hoare triple {2104#(= 0 ~r1~0)} assume ~max1~0 == ~id1~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,524 INFO L280 TraceCheckUtils]: 30: Hoare triple {2104#(= 0 ~r1~0)} assume ~max2~0 == ~id2~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,525 INFO L280 TraceCheckUtils]: 31: Hoare triple {2104#(= 0 ~r1~0)} assume ~max3~0 == ~id3~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,526 INFO L280 TraceCheckUtils]: 32: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~st1~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,526 INFO L280 TraceCheckUtils]: 33: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~st2~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,527 INFO L280 TraceCheckUtils]: 34: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~st3~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,527 INFO L280 TraceCheckUtils]: 35: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~nl1~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,528 INFO L280 TraceCheckUtils]: 36: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~nl2~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,528 INFO L280 TraceCheckUtils]: 37: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~nl3~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,528 INFO L280 TraceCheckUtils]: 38: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~mode1~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,529 INFO L280 TraceCheckUtils]: 39: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~mode2~0 % 256; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,529 INFO L280 TraceCheckUtils]: 40: Hoare triple {2104#(= 0 ~r1~0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,530 INFO L280 TraceCheckUtils]: 41: Hoare triple {2104#(= 0 ~r1~0)} init_#res := init_~tmp___5~0; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,530 INFO L280 TraceCheckUtils]: 42: Hoare triple {2104#(= 0 ~r1~0)} main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,531 INFO L280 TraceCheckUtils]: 43: Hoare triple {2104#(= 0 ~r1~0)} assume !(0 == main_~i2~0); {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,531 INFO L280 TraceCheckUtils]: 44: Hoare triple {2104#(= 0 ~r1~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; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,531 INFO L280 TraceCheckUtils]: 45: Hoare triple {2104#(= 0 ~r1~0)} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,532 INFO L280 TraceCheckUtils]: 46: Hoare triple {2104#(= 0 ~r1~0)} assume !(0 != ~mode1~0 % 256); {2104#(= 0 ~r1~0)} is VALID [2020-07-29 03:14:59,532 INFO L280 TraceCheckUtils]: 47: Hoare triple {2104#(= 0 ~r1~0)} assume !(~r1~0 < 1); {2103#false} is VALID [2020-07-29 03:14:59,532 INFO L280 TraceCheckUtils]: 48: Hoare triple {2103#false} ~mode1~0 := 1; {2103#false} is VALID [2020-07-29 03:14:59,533 INFO L280 TraceCheckUtils]: 49: Hoare triple {2103#false} havoc node2_#t~ite2, node2_#t~ite3; {2103#false} is VALID [2020-07-29 03:14:59,533 INFO L280 TraceCheckUtils]: 50: Hoare triple {2103#false} assume !(0 != ~mode2~0 % 256); {2103#false} is VALID [2020-07-29 03:14:59,533 INFO L280 TraceCheckUtils]: 51: Hoare triple {2103#false} assume !(~r2~0 < 2); {2103#false} is VALID [2020-07-29 03:14:59,533 INFO L280 TraceCheckUtils]: 52: Hoare triple {2103#false} ~mode2~0 := 1; {2103#false} is VALID [2020-07-29 03:14:59,533 INFO L280 TraceCheckUtils]: 53: Hoare triple {2103#false} havoc node3_#t~ite4, node3_#t~ite5; {2103#false} is VALID [2020-07-29 03:14:59,534 INFO L280 TraceCheckUtils]: 54: Hoare triple {2103#false} assume !(0 != ~mode3~0 % 256); {2103#false} is VALID [2020-07-29 03:14:59,534 INFO L280 TraceCheckUtils]: 55: Hoare triple {2103#false} assume !(~r3~0 < 2); {2103#false} is VALID [2020-07-29 03:14:59,534 INFO L280 TraceCheckUtils]: 56: Hoare triple {2103#false} ~mode3~0 := 1; {2103#false} is VALID [2020-07-29 03:14:59,534 INFO L280 TraceCheckUtils]: 57: Hoare triple {2103#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; {2103#false} is VALID [2020-07-29 03:14:59,534 INFO L280 TraceCheckUtils]: 58: Hoare triple {2103#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2103#false} is VALID [2020-07-29 03:14:59,535 INFO L280 TraceCheckUtils]: 59: Hoare triple {2103#false} assume ~st1~0 + ~nl1~0 <= 1; {2103#false} is VALID [2020-07-29 03:14:59,535 INFO L280 TraceCheckUtils]: 60: Hoare triple {2103#false} assume ~st2~0 + ~nl2~0 <= 1; {2103#false} is VALID [2020-07-29 03:14:59,535 INFO L280 TraceCheckUtils]: 61: Hoare triple {2103#false} assume ~st3~0 + ~nl3~0 <= 1; {2103#false} is VALID [2020-07-29 03:14:59,535 INFO L280 TraceCheckUtils]: 62: Hoare triple {2103#false} assume !(~r1~0 >= 2); {2103#false} is VALID [2020-07-29 03:14:59,536 INFO L280 TraceCheckUtils]: 63: Hoare triple {2103#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2103#false} is VALID [2020-07-29 03:14:59,536 INFO L280 TraceCheckUtils]: 64: Hoare triple {2103#false} assume ~r1~0 < 2; {2103#false} is VALID [2020-07-29 03:14:59,536 INFO L280 TraceCheckUtils]: 65: Hoare triple {2103#false} assume !(~r1~0 >= 2); {2103#false} is VALID [2020-07-29 03:14:59,536 INFO L280 TraceCheckUtils]: 66: Hoare triple {2103#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2103#false} is VALID [2020-07-29 03:14:59,536 INFO L280 TraceCheckUtils]: 67: Hoare triple {2103#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {2103#false} is VALID [2020-07-29 03:14:59,537 INFO L280 TraceCheckUtils]: 68: Hoare triple {2103#false} check_#res := check_~tmp~1; {2103#false} is VALID [2020-07-29 03:14:59,537 INFO L280 TraceCheckUtils]: 69: Hoare triple {2103#false} main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2103#false} is VALID [2020-07-29 03:14:59,537 INFO L280 TraceCheckUtils]: 70: Hoare triple {2103#false} assume !(0 == assert_~arg % 256); {2103#false} is VALID [2020-07-29 03:14:59,537 INFO L280 TraceCheckUtils]: 71: Hoare triple {2103#false} main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; {2103#false} is VALID [2020-07-29 03:14:59,543 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:14:59,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242496308] [2020-07-29 03:14:59,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:14:59,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:14:59,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347230106] [2020-07-29 03:14:59,781 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2020-07-29 03:15:00,045 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2020-07-29 03:15:00,067 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:15:00,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:15:00,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:15:00,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:15:00,069 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:15:00,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:00,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:15:00,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:15:00,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:15:00,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:15:00,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:15:00,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,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:15:00,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,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:15:00,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,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:15:00,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,225 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:15:01,247 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:01,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:15:01,257 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:01,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:15:01,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:15:01,382 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:15:01,384 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:15:01,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:15:01,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:15:01,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:15:01,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:15:01,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:01,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:15:01,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:15:01,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:15:01,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:15:01,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:15:01,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:01,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:02,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:15:02,410 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:02,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:02,461 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) [2020-07-29 03:15:02,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:02,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:02,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,715 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) [2020-07-29 03:15:02,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:02,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:02,804 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:15:02,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:02,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:02,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:02,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:02,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:02,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:02,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:02,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:02,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:15:02,848 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:15:02,848 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:02,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:15:02,854 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:15:02,855 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:15:02,855 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:15:02,902 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:15:02,911 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 1);" "~mode1~0 := 1;" "havoc node2_#t~ite2, node2_#t~ite3;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node3_#t~ite4, node3_#t~ite5;" "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~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;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~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35;" [2020-07-29 03:15:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:03,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:15:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:03,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:15:03,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {2105#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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; {2105#unseeded} is VALID [2020-07-29 03:15:03,125 INFO L280 TraceCheckUtils]: 1: Hoare triple {2105#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~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;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; {2105#unseeded} is VALID [2020-07-29 03:15:03,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {2105#unseeded} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {2105#unseeded} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2105#unseeded} is VALID [2020-07-29 03:15:03,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {2105#unseeded} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {2105#unseeded} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2105#unseeded} is VALID [2020-07-29 03:15:03,128 INFO L280 TraceCheckUtils]: 6: Hoare triple {2105#unseeded} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,129 INFO L280 TraceCheckUtils]: 7: Hoare triple {2105#unseeded} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2105#unseeded} is VALID [2020-07-29 03:15:03,129 INFO L280 TraceCheckUtils]: 8: Hoare triple {2105#unseeded} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,130 INFO L280 TraceCheckUtils]: 9: Hoare triple {2105#unseeded} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2105#unseeded} is VALID [2020-07-29 03:15:03,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {2105#unseeded} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,132 INFO L280 TraceCheckUtils]: 11: Hoare triple {2105#unseeded} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2105#unseeded} is VALID [2020-07-29 03:15:03,133 INFO L280 TraceCheckUtils]: 12: Hoare triple {2105#unseeded} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {2105#unseeded} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2105#unseeded} is VALID [2020-07-29 03:15:03,135 INFO L280 TraceCheckUtils]: 14: Hoare triple {2105#unseeded} assume ~id1~0 != ~id2~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,136 INFO L280 TraceCheckUtils]: 15: Hoare triple {2105#unseeded} assume ~id1~0 != ~id3~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,138 INFO L280 TraceCheckUtils]: 16: Hoare triple {2105#unseeded} assume ~id2~0 != ~id3~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,139 INFO L280 TraceCheckUtils]: 17: Hoare triple {2105#unseeded} assume ~id1~0 >= 0; {2105#unseeded} is VALID [2020-07-29 03:15:03,140 INFO L280 TraceCheckUtils]: 18: Hoare triple {2105#unseeded} assume ~id2~0 >= 0; {2105#unseeded} is VALID [2020-07-29 03:15:03,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {2105#unseeded} assume ~id3~0 >= 0; {2105#unseeded} is VALID [2020-07-29 03:15:03,141 INFO L280 TraceCheckUtils]: 20: Hoare triple {2105#unseeded} assume 0 == ~r1~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,141 INFO L280 TraceCheckUtils]: 21: Hoare triple {2105#unseeded} assume 0 == ~r2~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,142 INFO L280 TraceCheckUtils]: 22: Hoare triple {2105#unseeded} assume 0 == ~r3~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,143 INFO L280 TraceCheckUtils]: 23: Hoare triple {2105#unseeded} assume 0 != init_~r122~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,143 INFO L280 TraceCheckUtils]: 24: Hoare triple {2105#unseeded} assume 0 != init_~r132~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,144 INFO L280 TraceCheckUtils]: 25: Hoare triple {2105#unseeded} assume 0 != init_~r212~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,144 INFO L280 TraceCheckUtils]: 26: Hoare triple {2105#unseeded} assume 0 != init_~r232~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,153 INFO L280 TraceCheckUtils]: 27: Hoare triple {2105#unseeded} assume 0 != init_~r312~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,154 INFO L280 TraceCheckUtils]: 28: Hoare triple {2105#unseeded} assume 0 != init_~r322~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,154 INFO L280 TraceCheckUtils]: 29: Hoare triple {2105#unseeded} assume ~max1~0 == ~id1~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,155 INFO L280 TraceCheckUtils]: 30: Hoare triple {2105#unseeded} assume ~max2~0 == ~id2~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,157 INFO L280 TraceCheckUtils]: 31: Hoare triple {2105#unseeded} assume ~max3~0 == ~id3~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,157 INFO L280 TraceCheckUtils]: 32: Hoare triple {2105#unseeded} assume 0 == ~st1~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,158 INFO L280 TraceCheckUtils]: 33: Hoare triple {2105#unseeded} assume 0 == ~st2~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,158 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#unseeded} assume 0 == ~st3~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,159 INFO L280 TraceCheckUtils]: 35: Hoare triple {2105#unseeded} assume 0 == ~nl1~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,160 INFO L280 TraceCheckUtils]: 36: Hoare triple {2105#unseeded} assume 0 == ~nl2~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,160 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#unseeded} assume 0 == ~nl3~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,161 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#unseeded} assume 0 == ~mode1~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,161 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#unseeded} assume 0 == ~mode2~0 % 256; {2105#unseeded} is VALID [2020-07-29 03:15:03,162 INFO L280 TraceCheckUtils]: 40: Hoare triple {2105#unseeded} assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; {2105#unseeded} is VALID [2020-07-29 03:15:03,163 INFO L280 TraceCheckUtils]: 41: Hoare triple {2105#unseeded} init_#res := init_~tmp___5~0; {2105#unseeded} is VALID [2020-07-29 03:15:03,164 INFO L280 TraceCheckUtils]: 42: Hoare triple {2105#unseeded} main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33; {2105#unseeded} is VALID [2020-07-29 03:15:03,165 INFO L280 TraceCheckUtils]: 43: Hoare triple {2105#unseeded} assume !(0 == main_~i2~0); {2105#unseeded} is VALID [2020-07-29 03:15:03,166 INFO L280 TraceCheckUtils]: 44: Hoare triple {2105#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; {2105#unseeded} is VALID [2020-07-29 03:15:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:03,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:15:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:03,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:15:03,278 INFO L280 TraceCheckUtils]: 0: Hoare triple {2108#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode1~0 % 256); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,280 INFO L280 TraceCheckUtils]: 2: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 < 1); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode1~0 := 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node2_#t~ite2, node2_#t~ite3; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode2~0 % 256); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r2~0 < 2); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,285 INFO L280 TraceCheckUtils]: 7: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode2~0 := 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,286 INFO L280 TraceCheckUtils]: 8: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node3_#t~ite4, node3_#t~ite5; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode3~0 % 256); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r3~0 < 2); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode3~0 := 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {2255#(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; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~nl1~0 <= 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,289 INFO L280 TraceCheckUtils]: 15: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st2~0 + ~nl2~0 <= 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st3~0 + ~nl3~0 <= 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,290 INFO L280 TraceCheckUtils]: 17: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 2); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,291 INFO L280 TraceCheckUtils]: 19: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,292 INFO L280 TraceCheckUtils]: 20: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 2); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,292 INFO L280 TraceCheckUtils]: 21: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,293 INFO L280 TraceCheckUtils]: 22: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2;check_~tmp~1 := 1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,293 INFO L280 TraceCheckUtils]: 23: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} check_#res := check_~tmp~1; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,295 INFO L280 TraceCheckUtils]: 25: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 == assert_~arg % 256); {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:15:03,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {2255#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; {2118#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))) unseeded)} is VALID [2020-07-29 03:15:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:15:03,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:15:03,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:03,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:03,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,349 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:15:03,350 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-07-29 03:15:03,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 296 states and 445 transitions. Complement of second has 4 states. [2020-07-29 03:15:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:15:03,799 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:15:03,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. cyclomatic complexity: 84 [2020-07-29 03:15:03,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:03,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:03,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:15:03,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:15:03,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:03,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:03,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 445 transitions. [2020-07-29 03:15:03,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:03,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:03,824 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 177 states and 260 transitions. cyclomatic complexity: 84 [2020-07-29 03:15:03,941 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 120 examples of accepted words. [2020-07-29 03:15:03,941 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:15:03,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:15:03,945 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:15:03,946 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 296 states and 445 transitions. cyclomatic complexity: 150 [2020-07-29 03:15:03,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 445 transitions. cyclomatic complexity: 150 [2020-07-29 03:15:03,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:03,947 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:15:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 296 letters. Loop has 296 letters. [2020-07-29 03:15:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 296 letters. Loop has 296 letters. [2020-07-29 03:15:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 296 letters. Loop has 296 letters. [2020-07-29 03:15:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 177 letters. Loop has 177 letters. [2020-07-29 03:15:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 177 letters. Loop has 177 letters. [2020-07-29 03:15:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 177 letters. Loop has 177 letters. [2020-07-29 03:15:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:15:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:15:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:15:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:03,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:03,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:15:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:15:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:15:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:15:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:15:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:15:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:15:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:15:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:15:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:15:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:15:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:15:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:15:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:15:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:15:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:15:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:15:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:15:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:15:03,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:15:03,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:15:03,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:15:03,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:15:03,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:15:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:15:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:15:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:15:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:15:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:15:03,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:15:03,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:15:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:15:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:15:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:15:03,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:15:03,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:15:03,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:15:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:15:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:15:03,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:15:03,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:15:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:15:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:15:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:15:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:15:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:15:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:15:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:15:04,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:15:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:15:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:15:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:15:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:15:04,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:15:04,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 30 letters. [2020-07-29 03:15:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 30 letters. [2020-07-29 03:15:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 30 letters. [2020-07-29 03:15:04,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:15:04,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:15:04,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:15:04,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:15:04,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:15:04,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:15:04,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:15:04,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:15:04,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:15:04,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:15:04,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:15:04,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:15:04,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:15:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:15:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:15:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:15:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:15:04,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:15:04,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:15:04,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:15:04,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:15:04,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:15:04,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:15:04,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:15:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:15:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:15:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:15:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:15:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:15:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:15:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:15:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:15:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:15:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:15:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:15:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:15:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:15:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:15:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:15:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:15:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:15:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:15:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:15:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:15:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:15:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:15:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:15:04,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:15:04,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:15:04,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:15:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:15:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:15:04,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:15:04,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:15:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:15:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:15:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:15:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 30 letters. [2020-07-29 03:15:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 30 letters. [2020-07-29 03:15:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 30 letters. [2020-07-29 03:15:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:15:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:15:04,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:15:04,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:15:04,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:15:04,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:15:04,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:15:04,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:15:04,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:15:04,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:15:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:15:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:15:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:15:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:15:04,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:15:04,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:15:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:15:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:15:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:15:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:15:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:15:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:15:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:15:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:15:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:15:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:15:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:15:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:15:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:15:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:15:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:15:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:15:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:15:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:15:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:15:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:15:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:15:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:15:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:15:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:15:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:15:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:15:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:15:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:15:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:15:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:15:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:15:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:15:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:15:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:15:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:15:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:15:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:15:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:15:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:15:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:15:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:15:04,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:15:04,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:15:04,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:15:04,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:15:04,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:15:04,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:15:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:15:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:15:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:15:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:15:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:15:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:15:04,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:15:04,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:15:04,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:15:04,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:15:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:15:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:15:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:15:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:15:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:15:04,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:15:04,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:15:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:15:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:15:04,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:15:04,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:15:04,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:15:04,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:15:04,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:15:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:15:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:15:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:15:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:15:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:15:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:15:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:15:04,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:15:04,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:15:04,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:15:04,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:15:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:15:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:15:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:15:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:15:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:15:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:15:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:15:04,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:15:04,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:15:04,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:15:04,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:15:04,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:15:04,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:15:04,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:15:04,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:15:04,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:15:04,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:15:04,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:15:04,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:15:04,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:15:04,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:15:04,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:15:04,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:15:04,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:15:04,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:15:04,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:15:04,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:15:04,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:15:04,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:15:04,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:15:04,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:15:04,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:15:04,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:15:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:15:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:15:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:15:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:15:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:15:04,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:15:04,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:15:04,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:15:04,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:15:04,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:15:04,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:15:04,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:15:04,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:15:04,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:15:04,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:15:04,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:15:04,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:15:04,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:15:04,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:15:04,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:15:04,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:15:04,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:15:04,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:15:04,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:15:04,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:15:04,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:15:04,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:15:04,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:15:04,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:15:04,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:15:04,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:15:04,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:15:04,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:15:04,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:15:04,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:15:04,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:15:04,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:15:04,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:15:04,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:15:04,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:04,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:04,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:04,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,137 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:15:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:15:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-29 03:15:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:15:04,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:15:04,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 54 letters. [2020-07-29 03:15:04,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:04,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 445 transitions. cyclomatic complexity: 150 [2020-07-29 03:15:04,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:04,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 0 states and 0 transitions. [2020-07-29 03:15:04,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:15:04,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:15:04,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:15:04,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:04,157 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:04,157 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:04,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:15:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:15:04,158 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:15:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:04,158 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:15:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:15:04,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:15:04,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:04,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:15:04,250 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:04,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:15:04,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:15:04,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:15:04,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:15:04,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:04,250 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:04,250 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:04,251 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:04,251 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:15:04,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:15:04,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:04,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:04,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:15:04 BoogieIcfgContainer [2020-07-29 03:15:04,258 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:15:04,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:15:04,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:15:04,259 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:15:04,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:14:55" (3/4) ... [2020-07-29 03:15:04,263 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:15:04,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:15:04,266 INFO L168 Benchmark]: Toolchain (without parser) took 10445.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:04,266 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:15:04,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:04,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:04,268 INFO L168 Benchmark]: Boogie Preprocessor took 85.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:04,269 INFO L168 Benchmark]: RCFGBuilder took 1164.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.1 MB in the end (delta: 89.4 MB). Peak memory consumption was 89.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:04,270 INFO L168 Benchmark]: BuchiAutomizer took 8600.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 970.1 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:15:04,270 INFO L168 Benchmark]: Witness Printer took 4.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:15:04,274 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.29 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 488.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1164.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.1 MB in the end (delta: 89.4 MB). Peak memory consumption was 89.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8600.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 970.1 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 8.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 68 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 177 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 854 SDtfs, 457 SDslu, 1505 SDs, 0 SdLazy, 55 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax128 hnf105 lsp22 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...