./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.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 59aeabadcd37f069ef73b3fff4485416c19fc579 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17:46,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:17:46,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:17:46,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:17:46,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:17:46,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:17:46,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:17:46,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:17:46,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:17:46,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:17:46,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:17:46,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:17:46,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:17:46,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:17:46,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:17:46,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:17:46,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:17:46,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:17:46,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:17:46,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:17:46,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:17:46,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:17:46,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:17:46,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:17:46,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:17:46,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:17:46,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:17:46,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:17:46,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:17:46,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:17:46,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:17:46,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:17:46,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:17:46,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:17:46,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:17:46,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:17:46,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:17:46,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:17:46,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:17:46,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:17:46,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:17:46,579 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:17:46,597 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:17:46,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:17:46,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:17:46,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:17:46,599 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:17:46,599 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:17:46,599 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:17:46,600 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:17:46,600 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:17:46,600 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:17:46,601 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:17:46,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:17:46,601 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:17:46,601 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:17:46,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:17:46,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:17:46,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:17:46,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:17:46,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:17:46,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:17:46,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:17:46,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:17:46,604 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:17:46,604 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:17:46,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:17:46,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:17:46,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:17:46,605 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:17:46,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:17:46,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:17:46,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:17:46,606 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:17:46,608 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:17:46,608 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 -> 59aeabadcd37f069ef73b3fff4485416c19fc579 [2020-07-29 03:17:46,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:17:46,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:17:46,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:17:46,933 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:17:46,933 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:17:46,934 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:46,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3a28c83/47054737236a46d8b9574b3f1b52d05a/FLAGef2891462 [2020-07-29 03:17:47,471 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:17:47,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:47,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3a28c83/47054737236a46d8b9574b3f1b52d05a/FLAGef2891462 [2020-07-29 03:17:47,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3a28c83/47054737236a46d8b9574b3f1b52d05a [2020-07-29 03:17:47,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:17:47,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:17:47,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:47,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:17:47,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:17:47,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:47" (1/1) ... [2020-07-29 03:17:47,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b56b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:47, skipping insertion in model container [2020-07-29 03:17:47,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:47" (1/1) ... [2020-07-29 03:17:47,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:17:47,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:17:48,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:48,159 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:17:48,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:48,386 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:17:48,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48 WrapperNode [2020-07-29 03:17:48,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:48,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:48,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:17:48,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:17:48,397 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:17:48" (1/1) ... [2020-07-29 03:17:48,409 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:17:48" (1/1) ... [2020-07-29 03:17:48,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:48,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:17:48,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:17:48,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:17:48,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (1/1) ... [2020-07-29 03:17:48,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:17:48,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:17:48,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:17:48,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:17:48,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (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:17:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:17:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:17:49,631 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:17:49,631 INFO L295 CfgBuilder]: Removed 25 assume(true) statements. [2020-07-29 03:17:49,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:49 BoogieIcfgContainer [2020-07-29 03:17:49,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:17:49,638 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:17:49,638 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:17:49,642 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:17:49,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:49,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:17:47" (1/3) ... [2020-07-29 03:17:49,645 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50f88500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:49, skipping insertion in model container [2020-07-29 03:17:49,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:49,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:48" (2/3) ... [2020-07-29 03:17:49,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50f88500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:49, skipping insertion in model container [2020-07-29 03:17:49,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:49,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:49" (3/3) ... [2020-07-29 03:17:49,648 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:49,700 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:17:49,700 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:17:49,701 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:17:49,701 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:17:49,702 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:17:49,702 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:17:49,702 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:17:49,702 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:17:49,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states. [2020-07-29 03:17:49,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-07-29 03:17:49,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:49,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:49,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:49,795 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:49,795 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:17:49,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states. [2020-07-29 03:17:49,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-07-29 03:17:49,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:49,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:49,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:49,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:49,824 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 8#L332true assume !(0 == ~r1~0);init_~tmp~0 := 0; 10#L332-1true init_#res := init_~tmp~0; 16#L497true main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 53#L67true assume 0 == assume_abort_if_not_~cond;assume false; 106#L66true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 69#L573-2true [2020-07-29 03:17:49,825 INFO L796 eck$LassoCheckResult]: Loop: 69#L573-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 121#L129true assume !(0 != ~mode1~0 % 256); 24#L147true assume !(0 != ~alive1~0 % 256); 23#L147-2true ~mode1~0 := 1; 116#L129-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 31#L161true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 18#L164true assume !(node2_~m2~0 != ~nomsg~0); 17#L164-1true ~mode2~0 := 0; 29#L161-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 125#L195true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 97#L198true assume !(node3_~m3~0 != ~nomsg~0); 92#L198-1true ~mode3~0 := 0; 122#L195-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 57#L229true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 48#L232true assume !(node4_~m4~0 != ~nomsg~0); 47#L232-1true ~mode4~0 := 0; 71#L229-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 9#L263true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 13#L266true assume !(node5_~m5~0 != ~nomsg~0); 133#L266-1true ~mode5~0 := 0; 3#L263-2true havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 99#L297true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 105#L300true assume !(node6_~m6~0 != ~nomsg~0); 103#L300-1true ~mode6~0 := 0; 98#L297-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 21#L505true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 22#L505-1true check_#res := check_~tmp~1; 126#L517true main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 66#L606true assume !(0 == assert_~arg % 256); 42#L601true main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 69#L573-2true [2020-07-29 03:17:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2020-07-29 03:17:49,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:49,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171889173] [2020-07-29 03:17:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:50,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {145#true} is VALID [2020-07-29 03:17:50,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {145#true} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {145#true} is VALID [2020-07-29 03:17:50,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {145#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {145#true} is VALID [2020-07-29 03:17:50,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {145#true} init_#res := init_~tmp~0; {145#true} is VALID [2020-07-29 03:17:50,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {145#true} main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {145#true} is VALID [2020-07-29 03:17:50,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {145#true} assume 0 == assume_abort_if_not_~cond;assume false; {146#false} is VALID [2020-07-29 03:17:50,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {146#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {146#false} is VALID [2020-07-29 03:17:50,039 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:17:50,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171889173] [2020-07-29 03:17:50,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:50,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:17:50,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609292313] [2020-07-29 03:17:50,047 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash 225391629, now seen corresponding path program 1 times [2020-07-29 03:17:50,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:50,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551230264] [2020-07-29 03:17:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:50,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {147#true} assume !(0 != ~mode1~0 % 256); {147#true} is VALID [2020-07-29 03:17:50,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {147#true} assume !(0 != ~alive1~0 % 256); {147#true} is VALID [2020-07-29 03:17:50,292 INFO L280 TraceCheckUtils]: 3: Hoare triple {147#true} ~mode1~0 := 1; {147#true} is VALID [2020-07-29 03:17:50,292 INFO L280 TraceCheckUtils]: 4: Hoare triple {147#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,292 INFO L280 TraceCheckUtils]: 5: Hoare triple {147#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,293 INFO L280 TraceCheckUtils]: 6: Hoare triple {147#true} assume !(node2_~m2~0 != ~nomsg~0); {147#true} is VALID [2020-07-29 03:17:50,293 INFO L280 TraceCheckUtils]: 7: Hoare triple {147#true} ~mode2~0 := 0; {147#true} is VALID [2020-07-29 03:17:50,294 INFO L280 TraceCheckUtils]: 8: Hoare triple {147#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,295 INFO L280 TraceCheckUtils]: 9: Hoare triple {147#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {147#true} assume !(node3_~m3~0 != ~nomsg~0); {147#true} is VALID [2020-07-29 03:17:50,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {147#true} ~mode3~0 := 0; {147#true} is VALID [2020-07-29 03:17:50,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {147#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {147#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,298 INFO L280 TraceCheckUtils]: 14: Hoare triple {147#true} assume !(node4_~m4~0 != ~nomsg~0); {147#true} is VALID [2020-07-29 03:17:50,298 INFO L280 TraceCheckUtils]: 15: Hoare triple {147#true} ~mode4~0 := 0; {147#true} is VALID [2020-07-29 03:17:50,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {147#true} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,301 INFO L280 TraceCheckUtils]: 17: Hoare triple {147#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,302 INFO L280 TraceCheckUtils]: 18: Hoare triple {147#true} assume !(node5_~m5~0 != ~nomsg~0); {147#true} is VALID [2020-07-29 03:17:50,302 INFO L280 TraceCheckUtils]: 19: Hoare triple {147#true} ~mode5~0 := 0; {147#true} is VALID [2020-07-29 03:17:50,303 INFO L280 TraceCheckUtils]: 20: Hoare triple {147#true} havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,303 INFO L280 TraceCheckUtils]: 21: Hoare triple {147#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {147#true} is VALID [2020-07-29 03:17:50,304 INFO L280 TraceCheckUtils]: 22: Hoare triple {147#true} assume !(node6_~m6~0 != ~nomsg~0); {147#true} is VALID [2020-07-29 03:17:50,304 INFO L280 TraceCheckUtils]: 23: Hoare triple {147#true} ~mode6~0 := 0; {147#true} is VALID [2020-07-29 03:17:50,305 INFO L280 TraceCheckUtils]: 24: Hoare triple {147#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {147#true} is VALID [2020-07-29 03:17:50,306 INFO L280 TraceCheckUtils]: 25: Hoare triple {147#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {149#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:50,308 INFO L280 TraceCheckUtils]: 26: Hoare triple {149#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {150#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:50,310 INFO L280 TraceCheckUtils]: 27: Hoare triple {150#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {151#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:50,311 INFO L280 TraceCheckUtils]: 28: Hoare triple {151#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {148#false} is VALID [2020-07-29 03:17:50,312 INFO L280 TraceCheckUtils]: 29: Hoare triple {148#false} main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; {148#false} is VALID [2020-07-29 03:17:50,321 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:17:50,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551230264] [2020-07-29 03:17:50,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:50,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:50,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249899064] [2020-07-29 03:17:50,326 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:50,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:50,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 03:17:50,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 03:17:50,348 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2020-07-29 03:17:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:50,562 INFO L93 Difference]: Finished difference Result 141 states and 237 transitions. [2020-07-29 03:17:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:50,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:17:50,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:50,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 237 transitions. [2020-07-29 03:17:50,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:17:50,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 136 states and 232 transitions. [2020-07-29 03:17:50,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2020-07-29 03:17:50,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2020-07-29 03:17:50,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 232 transitions. [2020-07-29 03:17:50,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:50,615 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2020-07-29 03:17:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 232 transitions. [2020-07-29 03:17:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-07-29 03:17:50,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:50,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states and 232 transitions. Second operand 136 states. [2020-07-29 03:17:50,660 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states and 232 transitions. Second operand 136 states. [2020-07-29 03:17:50,661 INFO L87 Difference]: Start difference. First operand 136 states and 232 transitions. Second operand 136 states. [2020-07-29 03:17:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:50,670 INFO L93 Difference]: Finished difference Result 136 states and 232 transitions. [2020-07-29 03:17:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 232 transitions. [2020-07-29 03:17:50,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:50,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:50,674 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states and 232 transitions. [2020-07-29 03:17:50,674 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states and 232 transitions. [2020-07-29 03:17:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:50,682 INFO L93 Difference]: Finished difference Result 136 states and 232 transitions. [2020-07-29 03:17:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 232 transitions. [2020-07-29 03:17:50,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:50,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:50,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:50,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-29 03:17:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 232 transitions. [2020-07-29 03:17:50,694 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2020-07-29 03:17:50,694 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2020-07-29 03:17:50,695 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:17:50,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 232 transitions. [2020-07-29 03:17:50,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:17:50,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:50,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:50,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:50,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:50,699 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 308#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 302#L332 assume !(0 == ~r1~0);init_~tmp~0 := 0; 296#L332-1 init_#res := init_~tmp~0; 307#L497 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 316#L67 assume !(0 == assume_abort_if_not_~cond); 381#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 359#L573-2 [2020-07-29 03:17:50,700 INFO L796 eck$LassoCheckResult]: Loop: 359#L573-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 400#L129 assume !(0 != ~mode1~0 % 256); 329#L147 assume !(0 != ~alive1~0 % 256); 327#L147-2 ~mode1~0 := 1; 328#L129-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 342#L161 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 319#L164 assume !(node2_~m2~0 != ~nomsg~0); 317#L164-1 ~mode2~0 := 0; 318#L161-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 338#L195 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 417#L198 assume !(node3_~m3~0 != ~nomsg~0); 369#L198-1 ~mode3~0 := 0; 407#L195-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 386#L229 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 372#L232 assume !(node4_~m4~0 != ~nomsg~0); 371#L232-1 ~mode4~0 := 0; 349#L229-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 304#L263 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 306#L266 assume !(node5_~m5~0 != ~nomsg~0); 311#L266-1 ~mode5~0 := 0; 293#L263-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 294#L297 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 418#L300 assume !(node6_~m6~0 != ~nomsg~0); 379#L300-1 ~mode6~0 := 0; 399#L297-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 323#L505 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 324#L505-1 check_#res := check_~tmp~1; 326#L517 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 395#L606 assume !(0 == assert_~arg % 256); 358#L601 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 359#L573-2 [2020-07-29 03:17:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2020-07-29 03:17:50,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:50,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833327527] [2020-07-29 03:17:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:50,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {704#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {704#true} is VALID [2020-07-29 03:17:50,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {704#true} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {704#true} is VALID [2020-07-29 03:17:50,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {704#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {706#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:17:50,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {706#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {707#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:17:50,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {707#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {708#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:17:50,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {708#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {705#false} is VALID [2020-07-29 03:17:50,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {705#false} is VALID [2020-07-29 03:17:50,827 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:17:50,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833327527] [2020-07-29 03:17:50,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:50,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:50,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328718516] [2020-07-29 03:17:50,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash 225391629, now seen corresponding path program 2 times [2020-07-29 03:17:50,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:50,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835759839] [2020-07-29 03:17:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:51,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {709#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {709#true} assume !(0 != ~mode1~0 % 256); {709#true} is VALID [2020-07-29 03:17:51,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {709#true} assume !(0 != ~alive1~0 % 256); {709#true} is VALID [2020-07-29 03:17:51,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {709#true} ~mode1~0 := 1; {709#true} is VALID [2020-07-29 03:17:51,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {709#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {709#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,028 INFO L280 TraceCheckUtils]: 6: Hoare triple {709#true} assume !(node2_~m2~0 != ~nomsg~0); {709#true} is VALID [2020-07-29 03:17:51,028 INFO L280 TraceCheckUtils]: 7: Hoare triple {709#true} ~mode2~0 := 0; {709#true} is VALID [2020-07-29 03:17:51,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {709#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {709#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,029 INFO L280 TraceCheckUtils]: 10: Hoare triple {709#true} assume !(node3_~m3~0 != ~nomsg~0); {709#true} is VALID [2020-07-29 03:17:51,029 INFO L280 TraceCheckUtils]: 11: Hoare triple {709#true} ~mode3~0 := 0; {709#true} is VALID [2020-07-29 03:17:51,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {709#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {709#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,030 INFO L280 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(node4_~m4~0 != ~nomsg~0); {709#true} is VALID [2020-07-29 03:17:51,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {709#true} ~mode4~0 := 0; {709#true} is VALID [2020-07-29 03:17:51,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {709#true} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {709#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,031 INFO L280 TraceCheckUtils]: 18: Hoare triple {709#true} assume !(node5_~m5~0 != ~nomsg~0); {709#true} is VALID [2020-07-29 03:17:51,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {709#true} ~mode5~0 := 0; {709#true} is VALID [2020-07-29 03:17:51,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#true} havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {709#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {709#true} is VALID [2020-07-29 03:17:51,033 INFO L280 TraceCheckUtils]: 22: Hoare triple {709#true} assume !(node6_~m6~0 != ~nomsg~0); {709#true} is VALID [2020-07-29 03:17:51,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {709#true} ~mode6~0 := 0; {709#true} is VALID [2020-07-29 03:17:51,033 INFO L280 TraceCheckUtils]: 24: Hoare triple {709#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {709#true} is VALID [2020-07-29 03:17:51,034 INFO L280 TraceCheckUtils]: 25: Hoare triple {709#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {711#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:51,036 INFO L280 TraceCheckUtils]: 26: Hoare triple {711#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {712#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:51,037 INFO L280 TraceCheckUtils]: 27: Hoare triple {712#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {713#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:51,039 INFO L280 TraceCheckUtils]: 28: Hoare triple {713#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {710#false} is VALID [2020-07-29 03:17:51,039 INFO L280 TraceCheckUtils]: 29: Hoare triple {710#false} main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; {710#false} is VALID [2020-07-29 03:17:51,041 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:17:51,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835759839] [2020-07-29 03:17:51,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:51,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:51,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052551404] [2020-07-29 03:17:51,043 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:51,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:51,045 INFO L87 Difference]: Start difference. First operand 136 states and 232 transitions. cyclomatic complexity: 97 Second operand 5 states. [2020-07-29 03:17:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:51,750 INFO L93 Difference]: Finished difference Result 139 states and 234 transitions. [2020-07-29 03:17:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:51,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:51,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:51,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 234 transitions. [2020-07-29 03:17:51,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:17:51,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 191 transitions. [2020-07-29 03:17:51,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2020-07-29 03:17:51,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2020-07-29 03:17:51,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 191 transitions. [2020-07-29 03:17:51,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:51,790 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2020-07-29 03:17:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 191 transitions. [2020-07-29 03:17:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-07-29 03:17:51,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:51,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states and 191 transitions. Second operand 136 states. [2020-07-29 03:17:51,798 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states and 191 transitions. Second operand 136 states. [2020-07-29 03:17:51,799 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand 136 states. [2020-07-29 03:17:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:51,805 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2020-07-29 03:17:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2020-07-29 03:17:51,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:51,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:51,807 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states and 191 transitions. [2020-07-29 03:17:51,807 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states and 191 transitions. [2020-07-29 03:17:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:51,813 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2020-07-29 03:17:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2020-07-29 03:17:51,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:51,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:51,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:51,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-29 03:17:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2020-07-29 03:17:51,821 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2020-07-29 03:17:51,821 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2020-07-29 03:17:51,822 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:17:51,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 191 transitions. [2020-07-29 03:17:51,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:17:51,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:51,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:51,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:51,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:51,827 INFO L794 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 872#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 868#L332 assume 0 == ~r1~0; 869#L333 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 929#L334 assume ~id1~0 >= 0; 930#L335 assume 0 == ~st1~0; 978#L336 assume ~send1~0 == ~id1~0; 914#L337 assume 0 == ~mode1~0 % 256; 915#L338 assume ~id2~0 >= 0; 961#L339 assume 0 == ~st2~0; 873#L340 assume ~send2~0 == ~id2~0; 874#L341 assume 0 == ~mode2~0 % 256; 954#L342 assume ~id3~0 >= 0; 863#L343 assume 0 == ~st3~0; 864#L344 assume ~send3~0 == ~id3~0; 924#L345 assume 0 == ~mode3~0 % 256; 925#L346 assume ~id4~0 >= 0; 977#L347 assume 0 == ~st4~0; 912#L348 assume ~send4~0 == ~id4~0; 913#L349 assume 0 == ~mode4~0 % 256; 960#L350 assume ~id5~0 >= 0; 900#L351 assume 0 == ~st5~0; 901#L352 assume ~send5~0 == ~id5~0; 953#L353 assume 0 == ~mode5~0 % 256; 861#L354 assume ~id6~0 >= 0; 862#L355 assume 0 == ~st6~0; 920#L356 assume ~send6~0 == ~id6~0; 921#L357 assume 0 == ~mode6~0 % 256; 976#L358 assume ~id1~0 != ~id2~0; 908#L359 assume ~id1~0 != ~id3~0; 909#L360 assume ~id1~0 != ~id4~0; 958#L361 assume ~id1~0 != ~id5~0; 898#L362 assume ~id1~0 != ~id6~0; 899#L363 assume ~id2~0 != ~id3~0; 952#L364 assume ~id2~0 != ~id4~0; 859#L365 assume ~id2~0 != ~id5~0; 860#L366 assume ~id2~0 != ~id6~0; 946#L367 assume ~id3~0 != ~id4~0; 947#L368 assume ~id3~0 != ~id5~0; 974#L369 assume ~id3~0 != ~id6~0; 906#L370 assume ~id4~0 != ~id5~0; 907#L371 assume ~id4~0 != ~id6~0; 957#L372 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 870#L332-1 init_#res := init_~tmp~0; 871#L497 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 880#L67 assume !(0 == assume_abort_if_not_~cond); 945#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 923#L573-2 [2020-07-29 03:17:51,827 INFO L796 eck$LassoCheckResult]: Loop: 923#L573-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 963#L129 assume !(0 != ~mode1~0 % 256); 893#L147 assume !(0 != ~alive1~0 % 256); 891#L147-2 ~mode1~0 := 1; 892#L129-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 904#L161 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 883#L164 assume !(node2_~m2~0 != ~nomsg~0); 881#L164-1 ~mode2~0 := 0; 882#L161-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 902#L195 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 981#L198 assume !(node3_~m3~0 != ~nomsg~0); 933#L198-1 ~mode3~0 := 0; 971#L195-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 950#L229 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 936#L232 assume !(node4_~m4~0 != ~nomsg~0); 935#L232-1 ~mode4~0 := 0; 911#L229-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 865#L263 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 867#L266 assume !(node5_~m5~0 != ~nomsg~0); 875#L266-1 ~mode5~0 := 0; 857#L263-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 858#L297 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 982#L300 assume !(node6_~m6~0 != ~nomsg~0); 943#L300-1 ~mode6~0 := 0; 964#L297-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 887#L505 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 888#L505-1 check_#res := check_~tmp~1; 890#L517 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 959#L606 assume !(0 == assert_~arg % 256); 922#L601 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 923#L573-2 [2020-07-29 03:17:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2020-07-29 03:17:51,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:51,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239815833] [2020-07-29 03:17:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:51,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:51,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:52,004 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash 225391629, now seen corresponding path program 3 times [2020-07-29 03:17:52,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:52,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824491513] [2020-07-29 03:17:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:52,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {1270#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {1270#true} assume !(0 != ~mode1~0 % 256); {1270#true} is VALID [2020-07-29 03:17:52,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {1270#true} assume !(0 != ~alive1~0 % 256); {1270#true} is VALID [2020-07-29 03:17:52,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {1270#true} ~mode1~0 := 1; {1270#true} is VALID [2020-07-29 03:17:52,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {1270#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {1270#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,104 INFO L280 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !(node2_~m2~0 != ~nomsg~0); {1270#true} is VALID [2020-07-29 03:17:52,104 INFO L280 TraceCheckUtils]: 7: Hoare triple {1270#true} ~mode2~0 := 0; {1270#true} is VALID [2020-07-29 03:17:52,104 INFO L280 TraceCheckUtils]: 8: Hoare triple {1270#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {1270#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,105 INFO L280 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !(node3_~m3~0 != ~nomsg~0); {1270#true} is VALID [2020-07-29 03:17:52,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {1270#true} ~mode3~0 := 0; {1270#true} is VALID [2020-07-29 03:17:52,106 INFO L280 TraceCheckUtils]: 12: Hoare triple {1270#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,106 INFO L280 TraceCheckUtils]: 13: Hoare triple {1270#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,106 INFO L280 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(node4_~m4~0 != ~nomsg~0); {1270#true} is VALID [2020-07-29 03:17:52,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {1270#true} ~mode4~0 := 0; {1270#true} is VALID [2020-07-29 03:17:52,107 INFO L280 TraceCheckUtils]: 16: Hoare triple {1270#true} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,107 INFO L280 TraceCheckUtils]: 17: Hoare triple {1270#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,107 INFO L280 TraceCheckUtils]: 18: Hoare triple {1270#true} assume !(node5_~m5~0 != ~nomsg~0); {1270#true} is VALID [2020-07-29 03:17:52,107 INFO L280 TraceCheckUtils]: 19: Hoare triple {1270#true} ~mode5~0 := 0; {1270#true} is VALID [2020-07-29 03:17:52,108 INFO L280 TraceCheckUtils]: 20: Hoare triple {1270#true} havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {1270#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1270#true} is VALID [2020-07-29 03:17:52,108 INFO L280 TraceCheckUtils]: 22: Hoare triple {1270#true} assume !(node6_~m6~0 != ~nomsg~0); {1270#true} is VALID [2020-07-29 03:17:52,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {1270#true} ~mode6~0 := 0; {1270#true} is VALID [2020-07-29 03:17:52,109 INFO L280 TraceCheckUtils]: 24: Hoare triple {1270#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1270#true} is VALID [2020-07-29 03:17:52,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {1270#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {1272#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:52,111 INFO L280 TraceCheckUtils]: 26: Hoare triple {1272#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {1273#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:52,112 INFO L280 TraceCheckUtils]: 27: Hoare triple {1273#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1274#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:52,114 INFO L280 TraceCheckUtils]: 28: Hoare triple {1274#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {1271#false} is VALID [2020-07-29 03:17:52,114 INFO L280 TraceCheckUtils]: 29: Hoare triple {1271#false} main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; {1271#false} is VALID [2020-07-29 03:17:52,115 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:17:52,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824491513] [2020-07-29 03:17:52,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:52,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:52,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366415647] [2020-07-29 03:17:52,117 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:52,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:52,117 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. cyclomatic complexity: 56 Second operand 5 states. [2020-07-29 03:17:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:52,700 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2020-07-29 03:17:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:52,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:52,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:52,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 193 transitions. [2020-07-29 03:17:52,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:17:52,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 189 transitions. [2020-07-29 03:17:52,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2020-07-29 03:17:52,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2020-07-29 03:17:52,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 189 transitions. [2020-07-29 03:17:52,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:52,756 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2020-07-29 03:17:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 189 transitions. [2020-07-29 03:17:52,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-07-29 03:17:52,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:52,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states and 189 transitions. Second operand 136 states. [2020-07-29 03:17:52,776 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states and 189 transitions. Second operand 136 states. [2020-07-29 03:17:52,776 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand 136 states. [2020-07-29 03:17:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:52,781 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2020-07-29 03:17:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2020-07-29 03:17:52,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:52,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:52,782 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states and 189 transitions. [2020-07-29 03:17:52,782 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states and 189 transitions. [2020-07-29 03:17:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:52,787 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2020-07-29 03:17:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2020-07-29 03:17:52,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:52,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:52,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:52,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-29 03:17:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2020-07-29 03:17:52,794 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2020-07-29 03:17:52,794 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2020-07-29 03:17:52,794 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:17:52,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 189 transitions. [2020-07-29 03:17:52,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:17:52,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:52,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:52,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:52,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:52,803 INFO L794 eck$LassoCheckResult]: Stem: 1545#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 1435#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 1429#L332 assume 0 == ~r1~0; 1430#L333 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1490#L334 assume ~id1~0 >= 0; 1491#L335 assume 0 == ~st1~0; 1539#L336 assume ~send1~0 == ~id1~0; 1475#L337 assume 0 == ~mode1~0 % 256; 1476#L338 assume ~id2~0 >= 0; 1522#L339 assume 0 == ~st2~0; 1433#L340 assume ~send2~0 == ~id2~0; 1434#L341 assume 0 == ~mode2~0 % 256; 1515#L342 assume ~id3~0 >= 0; 1424#L343 assume 0 == ~st3~0; 1425#L344 assume ~send3~0 == ~id3~0; 1483#L345 assume 0 == ~mode3~0 % 256; 1484#L346 assume ~id4~0 >= 0; 1538#L347 assume 0 == ~st4~0; 1471#L348 assume ~send4~0 == ~id4~0; 1472#L349 assume 0 == ~mode4~0 % 256; 1520#L350 assume ~id5~0 >= 0; 1461#L351 assume 0 == ~st5~0; 1462#L352 assume ~send5~0 == ~id5~0; 1514#L353 assume 0 == ~mode5~0 % 256; 1422#L354 assume ~id6~0 >= 0; 1423#L355 assume 0 == ~st6~0; 1481#L356 assume ~send6~0 == ~id6~0; 1482#L357 assume 0 == ~mode6~0 % 256; 1536#L358 assume ~id1~0 != ~id2~0; 1469#L359 assume ~id1~0 != ~id3~0; 1470#L360 assume ~id1~0 != ~id4~0; 1519#L361 assume ~id1~0 != ~id5~0; 1458#L362 assume ~id1~0 != ~id6~0; 1459#L363 assume ~id2~0 != ~id3~0; 1513#L364 assume ~id2~0 != ~id4~0; 1420#L365 assume ~id2~0 != ~id5~0; 1421#L366 assume ~id2~0 != ~id6~0; 1507#L367 assume ~id3~0 != ~id4~0; 1508#L368 assume ~id3~0 != ~id5~0; 1535#L369 assume ~id3~0 != ~id6~0; 1465#L370 assume ~id4~0 != ~id5~0; 1466#L371 assume ~id4~0 != ~id6~0; 1518#L372 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 1431#L332-1 init_#res := init_~tmp~0; 1432#L497 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1441#L67 assume !(0 == assume_abort_if_not_~cond); 1506#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 1486#L573-2 [2020-07-29 03:17:52,804 INFO L796 eck$LassoCheckResult]: Loop: 1486#L573-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1524#L129 assume !(0 != ~mode1~0 % 256); 1454#L147 assume !(0 != ~alive1~0 % 256); 1452#L147-2 ~mode1~0 := 1; 1453#L129-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1467#L161 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1444#L164 assume !(node2_~m2~0 != ~nomsg~0); 1442#L164-1 ~mode2~0 := 0; 1443#L161-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1463#L195 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1542#L198 assume !(node3_~m3~0 != ~nomsg~0); 1494#L198-1 ~mode3~0 := 0; 1532#L195-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1511#L229 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1497#L232 assume !(node4_~m4~0 != ~nomsg~0); 1496#L232-1 ~mode4~0 := 0; 1474#L229-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1426#L263 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1428#L266 assume !(node5_~m5~0 != ~nomsg~0); 1436#L266-1 ~mode5~0 := 0; 1418#L263-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1419#L297 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1543#L300 assume !(node6_~m6~0 != ~nomsg~0); 1504#L300-1 ~mode6~0 := 0; 1525#L297-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1448#L505 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1449#L506 assume ~r1~0 < 6;check_~tmp~1 := 1; 1450#L505-1 check_#res := check_~tmp~1; 1451#L517 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1521#L606 assume !(0 == assert_~arg % 256); 1485#L601 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 1486#L573-2 [2020-07-29 03:17:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2020-07-29 03:17:52,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:52,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90271387] [2020-07-29 03:17:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:52,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:52,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:52,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1986121047, now seen corresponding path program 1 times [2020-07-29 03:17:52,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:52,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123244651] [2020-07-29 03:17:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:52,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:52,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:52,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1111090168, now seen corresponding path program 1 times [2020-07-29 03:17:52,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:52,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176314946] [2020-07-29 03:17:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:53,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {1833#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1833#true} is VALID [2020-07-29 03:17:53,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {1833#true} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1833#true} is VALID [2020-07-29 03:17:53,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {1833#true} assume 0 == ~r1~0; {1833#true} is VALID [2020-07-29 03:17:53,101 INFO L280 TraceCheckUtils]: 3: Hoare triple {1833#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1833#true} is VALID [2020-07-29 03:17:53,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {1833#true} assume ~id1~0 >= 0; {1833#true} is VALID [2020-07-29 03:17:53,101 INFO L280 TraceCheckUtils]: 5: Hoare triple {1833#true} assume 0 == ~st1~0; {1833#true} is VALID [2020-07-29 03:17:53,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {1833#true} assume ~send1~0 == ~id1~0; {1833#true} is VALID [2020-07-29 03:17:53,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {1833#true} assume 0 == ~mode1~0 % 256; {1833#true} is VALID [2020-07-29 03:17:53,102 INFO L280 TraceCheckUtils]: 8: Hoare triple {1833#true} assume ~id2~0 >= 0; {1833#true} is VALID [2020-07-29 03:17:53,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {1833#true} assume 0 == ~st2~0; {1833#true} is VALID [2020-07-29 03:17:53,102 INFO L280 TraceCheckUtils]: 10: Hoare triple {1833#true} assume ~send2~0 == ~id2~0; {1833#true} is VALID [2020-07-29 03:17:53,104 INFO L280 TraceCheckUtils]: 11: Hoare triple {1833#true} assume 0 == ~mode2~0 % 256; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,106 INFO L280 TraceCheckUtils]: 12: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 >= 0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,109 INFO L280 TraceCheckUtils]: 13: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st3~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,111 INFO L280 TraceCheckUtils]: 14: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send3~0 == ~id3~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,112 INFO L280 TraceCheckUtils]: 15: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode3~0 % 256; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,113 INFO L280 TraceCheckUtils]: 16: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 >= 0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,114 INFO L280 TraceCheckUtils]: 17: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st4~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,114 INFO L280 TraceCheckUtils]: 18: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send4~0 == ~id4~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode4~0 % 256; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,116 INFO L280 TraceCheckUtils]: 20: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id5~0 >= 0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,116 INFO L280 TraceCheckUtils]: 21: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st5~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,117 INFO L280 TraceCheckUtils]: 22: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send5~0 == ~id5~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,117 INFO L280 TraceCheckUtils]: 23: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode5~0 % 256; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,118 INFO L280 TraceCheckUtils]: 24: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id6~0 >= 0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,119 INFO L280 TraceCheckUtils]: 25: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st6~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,119 INFO L280 TraceCheckUtils]: 26: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send6~0 == ~id6~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,120 INFO L280 TraceCheckUtils]: 27: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode6~0 % 256; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,121 INFO L280 TraceCheckUtils]: 28: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id2~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,121 INFO L280 TraceCheckUtils]: 29: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id3~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,122 INFO L280 TraceCheckUtils]: 30: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id4~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,123 INFO L280 TraceCheckUtils]: 31: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id5~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,123 INFO L280 TraceCheckUtils]: 32: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id6~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,124 INFO L280 TraceCheckUtils]: 33: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id3~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,125 INFO L280 TraceCheckUtils]: 34: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id4~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,125 INFO L280 TraceCheckUtils]: 35: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id5~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,126 INFO L280 TraceCheckUtils]: 36: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id6~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,127 INFO L280 TraceCheckUtils]: 37: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id4~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,127 INFO L280 TraceCheckUtils]: 38: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id5~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,128 INFO L280 TraceCheckUtils]: 39: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id6~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,128 INFO L280 TraceCheckUtils]: 40: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 != ~id5~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,129 INFO L280 TraceCheckUtils]: 41: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 != ~id6~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,130 INFO L280 TraceCheckUtils]: 42: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,130 INFO L280 TraceCheckUtils]: 43: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} init_#res := init_~tmp~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,131 INFO L280 TraceCheckUtils]: 44: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,132 INFO L280 TraceCheckUtils]: 45: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 == assume_abort_if_not_~cond); {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,132 INFO L280 TraceCheckUtils]: 46: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,133 INFO L280 TraceCheckUtils]: 47: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,134 INFO L280 TraceCheckUtils]: 48: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~mode1~0 % 256); {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,134 INFO L280 TraceCheckUtils]: 49: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~alive1~0 % 256); {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,135 INFO L280 TraceCheckUtils]: 50: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~mode1~0 := 1; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,135 INFO L280 TraceCheckUtils]: 51: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:53,137 INFO L280 TraceCheckUtils]: 52: Hoare triple {1835#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,137 INFO L280 TraceCheckUtils]: 53: Hoare triple {1834#false} assume !(node2_~m2~0 != ~nomsg~0); {1834#false} is VALID [2020-07-29 03:17:53,137 INFO L280 TraceCheckUtils]: 54: Hoare triple {1834#false} ~mode2~0 := 0; {1834#false} is VALID [2020-07-29 03:17:53,137 INFO L280 TraceCheckUtils]: 55: Hoare triple {1834#false} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,137 INFO L280 TraceCheckUtils]: 56: Hoare triple {1834#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,138 INFO L280 TraceCheckUtils]: 57: Hoare triple {1834#false} assume !(node3_~m3~0 != ~nomsg~0); {1834#false} is VALID [2020-07-29 03:17:53,138 INFO L280 TraceCheckUtils]: 58: Hoare triple {1834#false} ~mode3~0 := 0; {1834#false} is VALID [2020-07-29 03:17:53,138 INFO L280 TraceCheckUtils]: 59: Hoare triple {1834#false} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,139 INFO L280 TraceCheckUtils]: 60: Hoare triple {1834#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,139 INFO L280 TraceCheckUtils]: 61: Hoare triple {1834#false} assume !(node4_~m4~0 != ~nomsg~0); {1834#false} is VALID [2020-07-29 03:17:53,139 INFO L280 TraceCheckUtils]: 62: Hoare triple {1834#false} ~mode4~0 := 0; {1834#false} is VALID [2020-07-29 03:17:53,139 INFO L280 TraceCheckUtils]: 63: Hoare triple {1834#false} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,139 INFO L280 TraceCheckUtils]: 64: Hoare triple {1834#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,140 INFO L280 TraceCheckUtils]: 65: Hoare triple {1834#false} assume !(node5_~m5~0 != ~nomsg~0); {1834#false} is VALID [2020-07-29 03:17:53,140 INFO L280 TraceCheckUtils]: 66: Hoare triple {1834#false} ~mode5~0 := 0; {1834#false} is VALID [2020-07-29 03:17:53,140 INFO L280 TraceCheckUtils]: 67: Hoare triple {1834#false} havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,140 INFO L280 TraceCheckUtils]: 68: Hoare triple {1834#false} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1834#false} is VALID [2020-07-29 03:17:53,140 INFO L280 TraceCheckUtils]: 69: Hoare triple {1834#false} assume !(node6_~m6~0 != ~nomsg~0); {1834#false} is VALID [2020-07-29 03:17:53,141 INFO L280 TraceCheckUtils]: 70: Hoare triple {1834#false} ~mode6~0 := 0; {1834#false} is VALID [2020-07-29 03:17:53,141 INFO L280 TraceCheckUtils]: 71: Hoare triple {1834#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1834#false} is VALID [2020-07-29 03:17:53,142 INFO L280 TraceCheckUtils]: 72: Hoare triple {1834#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1834#false} is VALID [2020-07-29 03:17:53,142 INFO L280 TraceCheckUtils]: 73: Hoare triple {1834#false} assume ~r1~0 < 6;check_~tmp~1 := 1; {1834#false} is VALID [2020-07-29 03:17:53,142 INFO L280 TraceCheckUtils]: 74: Hoare triple {1834#false} check_#res := check_~tmp~1; {1834#false} is VALID [2020-07-29 03:17:53,142 INFO L280 TraceCheckUtils]: 75: Hoare triple {1834#false} main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1834#false} is VALID [2020-07-29 03:17:53,143 INFO L280 TraceCheckUtils]: 76: Hoare triple {1834#false} assume !(0 == assert_~arg % 256); {1834#false} is VALID [2020-07-29 03:17:53,143 INFO L280 TraceCheckUtils]: 77: Hoare triple {1834#false} main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; {1834#false} is VALID [2020-07-29 03:17:53,153 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:17:53,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176314946] [2020-07-29 03:17:53,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:53,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:17:53,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844936024] [2020-07-29 03:17:53,612 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 144 [2020-07-29 03:17:54,135 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 122 [2020-07-29 03:17:54,157 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:54,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:54,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:54,158 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:54,158 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:17:54,159 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:54,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:54,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:54,159 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:17:54,159 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:54,160 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:54,245 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:17:54,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:54,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:54,269 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:17:54,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:17:54,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:17:54,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:17:54,289 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:17:54,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:54,298 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:17:54,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:17:54,377 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:17:54,389 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:17:54,394 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:17:54,398 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:17:54,403 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:17:54,408 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:17:54,416 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:17:54,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:17:54,433 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:17:54,464 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:17:54,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:17:54,469 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:17:54,476 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:17:54,488 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:17:54,498 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:17:54,503 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:17:54,506 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:17:54,511 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:17:54,516 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:17:54,528 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:17:54,539 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:17:54,547 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:17:54,551 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:17:54,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:17:54,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:17:54,562 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:17:54,566 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:17:55,227 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 03:17:55,742 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 03:17:56,042 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:56,043 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:17:56,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:17:56,048 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:17:56,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:17:56,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:17:56,180 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:17:56,182 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:56,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:56,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:56,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:56,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:17:56,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:56,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:56,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:56,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:17:56,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:56,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:56,244 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:17:56,252 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:17:56,256 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:17:56,260 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:17:56,262 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:17:56,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:56,275 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:17:56,287 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:17:56,291 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:17:56,296 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:17:56,301 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:17:56,309 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:17:56,314 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:17:56,324 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:17:56,329 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:17:56,335 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:17:56,338 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:17:56,343 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:17:56,399 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:17:56,408 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:17:56,416 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:17:56,420 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:17:56,429 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:17:56,433 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:17:56,438 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:17:56,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:17:56,456 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:17:56,461 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:17:56,465 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:17:56,473 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:17:56,478 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:17:56,482 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:17:56,486 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:17:56,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:17:56,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:17:56,503 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:17:56,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:17:56,511 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:17:57,303 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 03:17:57,847 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 03:17:58,085 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:58,090 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) [2020-07-29 03:17:58,100 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:17:58,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,111 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:17:58,138 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:17:58,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:58,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:58,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,177 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:17:58,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,181 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) [2020-07-29 03:17:58,206 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,211 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:17:58,242 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:17:58,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:58,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:58,261 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:17:58,300 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:17:58,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,308 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:17:58,331 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:17:58,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,335 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) [2020-07-29 03:17:58,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:58,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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:17:58,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:58,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:58,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:58,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,423 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:17:58,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:58,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:58,429 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:17:58,453 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:17:58,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,460 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:17:58,484 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:17:58,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:58,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:58,492 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:17:58,515 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:17:58,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,545 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:17:58,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,571 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:17:58,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,598 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:17:58,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,625 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:17:58,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:58,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:58,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,656 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:17:58,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:58,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:58,709 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:17:58,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:58,756 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:17:58,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:58,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:58,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:58,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:58,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:58,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:58,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:17:58,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:17:58,771 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:58,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:17:58,786 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:17:58,786 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:17:58,787 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:58,831 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:17:58,844 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(0 != ~alive1~0 % 256);" "~mode1~0 := 1;" "havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~0 := 0;" "havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0 != ~nomsg~0);" "~mode6~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1;" "assume ~r1~0 < 6;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;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~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44;" [2020-07-29 03:17:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:59,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:17:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:59,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:59,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {1836#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1836#unseeded} is VALID [2020-07-29 03:17:59,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {1836#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {1836#unseeded} assume 0 == ~r1~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,099 INFO L280 TraceCheckUtils]: 3: Hoare triple {1836#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1836#unseeded} is VALID [2020-07-29 03:17:59,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {1836#unseeded} assume ~id1~0 >= 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,100 INFO L280 TraceCheckUtils]: 5: Hoare triple {1836#unseeded} assume 0 == ~st1~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {1836#unseeded} assume ~send1~0 == ~id1~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {1836#unseeded} assume 0 == ~mode1~0 % 256; {1836#unseeded} is VALID [2020-07-29 03:17:59,102 INFO L280 TraceCheckUtils]: 8: Hoare triple {1836#unseeded} assume ~id2~0 >= 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {1836#unseeded} assume 0 == ~st2~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,109 INFO L280 TraceCheckUtils]: 10: Hoare triple {1836#unseeded} assume ~send2~0 == ~id2~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,109 INFO L280 TraceCheckUtils]: 11: Hoare triple {1836#unseeded} assume 0 == ~mode2~0 % 256; {1836#unseeded} is VALID [2020-07-29 03:17:59,110 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#unseeded} assume ~id3~0 >= 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,111 INFO L280 TraceCheckUtils]: 13: Hoare triple {1836#unseeded} assume 0 == ~st3~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,111 INFO L280 TraceCheckUtils]: 14: Hoare triple {1836#unseeded} assume ~send3~0 == ~id3~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,112 INFO L280 TraceCheckUtils]: 15: Hoare triple {1836#unseeded} assume 0 == ~mode3~0 % 256; {1836#unseeded} is VALID [2020-07-29 03:17:59,112 INFO L280 TraceCheckUtils]: 16: Hoare triple {1836#unseeded} assume ~id4~0 >= 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,113 INFO L280 TraceCheckUtils]: 17: Hoare triple {1836#unseeded} assume 0 == ~st4~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,113 INFO L280 TraceCheckUtils]: 18: Hoare triple {1836#unseeded} assume ~send4~0 == ~id4~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,114 INFO L280 TraceCheckUtils]: 19: Hoare triple {1836#unseeded} assume 0 == ~mode4~0 % 256; {1836#unseeded} is VALID [2020-07-29 03:17:59,114 INFO L280 TraceCheckUtils]: 20: Hoare triple {1836#unseeded} assume ~id5~0 >= 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,115 INFO L280 TraceCheckUtils]: 21: Hoare triple {1836#unseeded} assume 0 == ~st5~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,115 INFO L280 TraceCheckUtils]: 22: Hoare triple {1836#unseeded} assume ~send5~0 == ~id5~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,123 INFO L280 TraceCheckUtils]: 23: Hoare triple {1836#unseeded} assume 0 == ~mode5~0 % 256; {1836#unseeded} is VALID [2020-07-29 03:17:59,123 INFO L280 TraceCheckUtils]: 24: Hoare triple {1836#unseeded} assume ~id6~0 >= 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,124 INFO L280 TraceCheckUtils]: 25: Hoare triple {1836#unseeded} assume 0 == ~st6~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,124 INFO L280 TraceCheckUtils]: 26: Hoare triple {1836#unseeded} assume ~send6~0 == ~id6~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,125 INFO L280 TraceCheckUtils]: 27: Hoare triple {1836#unseeded} assume 0 == ~mode6~0 % 256; {1836#unseeded} is VALID [2020-07-29 03:17:59,126 INFO L280 TraceCheckUtils]: 28: Hoare triple {1836#unseeded} assume ~id1~0 != ~id2~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,126 INFO L280 TraceCheckUtils]: 29: Hoare triple {1836#unseeded} assume ~id1~0 != ~id3~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,129 INFO L280 TraceCheckUtils]: 30: Hoare triple {1836#unseeded} assume ~id1~0 != ~id4~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,130 INFO L280 TraceCheckUtils]: 31: Hoare triple {1836#unseeded} assume ~id1~0 != ~id5~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,131 INFO L280 TraceCheckUtils]: 32: Hoare triple {1836#unseeded} assume ~id1~0 != ~id6~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,131 INFO L280 TraceCheckUtils]: 33: Hoare triple {1836#unseeded} assume ~id2~0 != ~id3~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,132 INFO L280 TraceCheckUtils]: 34: Hoare triple {1836#unseeded} assume ~id2~0 != ~id4~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,132 INFO L280 TraceCheckUtils]: 35: Hoare triple {1836#unseeded} assume ~id2~0 != ~id5~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,133 INFO L280 TraceCheckUtils]: 36: Hoare triple {1836#unseeded} assume ~id2~0 != ~id6~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,134 INFO L280 TraceCheckUtils]: 37: Hoare triple {1836#unseeded} assume ~id3~0 != ~id4~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,135 INFO L280 TraceCheckUtils]: 38: Hoare triple {1836#unseeded} assume ~id3~0 != ~id5~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,135 INFO L280 TraceCheckUtils]: 39: Hoare triple {1836#unseeded} assume ~id3~0 != ~id6~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,136 INFO L280 TraceCheckUtils]: 40: Hoare triple {1836#unseeded} assume ~id4~0 != ~id5~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,136 INFO L280 TraceCheckUtils]: 41: Hoare triple {1836#unseeded} assume ~id4~0 != ~id6~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,137 INFO L280 TraceCheckUtils]: 42: Hoare triple {1836#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1836#unseeded} is VALID [2020-07-29 03:17:59,137 INFO L280 TraceCheckUtils]: 43: Hoare triple {1836#unseeded} init_#res := init_~tmp~0; {1836#unseeded} is VALID [2020-07-29 03:17:59,138 INFO L280 TraceCheckUtils]: 44: Hoare triple {1836#unseeded} main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1836#unseeded} is VALID [2020-07-29 03:17:59,139 INFO L280 TraceCheckUtils]: 45: Hoare triple {1836#unseeded} assume !(0 == assume_abort_if_not_~cond); {1836#unseeded} is VALID [2020-07-29 03:17:59,139 INFO L280 TraceCheckUtils]: 46: Hoare triple {1836#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1836#unseeded} is VALID [2020-07-29 03:17:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:59,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:17:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:59,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:59,254 INFO L280 TraceCheckUtils]: 0: Hoare triple {1839#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23))} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode1~0 % 256); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~alive1~0 % 256); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 1; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,260 INFO L280 TraceCheckUtils]: 8: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,263 INFO L280 TraceCheckUtils]: 12: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,264 INFO L280 TraceCheckUtils]: 13: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,265 INFO L280 TraceCheckUtils]: 15: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,266 INFO L280 TraceCheckUtils]: 17: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,274 INFO L280 TraceCheckUtils]: 18: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,275 INFO L280 TraceCheckUtils]: 19: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,276 INFO L280 TraceCheckUtils]: 20: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,277 INFO L280 TraceCheckUtils]: 21: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,279 INFO L280 TraceCheckUtils]: 22: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node6_~m6~0 != ~nomsg~0); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,281 INFO L280 TraceCheckUtils]: 23: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode6~0 := 0; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,285 INFO L280 TraceCheckUtils]: 24: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,291 INFO L280 TraceCheckUtils]: 26: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 6;check_~tmp~1 := 1; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,292 INFO L280 TraceCheckUtils]: 27: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,293 INFO L280 TraceCheckUtils]: 28: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,294 INFO L280 TraceCheckUtils]: 29: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:59,295 INFO L280 TraceCheckUtils]: 30: Hoare triple {1992#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; {1849#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:17:59,295 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:17:59,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:59,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:59,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:59,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,336 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:17:59,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 189 transitions. cyclomatic complexity: 54 Second operand 3 states. [2020-07-29 03:17:59,775 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 189 transitions. cyclomatic complexity: 54. Second operand 3 states. Result 225 states and 332 transitions. Complement of second has 4 states. [2020-07-29 03:17:59,775 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:17:59,776 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:59,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 189 transitions. cyclomatic complexity: 54 [2020-07-29 03:17:59,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:59,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:59,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:17:59,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:59,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:59,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:59,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 332 transitions. [2020-07-29 03:17:59,797 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:59,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:59,801 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 189 transitions. cyclomatic complexity: 54 [2020-07-29 03:17:59,927 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 89 examples of accepted words. [2020-07-29 03:17:59,927 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:17:59,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:59,933 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:17:59,933 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 225 states and 332 transitions. cyclomatic complexity: 108 [2020-07-29 03:17:59,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 332 transitions. cyclomatic complexity: 108 [2020-07-29 03:17:59,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:59,934 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:17:59,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:59,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:59,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:59,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:59,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:59,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:59,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 225 letters. Loop has 225 letters. [2020-07-29 03:17:59,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 225 letters. Loop has 225 letters. [2020-07-29 03:17:59,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 225 letters. Loop has 225 letters. [2020-07-29 03:17:59,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:17:59,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:17:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:17:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:59,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:59,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:59,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:17:59,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:17:59,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:17:59,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:17:59,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:17:59,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:17:59,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:17:59,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:17:59,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:17:59,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:17:59,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:17:59,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:17:59,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:59,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:59,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:17:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:17:59,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:17:59,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:17:59,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:17:59,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:17:59,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:59,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:59,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:59,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:17:59,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:17:59,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:17:59,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:59,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:59,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:59,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:59,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:59,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:59,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:59,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:59,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:59,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:59,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:59,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:59,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:59,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:59,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:59,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:59,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:59,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:17:59,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:17:59,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:17:59,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:17:59,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:17:59,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:59,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:17:59,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:18:00,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:18:00,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:18:00,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:18:00,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:18:00,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:18:00,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:00,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:00,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:00,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:18:00,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:18:00,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:18:00,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:00,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:00,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:00,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:18:00,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:18:00,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:18:00,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:18:00,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:18:00,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:18:00,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:18:00,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:18:00,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:18:00,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:18:00,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:18:00,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:18:00,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:00,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:00,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:00,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:00,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:00,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:00,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:00,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:00,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:00,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:18:00,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:18:00,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:18:00,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:18:00,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:18:00,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:18:00,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:18:00,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:18:00,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:18:00,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:18:00,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:18:00,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:18:00,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:00,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:00,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:00,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:18:00,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:18:00,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:18:00,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:00,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:00,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:00,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:18:00,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:18:00,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:18:00,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:00,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:00,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:00,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:18:00,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:18:00,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:18:00,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:00,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:00,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:00,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:18:00,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:18:00,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:18:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:00,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:18:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:18:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:18:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:18:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:18:00,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:18:00,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:18:00,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:18:00,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:18:00,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:18:00,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:18:00,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:18:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:18:00,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:18:00,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:18:00,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:18:00,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:18:00,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:18:00,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:00,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:00,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:00,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:18:00,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:18:00,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:18:00,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:18:00,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:18:00,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:18:00,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:00,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:00,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:00,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:00,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:00,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:00,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:00,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:00,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:00,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:00,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:00,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:00,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:00,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:00,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:00,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:00,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:18:00,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:18:00,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:18:00,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:00,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:00,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:00,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:18:00,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:18:00,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:18:00,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:18:00,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:18:00,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:18:00,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:00,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:00,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:00,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:18:00,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:18:00,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:18:00,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:18:00,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:18:00,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:18:00,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:18:00,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:18:00,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:18:00,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:00,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:00,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:00,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:00,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:00,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:00,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:18:00,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:18:00,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:18:00,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:00,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:00,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:00,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:00,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:00,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:00,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:18:00,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:18:00,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:18:00,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:18:00,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:18:00,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:18:00,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:18:00,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:18:00,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:18:00,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:00,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:00,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:00,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:18:00,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:18:00,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:18:00,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:18:00,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:18:00,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:18:00,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:00,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:00,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:00,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:18:00,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:18:00,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:18:00,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:18:00,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:18:00,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:18:00,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:00,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:00,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:00,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:00,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:00,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:00,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:00,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:00,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:00,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:18:00,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:18:00,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:18:00,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:18:00,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:18:00,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:18:00,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:00,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:00,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:00,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:18:00,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:18:00,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:18:00,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:18:00,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:18:00,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:18:00,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:00,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:00,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:00,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:00,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:00,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:00,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,146 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:18:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-29 03:18:00,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 189 transitions. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:00,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 189 transitions. Stem has 78 letters. Loop has 31 letters. [2020-07-29 03:18:00,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 189 transitions. Stem has 47 letters. Loop has 62 letters. [2020-07-29 03:18:00,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:00,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 332 transitions. cyclomatic complexity: 108 [2020-07-29 03:18:00,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:00,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2020-07-29 03:18:00,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:00,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:00,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:00,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:00,168 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:00,168 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:00,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:00,169 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:18:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:00,169 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:18:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:18:00,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:00,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:00,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:18:00,277 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:00,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:18:00,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:00,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:00,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:00,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:00,277 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:00,277 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:00,278 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:00,278 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:18:00,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:18:00,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:00,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:00,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:18:00 BoogieIcfgContainer [2020-07-29 03:18:00,287 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:18:00,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:18:00,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:18:00,288 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:18:00,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:49" (3/4) ... [2020-07-29 03:18:00,293 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:18:00,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:18:00,295 INFO L168 Benchmark]: Toolchain (without parser) took 12475.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.2 MB). Free memory was 957.5 MB in the beginning and 1.3 GB in the end (delta: -341.3 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:00,296 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:00,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:00,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:00,302 INFO L168 Benchmark]: Boogie Preprocessor took 44.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:00,303 INFO L168 Benchmark]: RCFGBuilder took 1125.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:00,304 INFO L168 Benchmark]: BuchiAutomizer took 10649.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -269.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:00,304 INFO L168 Benchmark]: Witness Printer took 5.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:00,313 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.32 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 564.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1125.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10649.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -269.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 + 23 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 10.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.2s. Construction of modules took 0.0s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 136 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 843 SDtfs, 193 SDslu, 1347 SDs, 0 SdLazy, 26 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax143 hnf110 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 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...