./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9903c635b219614479790819c84bb7d1b8791db ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:18:02,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:18:02,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:18:02,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:18:02,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:18:02,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:18:02,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:18:02,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:18:02,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:18:02,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:18:02,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:18:02,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:18:02,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:18:02,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:18:02,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:18:02,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:18:02,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:18:02,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:18:02,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:18:02,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:18:02,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:18:02,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:18:02,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:18:02,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:18:02,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:18:02,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:18:02,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:18:02,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:18:02,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:18:02,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:18:02,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:18:02,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:18:02,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:18:02,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:18:02,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:18:02,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:18:02,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:18:02,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:18:02,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:18:02,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:18:02,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:18:02,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:18:02,745 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:18:02,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:18:02,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:18:02,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:18:02,747 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:18:02,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:18:02,748 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:18:02,748 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:18:02,748 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:18:02,749 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:18:02,749 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:18:02,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:18:02,750 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:18:02,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:18:02,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:18:02,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:18:02,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:18:02,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:18:02,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:18:02,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:18:02,752 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:18:02,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:18:02,752 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:18:02,753 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:18:02,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:18:02,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:18:02,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:18:02,754 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:18:02,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:18:02,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:18:02,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:18:02,755 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:18:02,756 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:18:02,756 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 -> e9903c635b219614479790819c84bb7d1b8791db [2020-07-29 03:18:03,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:18:03,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:18:03,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:18:03,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:18:03,093 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:18:03,093 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-07-29 03:18:03,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd84390a0/86857a9a9b1a4beea059fff2d8ddcafc/FLAGbc0364419 [2020-07-29 03:18:03,652 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:18:03,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-07-29 03:18:03,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd84390a0/86857a9a9b1a4beea059fff2d8ddcafc/FLAGbc0364419 [2020-07-29 03:18:04,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd84390a0/86857a9a9b1a4beea059fff2d8ddcafc [2020-07-29 03:18:04,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:18:04,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:18:04,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:04,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:18:04,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:18:04,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdd5219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04, skipping insertion in model container [2020-07-29 03:18:04,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:18:04,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:18:04,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:04,357 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:18:04,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:04,487 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:18:04,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04 WrapperNode [2020-07-29 03:18:04,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:04,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:04,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:18:04,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:18:04,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:04,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:18:04,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:18:04,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:18:04,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... [2020-07-29 03:18:04,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:18:04,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:18:04,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:18:04,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:18:04,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:18:04,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:18:05,302 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:18:05,303 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-29 03:18:05,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:05 BoogieIcfgContainer [2020-07-29 03:18:05,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:18:05,314 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:18:05,314 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:18:05,318 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:18:05,319 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:05,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:18:04" (1/3) ... [2020-07-29 03:18:05,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2774838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:05, skipping insertion in model container [2020-07-29 03:18:05,321 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:05,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:04" (2/3) ... [2020-07-29 03:18:05,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2774838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:05, skipping insertion in model container [2020-07-29 03:18:05,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:05,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:05" (3/3) ... [2020-07-29 03:18:05,324 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-07-29 03:18:05,383 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:18:05,383 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:18:05,385 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:18:05,385 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:18:05,385 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:18:05,386 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:18:05,386 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:18:05,386 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:18:05,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states. [2020-07-29 03:18:05,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-07-29 03:18:05,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:05,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:05,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:05,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:05,480 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:18:05,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states. [2020-07-29 03:18:05,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-07-29 03:18:05,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:05,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:05,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:05,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:05,518 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 33#L177true assume !(0 == ~r1~0);init_~tmp~0 := 0; 30#L177-1true init_#res := init_~tmp~0; 20#L242true main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 32#L294true assume !(0 == main_~i2~0); 46#L294-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 60#L302-2true [2020-07-29 03:18:05,521 INFO L796 eck$LassoCheckResult]: Loop: 60#L302-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 26#L99true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 19#L103true assume !(node1_~m1~0 != ~nomsg~0); 18#L103-1true ~mode1~0 := 0; 23#L99-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 8#L127true assume !(0 != ~mode2~0 % 256); 43#L140true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 41#L140-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 52#L127-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 62#L152true assume !(0 != ~mode3~0 % 256); 16#L165true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 27#L165-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 58#L152-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 29#L250true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 45#L250-1true check_#res := check_~tmp~1; 15#L270true main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25#L326true assume !(0 == assert_~arg % 256); 4#L321true main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 60#L302-2true [2020-07-29 03:18:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:05,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-07-29 03:18:05,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:05,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408354216] [2020-07-29 03:18:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:05,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; {65#true} is VALID [2020-07-29 03:18:05,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {65#true} is VALID [2020-07-29 03:18:05,797 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {67#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:18:05,798 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {68#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:18:05,800 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; {69#(= 0 ULTIMATE.start_main_~i2~0)} is VALID [2020-07-29 03:18:05,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {69#(= 0 ULTIMATE.start_main_~i2~0)} assume !(0 == main_~i2~0); {66#false} is VALID [2020-07-29 03:18:05,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {66#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;main_~i2~0 := 0; {66#false} is VALID [2020-07-29 03:18:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:05,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408354216] [2020-07-29 03:18:05,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:05,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:05,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849475834] [2020-07-29 03:18:05,812 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:18:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2073672604, now seen corresponding path program 1 times [2020-07-29 03:18:05,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:05,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199995391] [2020-07-29 03:18:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:06,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:06,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:06,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#true} assume !(node1_~m1~0 != ~nomsg~0); {70#true} is VALID [2020-07-29 03:18:06,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {70#true} ~mode1~0 := 0; {70#true} is VALID [2020-07-29 03:18:06,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {70#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:06,039 INFO L280 TraceCheckUtils]: 5: Hoare triple {70#true} assume !(0 != ~mode2~0 % 256); {70#true} is VALID [2020-07-29 03:18:06,039 INFO L280 TraceCheckUtils]: 6: Hoare triple {70#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {70#true} is VALID [2020-07-29 03:18:06,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {70#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {70#true} is VALID [2020-07-29 03:18:06,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {70#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:06,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {70#true} assume !(0 != ~mode3~0 % 256); {70#true} is VALID [2020-07-29 03:18:06,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {70#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {70#true} is VALID [2020-07-29 03:18:06,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {70#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {70#true} is VALID [2020-07-29 03:18:06,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {70#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {70#true} is VALID [2020-07-29 03:18:06,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {70#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {72#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:06,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {72#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {73#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:06,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {73#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {74#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:06,047 INFO L280 TraceCheckUtils]: 16: Hoare triple {74#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {71#false} is VALID [2020-07-29 03:18:06,047 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {71#false} is VALID [2020-07-29 03:18:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:06,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199995391] [2020-07-29 03:18:06,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:06,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:06,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505283223] [2020-07-29 03:18:06,053 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:06,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:06,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:06,070 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 5 states. [2020-07-29 03:18:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:06,492 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-07-29 03:18:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:18:06,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:06,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:06,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-07-29 03:18:06,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:06,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-07-29 03:18:06,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-07-29 03:18:06,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-07-29 03:18:06,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-07-29 03:18:06,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:06,538 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-07-29 03:18:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-07-29 03:18:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-07-29 03:18:06,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:06,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 130 transitions. Second operand 56 states. [2020-07-29 03:18:06,573 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 130 transitions. Second operand 56 states. [2020-07-29 03:18:06,575 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand 56 states. [2020-07-29 03:18:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:06,583 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-29 03:18:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-29 03:18:06,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:06,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:06,586 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 90 states and 130 transitions. [2020-07-29 03:18:06,586 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 90 states and 130 transitions. [2020-07-29 03:18:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:06,593 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-29 03:18:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-29 03:18:06,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:06,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:06,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:06,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 03:18:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-07-29 03:18:06,601 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-07-29 03:18:06,601 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-07-29 03:18:06,602 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:18:06,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-07-29 03:18:06,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:06,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:06,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:06,608 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] [2020-07-29 03:18:06,609 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:06,609 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 192#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 193#L177 assume 0 == ~r1~0; 224#L178 assume ~id1~0 >= 0; 182#L179 assume 0 == ~st1~0; 183#L180 assume ~send1~0 == ~id1~0; 210#L181 assume 0 == ~mode1~0 % 256; 194#L182 assume ~id2~0 >= 0; 195#L183 assume 0 == ~st2~0; 212#L184 assume ~send2~0 == ~id2~0; 231#L185 assume 0 == ~mode2~0 % 256; 178#L186 assume ~id3~0 >= 0; 179#L187 assume 0 == ~st3~0; 203#L188 assume ~send3~0 == ~id3~0; 225#L189 assume 0 == ~mode3~0 % 256; 184#L190 assume ~id1~0 != ~id2~0; 185#L191 assume ~id1~0 != ~id3~0; 228#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 219#L177-1 init_#res := init_~tmp~0; 208#L242 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 209#L294 assume !(0 == main_~i2~0); 222#L294-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 181#L302-2 [2020-07-29 03:18:06,610 INFO L796 eck$LassoCheckResult]: Loop: 181#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 213#L99 assume !(0 != ~mode1~0 % 256); 214#L115 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; 223#L115-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 205#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 189#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 190#L130 assume !(node2_~m2~0 != ~nomsg~0); 198#L130-1 ~mode2~0 := 0; 230#L127-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 233#L152 assume !(0 != ~mode3~0 % 256); 201#L165 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 202#L165-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 215#L152-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 216#L250 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 187#L250-1 check_#res := check_~tmp~1; 199#L270 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 200#L326 assume !(0 == assert_~arg % 256); 180#L321 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 181#L302-2 [2020-07-29 03:18:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-07-29 03:18:06,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:06,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12378885] [2020-07-29 03:18:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:06,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:06,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:06,768 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -879473574, now seen corresponding path program 1 times [2020-07-29 03:18:06,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:06,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588966681] [2020-07-29 03:18:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:06,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {419#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:06,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(0 != ~mode1~0 % 256); {419#true} is VALID [2020-07-29 03:18:06,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {419#true} is VALID [2020-07-29 03:18:06,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {419#true} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {419#true} is VALID [2020-07-29 03:18:06,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {419#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:06,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:06,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#true} assume !(node2_~m2~0 != ~nomsg~0); {419#true} is VALID [2020-07-29 03:18:06,899 INFO L280 TraceCheckUtils]: 7: Hoare triple {419#true} ~mode2~0 := 0; {419#true} is VALID [2020-07-29 03:18:06,899 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:06,899 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0 != ~mode3~0 % 256); {419#true} is VALID [2020-07-29 03:18:06,900 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {419#true} is VALID [2020-07-29 03:18:06,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {419#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {419#true} is VALID [2020-07-29 03:18:06,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {419#true} is VALID [2020-07-29 03:18:06,901 INFO L280 TraceCheckUtils]: 13: Hoare triple {419#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {421#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:06,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {421#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {422#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:06,903 INFO L280 TraceCheckUtils]: 15: Hoare triple {422#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {423#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:06,904 INFO L280 TraceCheckUtils]: 16: Hoare triple {423#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {420#false} is VALID [2020-07-29 03:18:06,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {420#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {420#false} is VALID [2020-07-29 03:18:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:06,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588966681] [2020-07-29 03:18:06,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:06,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:06,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341701460] [2020-07-29 03:18:06,908 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:06,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:06,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:06,909 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-07-29 03:18:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:07,216 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-07-29 03:18:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:07,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:07,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:07,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-07-29 03:18:07,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:07,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-07-29 03:18:07,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-07-29 03:18:07,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-07-29 03:18:07,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-07-29 03:18:07,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:07,249 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-07-29 03:18:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-07-29 03:18:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-29 03:18:07,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:07,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 73 transitions. Second operand 56 states. [2020-07-29 03:18:07,254 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 73 transitions. Second operand 56 states. [2020-07-29 03:18:07,254 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 56 states. [2020-07-29 03:18:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:07,257 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2020-07-29 03:18:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2020-07-29 03:18:07,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:07,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:07,258 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states and 73 transitions. [2020-07-29 03:18:07,259 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states and 73 transitions. [2020-07-29 03:18:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:07,261 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2020-07-29 03:18:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2020-07-29 03:18:07,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:07,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:07,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:07,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 03:18:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-07-29 03:18:07,266 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-07-29 03:18:07,266 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-07-29 03:18:07,266 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:18:07,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-07-29 03:18:07,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:07,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:07,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:07,268 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] [2020-07-29 03:18:07,268 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] [2020-07-29 03:18:07,269 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 495#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 496#L177 assume 0 == ~r1~0; 532#L178 assume ~id1~0 >= 0; 491#L179 assume 0 == ~st1~0; 492#L180 assume ~send1~0 == ~id1~0; 519#L181 assume 0 == ~mode1~0 % 256; 503#L182 assume ~id2~0 >= 0; 504#L183 assume 0 == ~st2~0; 521#L184 assume ~send2~0 == ~id2~0; 540#L185 assume 0 == ~mode2~0 % 256; 487#L186 assume ~id3~0 >= 0; 488#L187 assume 0 == ~st3~0; 512#L188 assume ~send3~0 == ~id3~0; 534#L189 assume 0 == ~mode3~0 % 256; 493#L190 assume ~id1~0 != ~id2~0; 494#L191 assume ~id1~0 != ~id3~0; 537#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 528#L177-1 init_#res := init_~tmp~0; 517#L242 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 518#L294 assume !(0 == main_~i2~0); 531#L294-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 490#L302-2 [2020-07-29 03:18:07,269 INFO L796 eck$LassoCheckResult]: Loop: 490#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 522#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 515#L103 assume !(node1_~m1~0 != ~nomsg~0); 513#L103-1 ~mode1~0 := 0; 514#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 497#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 498#L130 assume !(node2_~m2~0 != ~nomsg~0); 507#L130-1 ~mode2~0 := 0; 539#L127-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 542#L152 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 529#L155 assume !(node3_~m3~0 != ~nomsg~0); 525#L155-1 ~mode3~0 := 0; 524#L152-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 526#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 527#L251 assume ~r1~0 >= 3; 500#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 501#L250-1 check_#res := check_~tmp~1; 508#L270 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 509#L326 assume !(0 == assert_~arg % 256); 489#L321 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 490#L302-2 [2020-07-29 03:18:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-07-29 03:18:07,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:07,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498438663] [2020-07-29 03:18:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:07,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:07,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:07,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1935834464, now seen corresponding path program 1 times [2020-07-29 03:18:07,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:07,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578005185] [2020-07-29 03:18:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:07,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {660#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:07,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:07,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {660#true} assume !(node1_~m1~0 != ~nomsg~0); {660#true} is VALID [2020-07-29 03:18:07,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {660#true} ~mode1~0 := 0; {660#true} is VALID [2020-07-29 03:18:07,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:07,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {660#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:07,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {660#true} assume !(node2_~m2~0 != ~nomsg~0); {660#true} is VALID [2020-07-29 03:18:07,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {660#true} ~mode2~0 := 0; {660#true} is VALID [2020-07-29 03:18:07,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {660#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:07,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {660#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:07,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#true} assume !(node3_~m3~0 != ~nomsg~0); {660#true} is VALID [2020-07-29 03:18:07,359 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#true} ~mode3~0 := 0; {660#true} is VALID [2020-07-29 03:18:07,359 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {660#true} is VALID [2020-07-29 03:18:07,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {660#true} is VALID [2020-07-29 03:18:07,360 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#true} assume ~r1~0 >= 3; {662#(< 2 ~r1~0)} is VALID [2020-07-29 03:18:07,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {662#(< 2 ~r1~0)} assume ~r1~0 < 3;check_~tmp~1 := 1; {661#false} is VALID [2020-07-29 03:18:07,361 INFO L280 TraceCheckUtils]: 16: Hoare triple {661#false} check_#res := check_~tmp~1; {661#false} is VALID [2020-07-29 03:18:07,362 INFO L280 TraceCheckUtils]: 17: Hoare triple {661#false} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {661#false} is VALID [2020-07-29 03:18:07,362 INFO L280 TraceCheckUtils]: 18: Hoare triple {661#false} assume !(0 == assert_~arg % 256); {661#false} is VALID [2020-07-29 03:18:07,362 INFO L280 TraceCheckUtils]: 19: Hoare triple {661#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {661#false} is VALID [2020-07-29 03:18:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:07,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578005185] [2020-07-29 03:18:07,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:07,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:07,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444136532] [2020-07-29 03:18:07,365 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:07,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:07,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:07,366 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-07-29 03:18:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:07,522 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-07-29 03:18:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:18:07,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:07,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:07,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-07-29 03:18:07,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-07-29 03:18:07,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-07-29 03:18:07,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-07-29 03:18:07,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-07-29 03:18:07,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-07-29 03:18:07,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:07,568 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-07-29 03:18:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-07-29 03:18:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-07-29 03:18:07,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:07,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states and 113 transitions. Second operand 84 states. [2020-07-29 03:18:07,578 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states and 113 transitions. Second operand 84 states. [2020-07-29 03:18:07,578 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand 84 states. [2020-07-29 03:18:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:07,584 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-07-29 03:18:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2020-07-29 03:18:07,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:07,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:07,585 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states and 113 transitions. [2020-07-29 03:18:07,585 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states and 113 transitions. [2020-07-29 03:18:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:07,592 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-07-29 03:18:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2020-07-29 03:18:07,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:07,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:07,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:07,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-29 03:18:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-07-29 03:18:07,602 INFO L711 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-07-29 03:18:07,602 INFO L591 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-07-29 03:18:07,602 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:18:07,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-07-29 03:18:07,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-07-29 03:18:07,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:07,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:07,607 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] [2020-07-29 03:18:07,607 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] [2020-07-29 03:18:07,607 INFO L794 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 755#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 756#L177 assume 0 == ~r1~0; 793#L178 assume ~id1~0 >= 0; 751#L179 assume 0 == ~st1~0; 752#L180 assume ~send1~0 == ~id1~0; 779#L181 assume 0 == ~mode1~0 % 256; 762#L182 assume ~id2~0 >= 0; 763#L183 assume 0 == ~st2~0; 782#L184 assume ~send2~0 == ~id2~0; 803#L185 assume 0 == ~mode2~0 % 256; 747#L186 assume ~id3~0 >= 0; 748#L187 assume 0 == ~st3~0; 772#L188 assume ~send3~0 == ~id3~0; 795#L189 assume 0 == ~mode3~0 % 256; 753#L190 assume ~id1~0 != ~id2~0; 754#L191 assume ~id1~0 != ~id3~0; 800#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 789#L177-1 init_#res := init_~tmp~0; 777#L242 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 778#L294 assume !(0 == main_~i2~0); 792#L294-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 750#L302-2 [2020-07-29 03:18:07,607 INFO L796 eck$LassoCheckResult]: Loop: 750#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 783#L99 assume !(0 != ~mode1~0 % 256); 784#L115 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; 825#L115-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 774#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 824#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 821#L130 assume !(node2_~m2~0 != ~nomsg~0); 819#L130-1 ~mode2~0 := 0; 817#L127-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 816#L152 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 814#L155 assume !(node3_~m3~0 != ~nomsg~0); 811#L155-1 ~mode3~0 := 0; 809#L152-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 808#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 807#L251 assume !(~r1~0 >= 3); 798#L254 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 799#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 804#L250-1 check_#res := check_~tmp~1; 768#L270 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 769#L326 assume !(0 == assert_~arg % 256); 749#L321 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 750#L302-2 [2020-07-29 03:18:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-07-29 03:18:07,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:07,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584051119] [2020-07-29 03:18:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:07,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:07,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:07,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1510300447, now seen corresponding path program 1 times [2020-07-29 03:18:07,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:07,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41565691] [2020-07-29 03:18:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:07,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:07,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:07,742 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1506642211, now seen corresponding path program 1 times [2020-07-29 03:18:07,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:07,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464096024] [2020-07-29 03:18:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:07,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {1006#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; {1006#true} is VALID [2020-07-29 03:18:07,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {1006#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1006#true} is VALID [2020-07-29 03:18:07,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {1006#true} assume 0 == ~r1~0; {1006#true} is VALID [2020-07-29 03:18:07,830 INFO L280 TraceCheckUtils]: 3: Hoare triple {1006#true} assume ~id1~0 >= 0; {1006#true} is VALID [2020-07-29 03:18:07,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {1006#true} assume 0 == ~st1~0; {1006#true} is VALID [2020-07-29 03:18:07,831 INFO L280 TraceCheckUtils]: 5: Hoare triple {1006#true} assume ~send1~0 == ~id1~0; {1006#true} is VALID [2020-07-29 03:18:07,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {1006#true} assume 0 == ~mode1~0 % 256; {1006#true} is VALID [2020-07-29 03:18:07,832 INFO L280 TraceCheckUtils]: 7: Hoare triple {1006#true} assume ~id2~0 >= 0; {1006#true} is VALID [2020-07-29 03:18:07,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {1006#true} assume 0 == ~st2~0; {1006#true} is VALID [2020-07-29 03:18:07,833 INFO L280 TraceCheckUtils]: 9: Hoare triple {1006#true} assume ~send2~0 == ~id2~0; {1006#true} is VALID [2020-07-29 03:18:07,834 INFO L280 TraceCheckUtils]: 10: Hoare triple {1006#true} assume 0 == ~mode2~0 % 256; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 >= 0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,836 INFO L280 TraceCheckUtils]: 12: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st3~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,836 INFO L280 TraceCheckUtils]: 13: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send3~0 == ~id3~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode3~0 % 256; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,841 INFO L280 TraceCheckUtils]: 15: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id2~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,842 INFO L280 TraceCheckUtils]: 16: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id3~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,843 INFO L280 TraceCheckUtils]: 17: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,843 INFO L280 TraceCheckUtils]: 18: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} init_#res := init_~tmp~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,844 INFO L280 TraceCheckUtils]: 19: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,845 INFO L280 TraceCheckUtils]: 20: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 == main_~i2~0); {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,846 INFO L280 TraceCheckUtils]: 21: Hoare triple {1008#(= (* 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;main_~i2~0 := 0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,847 INFO L280 TraceCheckUtils]: 22: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,848 INFO L280 TraceCheckUtils]: 23: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~mode1~0 % 256); {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,849 INFO L280 TraceCheckUtils]: 24: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,849 INFO L280 TraceCheckUtils]: 25: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,850 INFO L280 TraceCheckUtils]: 26: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:18:07,851 INFO L280 TraceCheckUtils]: 27: Hoare triple {1008#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:07,851 INFO L280 TraceCheckUtils]: 28: Hoare triple {1007#false} assume !(node2_~m2~0 != ~nomsg~0); {1007#false} is VALID [2020-07-29 03:18:07,851 INFO L280 TraceCheckUtils]: 29: Hoare triple {1007#false} ~mode2~0 := 0; {1007#false} is VALID [2020-07-29 03:18:07,852 INFO L280 TraceCheckUtils]: 30: Hoare triple {1007#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:07,852 INFO L280 TraceCheckUtils]: 31: Hoare triple {1007#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:07,852 INFO L280 TraceCheckUtils]: 32: Hoare triple {1007#false} assume !(node3_~m3~0 != ~nomsg~0); {1007#false} is VALID [2020-07-29 03:18:07,853 INFO L280 TraceCheckUtils]: 33: Hoare triple {1007#false} ~mode3~0 := 0; {1007#false} is VALID [2020-07-29 03:18:07,853 INFO L280 TraceCheckUtils]: 34: Hoare triple {1007#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1007#false} is VALID [2020-07-29 03:18:07,853 INFO L280 TraceCheckUtils]: 35: Hoare triple {1007#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1007#false} is VALID [2020-07-29 03:18:07,853 INFO L280 TraceCheckUtils]: 36: Hoare triple {1007#false} assume !(~r1~0 >= 3); {1007#false} is VALID [2020-07-29 03:18:07,854 INFO L280 TraceCheckUtils]: 37: Hoare triple {1007#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1007#false} is VALID [2020-07-29 03:18:07,854 INFO L280 TraceCheckUtils]: 38: Hoare triple {1007#false} assume ~r1~0 < 3;check_~tmp~1 := 1; {1007#false} is VALID [2020-07-29 03:18:07,854 INFO L280 TraceCheckUtils]: 39: Hoare triple {1007#false} check_#res := check_~tmp~1; {1007#false} is VALID [2020-07-29 03:18:07,855 INFO L280 TraceCheckUtils]: 40: Hoare triple {1007#false} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1007#false} is VALID [2020-07-29 03:18:07,855 INFO L280 TraceCheckUtils]: 41: Hoare triple {1007#false} assume !(0 == assert_~arg % 256); {1007#false} is VALID [2020-07-29 03:18:07,855 INFO L280 TraceCheckUtils]: 42: Hoare triple {1007#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {1007#false} is VALID [2020-07-29 03:18:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:07,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464096024] [2020-07-29 03:18:07,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:07,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:07,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408007114] [2020-07-29 03:18:08,163 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2020-07-29 03:18:08,454 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2020-07-29 03:18:08,468 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:08,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:08,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:08,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:08,470 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:18:08,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:08,471 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:08,471 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:08,471 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:18:08,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:08,472 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:08,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:08,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,482 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2020-07-29 03:18:10,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:10,717 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) [2020-07-29 03:18:10,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:18:10,732 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:10,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:18:10,784 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,838 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:18:10,840 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:10,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:10,840 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:10,841 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:10,841 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:18:10,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:10,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:10,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:18:10,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:10,841 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:10,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:10,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:11,456 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-07-29 03:18:12,721 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2020-07-29 03:18:12,893 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:12,899 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:12,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:12,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:12,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:12,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:12,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:12,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:12,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:12,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:12,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:18:12,927 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:18:12,927 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:12,941 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:18:12,942 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:18:12,943 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:18:12,943 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:12,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:18:12,989 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0;" "~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1;" "havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 3;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;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~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18;" [2020-07-29 03:18:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:13,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:18:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:13,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:13,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {1009#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; {1009#unseeded} is VALID [2020-07-29 03:18:13,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#unseeded} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#unseeded} assume 0 == ~r1~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,167 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#unseeded} assume ~id1~0 >= 0; {1009#unseeded} is VALID [2020-07-29 03:18:13,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#unseeded} assume 0 == ~st1~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {1009#unseeded} assume ~send1~0 == ~id1~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#unseeded} assume 0 == ~mode1~0 % 256; {1009#unseeded} is VALID [2020-07-29 03:18:13,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#unseeded} assume ~id2~0 >= 0; {1009#unseeded} is VALID [2020-07-29 03:18:13,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#unseeded} assume 0 == ~st2~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {1009#unseeded} assume ~send2~0 == ~id2~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {1009#unseeded} assume 0 == ~mode2~0 % 256; {1009#unseeded} is VALID [2020-07-29 03:18:13,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {1009#unseeded} assume ~id3~0 >= 0; {1009#unseeded} is VALID [2020-07-29 03:18:13,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {1009#unseeded} assume 0 == ~st3~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,173 INFO L280 TraceCheckUtils]: 13: Hoare triple {1009#unseeded} assume ~send3~0 == ~id3~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,174 INFO L280 TraceCheckUtils]: 14: Hoare triple {1009#unseeded} assume 0 == ~mode3~0 % 256; {1009#unseeded} is VALID [2020-07-29 03:18:13,175 INFO L280 TraceCheckUtils]: 15: Hoare triple {1009#unseeded} assume ~id1~0 != ~id2~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,175 INFO L280 TraceCheckUtils]: 16: Hoare triple {1009#unseeded} assume ~id1~0 != ~id3~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,176 INFO L280 TraceCheckUtils]: 17: Hoare triple {1009#unseeded} assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; {1009#unseeded} is VALID [2020-07-29 03:18:13,177 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#unseeded} init_#res := init_~tmp~0; {1009#unseeded} is VALID [2020-07-29 03:18:13,177 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#unseeded} main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; {1009#unseeded} is VALID [2020-07-29 03:18:13,178 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#unseeded} assume !(0 == main_~i2~0); {1009#unseeded} is VALID [2020-07-29 03:18:13,179 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#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;main_~i2~0 := 0; {1009#unseeded} is VALID [2020-07-29 03:18:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:13,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:18:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:13,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {1012#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode1~0 % 256); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,305 INFO L280 TraceCheckUtils]: 2: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,306 INFO L280 TraceCheckUtils]: 3: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(node2_~m2~0 != ~nomsg~0); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode2~0 := 0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(node3_~m3~0 != ~nomsg~0); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode3~0 := 0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,313 INFO L280 TraceCheckUtils]: 14: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 3); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,314 INFO L280 TraceCheckUtils]: 15: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,315 INFO L280 TraceCheckUtils]: 16: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 3;check_~tmp~1 := 1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,315 INFO L280 TraceCheckUtils]: 17: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} check_#res := check_~tmp~1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,316 INFO L280 TraceCheckUtils]: 18: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,317 INFO L280 TraceCheckUtils]: 19: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 == assert_~arg % 256); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:13,318 INFO L280 TraceCheckUtils]: 20: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {1022#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))) unseeded)} is VALID [2020-07-29 03:18:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:18:13,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:13,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:13,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,346 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:18:13,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-07-29 03:18:13,527 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 145 states and 204 transitions. Complement of second has 4 states. [2020-07-29 03:18:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:18:13,527 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:13,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. cyclomatic complexity: 30 [2020-07-29 03:18:13,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:13,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:13,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:18:13,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:13,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:13,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:13,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 204 transitions. [2020-07-29 03:18:13,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:13,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:13,538 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 113 transitions. cyclomatic complexity: 30 [2020-07-29 03:18:13,572 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 62 examples of accepted words. [2020-07-29 03:18:13,573 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:18:13,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:13,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:18:13,576 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 145 states and 204 transitions. cyclomatic complexity: 60 [2020-07-29 03:18:13,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 204 transitions. cyclomatic complexity: 60 [2020-07-29 03:18:13,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:13,576 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:18:13,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 145 letters. Loop has 145 letters. [2020-07-29 03:18:13,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 145 letters. Loop has 145 letters. [2020-07-29 03:18:13,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 145 letters. Loop has 145 letters. [2020-07-29 03:18:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:18:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:18:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:18:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:13,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:13,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 21 letters. [2020-07-29 03:18:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 21 letters. [2020-07-29 03:18:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 26 letters. Loop has 21 letters. [2020-07-29 03:18:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 22 letters. [2020-07-29 03:18:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 22 letters. [2020-07-29 03:18:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 25 letters. Loop has 22 letters. [2020-07-29 03:18:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 47 letters. Loop has 21 letters. [2020-07-29 03:18:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 21 letters. [2020-07-29 03:18:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 47 letters. Loop has 21 letters. [2020-07-29 03:18:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 21 letters. [2020-07-29 03:18:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 21 letters. [2020-07-29 03:18:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 23 letters. Loop has 21 letters. [2020-07-29 03:18:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 55 letters. Loop has 21 letters. [2020-07-29 03:18:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 21 letters. [2020-07-29 03:18:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 55 letters. Loop has 21 letters. [2020-07-29 03:18:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 56 letters. Loop has 21 letters. [2020-07-29 03:18:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 21 letters. [2020-07-29 03:18:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 56 letters. Loop has 21 letters. [2020-07-29 03:18:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 57 letters. Loop has 21 letters. [2020-07-29 03:18:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 21 letters. [2020-07-29 03:18:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 21 letters. [2020-07-29 03:18:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 54 letters. Loop has 22 letters. [2020-07-29 03:18:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 22 letters. [2020-07-29 03:18:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 22 letters. [2020-07-29 03:18:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 46 letters. Loop has 21 letters. [2020-07-29 03:18:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 21 letters. [2020-07-29 03:18:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 46 letters. Loop has 21 letters. [2020-07-29 03:18:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 23 letters. [2020-07-29 03:18:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 23 letters. [2020-07-29 03:18:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 26 letters. Loop has 23 letters. [2020-07-29 03:18:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 45 letters. Loop has 21 letters. [2020-07-29 03:18:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 21 letters. [2020-07-29 03:18:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 45 letters. Loop has 21 letters. [2020-07-29 03:18:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 21 letters. [2020-07-29 03:18:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 21 letters. [2020-07-29 03:18:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 51 letters. Loop has 21 letters. [2020-07-29 03:18:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 55 letters. Loop has 23 letters. [2020-07-29 03:18:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 23 letters. [2020-07-29 03:18:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 55 letters. Loop has 23 letters. [2020-07-29 03:18:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 52 letters. Loop has 21 letters. [2020-07-29 03:18:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 21 letters. [2020-07-29 03:18:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 52 letters. Loop has 21 letters. [2020-07-29 03:18:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 36 letters. Loop has 21 letters. [2020-07-29 03:18:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 21 letters. [2020-07-29 03:18:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 36 letters. Loop has 21 letters. [2020-07-29 03:18:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 35 letters. Loop has 21 letters. [2020-07-29 03:18:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 21 letters. [2020-07-29 03:18:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 35 letters. Loop has 21 letters. [2020-07-29 03:18:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 34 letters. Loop has 21 letters. [2020-07-29 03:18:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 21 letters. [2020-07-29 03:18:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 34 letters. Loop has 21 letters. [2020-07-29 03:18:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 33 letters. Loop has 22 letters. [2020-07-29 03:18:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 22 letters. [2020-07-29 03:18:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 33 letters. Loop has 22 letters. [2020-07-29 03:18:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:18:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:18:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:18:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 31 letters. Loop has 21 letters. [2020-07-29 03:18:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 21 letters. [2020-07-29 03:18:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 31 letters. Loop has 21 letters. [2020-07-29 03:18:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 30 letters. Loop has 21 letters. [2020-07-29 03:18:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 21 letters. [2020-07-29 03:18:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 30 letters. Loop has 21 letters. [2020-07-29 03:18:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:13,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:13,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:13,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:18:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:18:13,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:18:13,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 29 letters. Loop has 22 letters. [2020-07-29 03:18:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 22 letters. [2020-07-29 03:18:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 29 letters. Loop has 22 letters. [2020-07-29 03:18:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:13,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:13,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 27 letters. Loop has 21 letters. [2020-07-29 03:18:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 21 letters. [2020-07-29 03:18:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 27 letters. Loop has 21 letters. [2020-07-29 03:18:13,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:13,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:13,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:13,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 44 letters. Loop has 21 letters. [2020-07-29 03:18:13,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 21 letters. [2020-07-29 03:18:13,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 44 letters. Loop has 21 letters. [2020-07-29 03:18:13,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:13,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:13,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:13,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:13,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:13,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:13,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:13,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:13,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:13,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:13,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:13,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:13,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:13,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:13,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:13,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 48 letters. Loop has 21 letters. [2020-07-29 03:18:13,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 21 letters. [2020-07-29 03:18:13,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 48 letters. Loop has 21 letters. [2020-07-29 03:18:13,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:13,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:13,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:13,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:13,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:13,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:13,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:13,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:13,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:13,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:13,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:13,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:13,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 22 letters. [2020-07-29 03:18:13,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 22 letters. [2020-07-29 03:18:13,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 22 letters. [2020-07-29 03:18:13,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:18:13,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:18:13,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:18:13,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:13,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:13,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,665 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:18:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-29 03:18:13,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-07-29 03:18:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:13,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. cyclomatic complexity: 60 [2020-07-29 03:18:13,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:13,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-07-29 03:18:13,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:13,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:13,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:13,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:13,675 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:13,676 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:13,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:13,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:13,676 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:18:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:13,676 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:18:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:18:13,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:13,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:13,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:18:13,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:13,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:18:13,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:13,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:13,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:13,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:13,727 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:13,727 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:13,727 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:13,728 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:18:13,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:18:13,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:13,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:13,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:18:13 BoogieIcfgContainer [2020-07-29 03:18:13,735 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:18:13,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:18:13,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:18:13,736 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:18:13,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:05" (3/4) ... [2020-07-29 03:18:13,740 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:18:13,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:18:13,742 INFO L168 Benchmark]: Toolchain (without parser) took 9705.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 956.2 MB in the beginning and 1.2 GB in the end (delta: -226.2 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:13,743 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:13,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:13,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:13,745 INFO L168 Benchmark]: Boogie Preprocessor took 35.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:13,745 INFO L168 Benchmark]: RCFGBuilder took 729.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:13,746 INFO L168 Benchmark]: BuchiAutomizer took 8420.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -143.4 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:13,747 INFO L168 Benchmark]: Witness Printer took 4.78 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:13,751 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 448.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 729.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8420.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -143.4 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.78 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.0s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 170 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital125 mio100 ax128 hnf106 lsp51 ukn72 mio100 lsp100 div148 bol100 ite100 ukn100 eq177 hnf73 smp100 dnf937 smp48 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 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...