./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.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 44469d68e80b32c41fbf18afe28ab7ab0f2ebea6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:17:08,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:17:08,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:17:08,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:17:08,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:17:08,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:17:08,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:17:08,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:17:08,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:17:08,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:17:08,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:17:08,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:17:08,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:17:08,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:17:08,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:17:08,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:17:08,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:17:08,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:17:08,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:17:08,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:17:08,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:17:08,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:17:08,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:17:08,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:17:08,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:17:08,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:17:08,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:17:08,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:17:08,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:17:08,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:17:08,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:17:08,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:17:08,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:17:08,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:17:08,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:17:08,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:17:08,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:17:08,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:17:08,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:17:08,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:17:08,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:17:08,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:17:08,548 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:17:08,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:17:08,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:17:08,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:17:08,553 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:17:08,554 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:17:08,554 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:17:08,554 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:17:08,555 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:17:08,555 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:17:08,556 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:17:08,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:17:08,557 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:17:08,558 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:17:08,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:17:08,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:17:08,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:17:08,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:17:08,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:17:08,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:17:08,559 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:17:08,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:17:08,560 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:17:08,560 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:17:08,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:17:08,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:17:08,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:17:08,561 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:17:08,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:17:08,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:17:08,562 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:17:08,564 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:17:08,565 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:17:08,566 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 -> 44469d68e80b32c41fbf18afe28ab7ab0f2ebea6 [2020-07-29 03:17:08,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:17:08,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:17:08,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:17:08,902 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:17:08,902 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:17:08,903 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:08,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd6ea6c2/ad6ab3b7d76545448ebd926de0f7ba99/FLAG549a5841e [2020-07-29 03:17:09,487 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:17:09,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:09,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd6ea6c2/ad6ab3b7d76545448ebd926de0f7ba99/FLAG549a5841e [2020-07-29 03:17:09,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd6ea6c2/ad6ab3b7d76545448ebd926de0f7ba99 [2020-07-29 03:17:09,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:17:09,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:17:09,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:09,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:17:09,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:17:09,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:09" (1/1) ... [2020-07-29 03:17:09,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c4e00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:09, skipping insertion in model container [2020-07-29 03:17:09,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:09" (1/1) ... [2020-07-29 03:17:09,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:17:09,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:17:10,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:10,292 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:17:10,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:10,382 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:17:10,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10 WrapperNode [2020-07-29 03:17:10,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:10,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:10,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:17:10,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:17:10,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:10,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:17:10,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:17:10,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:17:10,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... [2020-07-29 03:17:10,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:17:10,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:17:10,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:17:10,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:17:10,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:17:10,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:17:11,608 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:17:11,608 INFO L295 CfgBuilder]: Removed 23 assume(true) statements. [2020-07-29 03:17:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:11 BoogieIcfgContainer [2020-07-29 03:17:11,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:17:11,615 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:17:11,615 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:17:11,619 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:17:11,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:11,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:17:09" (1/3) ... [2020-07-29 03:17:11,622 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f3f37dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:11, skipping insertion in model container [2020-07-29 03:17:11,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:11,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:10" (2/3) ... [2020-07-29 03:17:11,623 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f3f37dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:11, skipping insertion in model container [2020-07-29 03:17:11,623 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:11,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:11" (3/3) ... [2020-07-29 03:17:11,625 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:11,681 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:17:11,682 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:17:11,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:17:11,682 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:17:11,682 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:17:11,683 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:17:11,683 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:17:11,683 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:17:11,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states. [2020-07-29 03:17:11,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-07-29 03:17:11,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:11,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:11,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:11,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:11,769 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:17:11,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states. [2020-07-29 03:17:11,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-07-29 03:17:11,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:11,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:11,784 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:11,784 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:11,794 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 12#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 45#L290true assume !(0 == ~r1~0);init_~tmp~0 := 0; 44#L290-1true init_#res := init_~tmp~0; 53#L419true main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 48#L67true assume !(0 == assume_abort_if_not_~cond); 94#L66true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 46#L488-2true [2020-07-29 03:17:11,795 INFO L796 eck$LassoCheckResult]: Loop: 46#L488-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 95#L121true 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 25#L125true assume !(node1_~m1~0 != ~nomsg~0); 22#L125-1true ~mode1~0 := 0; 93#L121-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 19#L153true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 112#L156true assume !(node2_~m2~0 != ~nomsg~0); 111#L156-1true ~mode2~0 := 0; 17#L153-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 83#L187true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 71#L190true assume !(node3_~m3~0 != ~nomsg~0); 69#L190-1true ~mode3~0 := 0; 96#L187-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 39#L221true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 43#L224true assume !(node4_~m4~0 != ~nomsg~0); 42#L224-1true ~mode4~0 := 0; 35#L221-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 13#L255true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 118#L258true assume !(node5_~m5~0 != ~nomsg~0); 117#L258-1true ~mode5~0 := 0; 113#L255-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 70#L427true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 72#L427-1true check_#res := check_~tmp~1; 23#L439true main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 65#L518true assume !(0 == assert_~arg % 256); 38#L513true main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 46#L488-2true [2020-07-29 03:17:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2020-07-29 03:17:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:11,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549890421] [2020-07-29 03:17:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:12,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {122#true} is VALID [2020-07-29 03:17:12,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#true} havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {122#true} is VALID [2020-07-29 03:17:12,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {124#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:17:12,101 INFO L280 TraceCheckUtils]: 3: Hoare triple {124#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {125#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:17:12,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {125#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {126#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:17:12,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {123#false} is VALID [2020-07-29 03:17:12,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {123#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {123#false} is VALID [2020-07-29 03:17:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:17:12,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549890421] [2020-07-29 03:17:12,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:12,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:12,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000550838] [2020-07-29 03:17:12,120 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash 240307598, now seen corresponding path program 1 times [2020-07-29 03:17:12,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:12,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296105681] [2020-07-29 03:17:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:12,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {127#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {127#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {127#true} assume !(node1_~m1~0 != ~nomsg~0); {127#true} is VALID [2020-07-29 03:17:12,328 INFO L280 TraceCheckUtils]: 3: Hoare triple {127#true} ~mode1~0 := 0; {127#true} is VALID [2020-07-29 03:17:12,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {127#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,329 INFO L280 TraceCheckUtils]: 5: Hoare triple {127#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {127#true} assume !(node2_~m2~0 != ~nomsg~0); {127#true} is VALID [2020-07-29 03:17:12,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {127#true} ~mode2~0 := 0; {127#true} is VALID [2020-07-29 03:17:12,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {127#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {127#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {127#true} assume !(node3_~m3~0 != ~nomsg~0); {127#true} is VALID [2020-07-29 03:17:12,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {127#true} ~mode3~0 := 0; {127#true} is VALID [2020-07-29 03:17:12,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {127#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {127#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {127#true} assume !(node4_~m4~0 != ~nomsg~0); {127#true} is VALID [2020-07-29 03:17:12,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {127#true} ~mode4~0 := 0; {127#true} is VALID [2020-07-29 03:17:12,333 INFO L280 TraceCheckUtils]: 16: Hoare triple {127#true} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,334 INFO L280 TraceCheckUtils]: 17: Hoare triple {127#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {127#true} is VALID [2020-07-29 03:17:12,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {127#true} assume !(node5_~m5~0 != ~nomsg~0); {127#true} is VALID [2020-07-29 03:17:12,334 INFO L280 TraceCheckUtils]: 19: Hoare triple {127#true} ~mode5~0 := 0; {127#true} is VALID [2020-07-29 03:17:12,335 INFO L280 TraceCheckUtils]: 20: Hoare triple {127#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {127#true} is VALID [2020-07-29 03:17:12,336 INFO L280 TraceCheckUtils]: 21: Hoare triple {127#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {129#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:12,337 INFO L280 TraceCheckUtils]: 22: Hoare triple {129#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {130#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:12,339 INFO L280 TraceCheckUtils]: 23: Hoare triple {130#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {131#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:12,340 INFO L280 TraceCheckUtils]: 24: Hoare triple {131#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {128#false} is VALID [2020-07-29 03:17:12,341 INFO L280 TraceCheckUtils]: 25: Hoare triple {128#false} main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; {128#false} is VALID [2020-07-29 03:17:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:17:12,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296105681] [2020-07-29 03:17:12,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:12,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:12,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216718922] [2020-07-29 03:17:12,347 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:12,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:12,367 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2020-07-29 03:17:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:13,109 INFO L93 Difference]: Finished difference Result 121 states and 198 transitions. [2020-07-29 03:17:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:13,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:13,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:13,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 198 transitions. [2020-07-29 03:17:13,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-07-29 03:17:13,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 113 states and 159 transitions. [2020-07-29 03:17:13,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-07-29 03:17:13,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-07-29 03:17:13,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 159 transitions. [2020-07-29 03:17:13,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:13,154 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 159 transitions. [2020-07-29 03:17:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 159 transitions. [2020-07-29 03:17:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-07-29 03:17:13,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:13,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 159 transitions. Second operand 113 states. [2020-07-29 03:17:13,194 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 159 transitions. Second operand 113 states. [2020-07-29 03:17:13,196 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand 113 states. [2020-07-29 03:17:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:13,203 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2020-07-29 03:17:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2020-07-29 03:17:13,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:13,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:13,207 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states and 159 transitions. [2020-07-29 03:17:13,207 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states and 159 transitions. [2020-07-29 03:17:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:13,214 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2020-07-29 03:17:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2020-07-29 03:17:13,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:13,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:13,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:13,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-29 03:17:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2020-07-29 03:17:13,224 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 159 transitions. [2020-07-29 03:17:13,224 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 159 transitions. [2020-07-29 03:17:13,224 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:17:13,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 159 transitions. [2020-07-29 03:17:13,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-07-29 03:17:13,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:13,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:13,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:13,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:13,231 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 273#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 274#L290 assume 0 == ~r1~0; 329#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 361#L292 assume ~id1~0 >= 0; 292#L293 assume 0 == ~st1~0; 293#L294 assume ~send1~0 == ~id1~0; 339#L295 assume 0 == ~mode1~0 % 256; 269#L296 assume ~id2~0 >= 0; 270#L297 assume 0 == ~st2~0; 344#L298 assume ~send2~0 == ~id2~0; 282#L299 assume 0 == ~mode2~0 % 256; 283#L300 assume ~id3~0 >= 0; 330#L301 assume 0 == ~st3~0; 331#L302 assume ~send3~0 == ~id3~0; 351#L303 assume 0 == ~mode3~0 % 256; 309#L304 assume ~id4~0 >= 0; 310#L305 assume 0 == ~st4~0; 346#L306 assume ~send4~0 == ~id4~0; 280#L307 assume 0 == ~mode4~0 % 256; 281#L308 assume ~id5~0 >= 0; 341#L309 assume 0 == ~st5~0; 267#L310 assume ~send5~0 == ~id5~0; 268#L311 assume 0 == ~mode5~0 % 256; 314#L312 assume ~id1~0 != ~id2~0; 315#L313 assume ~id1~0 != ~id3~0; 360#L314 assume ~id1~0 != ~id4~0; 307#L315 assume ~id1~0 != ~id5~0; 308#L316 assume ~id2~0 != ~id3~0; 345#L317 assume ~id2~0 != ~id4~0; 278#L318 assume ~id2~0 != ~id5~0; 279#L319 assume ~id3~0 != ~id4~0; 340#L320 assume ~id3~0 != ~id5~0; 265#L321 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 266#L290-1 init_#res := init_~tmp~0; 328#L419 main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 333#L67 assume !(0 == assume_abort_if_not_~cond); 334#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 317#L488-2 [2020-07-29 03:17:13,231 INFO L796 eck$LassoCheckResult]: Loop: 317#L488-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 332#L121 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 298#L125 assume !(node1_~m1~0 != ~nomsg~0); 294#L125-1 ~mode1~0 := 0; 272#L121-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 287#L153 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 289#L156 assume !(node2_~m2~0 != ~nomsg~0); 302#L156-1 ~mode2~0 := 0; 284#L153-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 285#L187 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 354#L190 assume !(node3_~m3~0 != ~nomsg~0); 324#L190-1 ~mode3~0 := 0; 349#L187-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 320#L221 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 321#L224 assume !(node4_~m4~0 != ~nomsg~0); 326#L224-1 ~mode4~0 := 0; 258#L221-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 275#L255 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 276#L258 assume !(node5_~m5~0 != ~nomsg~0); 264#L258-1 ~mode5~0 := 0; 363#L255-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 353#L427 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 291#L427-1 check_#res := check_~tmp~1; 295#L439 main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 296#L518 assume !(0 == assert_~arg % 256); 316#L513 main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 317#L488-2 [2020-07-29 03:17:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2020-07-29 03:17:13,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:13,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068173406] [2020-07-29 03:17:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:13,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:13,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:13,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash 240307598, now seen corresponding path program 2 times [2020-07-29 03:17:13,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:13,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870713354] [2020-07-29 03:17:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:13,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {601#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {601#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {601#true} assume !(node1_~m1~0 != ~nomsg~0); {601#true} is VALID [2020-07-29 03:17:13,566 INFO L280 TraceCheckUtils]: 3: Hoare triple {601#true} ~mode1~0 := 0; {601#true} is VALID [2020-07-29 03:17:13,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {601#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {601#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {601#true} assume !(node2_~m2~0 != ~nomsg~0); {601#true} is VALID [2020-07-29 03:17:13,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {601#true} ~mode2~0 := 0; {601#true} is VALID [2020-07-29 03:17:13,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {601#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {601#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {601#true} assume !(node3_~m3~0 != ~nomsg~0); {601#true} is VALID [2020-07-29 03:17:13,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {601#true} ~mode3~0 := 0; {601#true} is VALID [2020-07-29 03:17:13,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {601#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {601#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {601#true} assume !(node4_~m4~0 != ~nomsg~0); {601#true} is VALID [2020-07-29 03:17:13,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {601#true} ~mode4~0 := 0; {601#true} is VALID [2020-07-29 03:17:13,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {601#true} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {601#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {601#true} is VALID [2020-07-29 03:17:13,572 INFO L280 TraceCheckUtils]: 18: Hoare triple {601#true} assume !(node5_~m5~0 != ~nomsg~0); {601#true} is VALID [2020-07-29 03:17:13,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {601#true} ~mode5~0 := 0; {601#true} is VALID [2020-07-29 03:17:13,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {601#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {601#true} is VALID [2020-07-29 03:17:13,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {601#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {603#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:13,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {603#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {604#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:13,576 INFO L280 TraceCheckUtils]: 23: Hoare triple {604#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {605#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:13,578 INFO L280 TraceCheckUtils]: 24: Hoare triple {605#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {602#false} is VALID [2020-07-29 03:17:13,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {602#false} main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; {602#false} is VALID [2020-07-29 03:17:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:17:13,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870713354] [2020-07-29 03:17:13,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:13,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:13,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133275255] [2020-07-29 03:17:13,582 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:13,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:13,583 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. cyclomatic complexity: 47 Second operand 5 states. [2020-07-29 03:17:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:14,151 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2020-07-29 03:17:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:14,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:14,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:14,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 161 transitions. [2020-07-29 03:17:14,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-07-29 03:17:14,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 113 states and 157 transitions. [2020-07-29 03:17:14,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-07-29 03:17:14,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-07-29 03:17:14,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 157 transitions. [2020-07-29 03:17:14,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:14,211 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2020-07-29 03:17:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 157 transitions. [2020-07-29 03:17:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-07-29 03:17:14,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:14,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 157 transitions. Second operand 113 states. [2020-07-29 03:17:14,231 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 157 transitions. Second operand 113 states. [2020-07-29 03:17:14,231 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand 113 states. [2020-07-29 03:17:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:14,247 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2020-07-29 03:17:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2020-07-29 03:17:14,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:14,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:14,249 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states and 157 transitions. [2020-07-29 03:17:14,252 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states and 157 transitions. [2020-07-29 03:17:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:14,259 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2020-07-29 03:17:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2020-07-29 03:17:14,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:14,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:14,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:14,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-29 03:17:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2020-07-29 03:17:14,269 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2020-07-29 03:17:14,270 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2020-07-29 03:17:14,270 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:17:14,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. [2020-07-29 03:17:14,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-07-29 03:17:14,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:14,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:14,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:14,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:14,281 INFO L794 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 742#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 743#L290 assume 0 == ~r1~0; 798#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 830#L292 assume ~id1~0 >= 0; 761#L293 assume 0 == ~st1~0; 762#L294 assume ~send1~0 == ~id1~0; 808#L295 assume 0 == ~mode1~0 % 256; 738#L296 assume ~id2~0 >= 0; 739#L297 assume 0 == ~st2~0; 813#L298 assume ~send2~0 == ~id2~0; 751#L299 assume 0 == ~mode2~0 % 256; 752#L300 assume ~id3~0 >= 0; 799#L301 assume 0 == ~st3~0; 800#L302 assume ~send3~0 == ~id3~0; 820#L303 assume 0 == ~mode3~0 % 256; 778#L304 assume ~id4~0 >= 0; 779#L305 assume 0 == ~st4~0; 815#L306 assume ~send4~0 == ~id4~0; 749#L307 assume 0 == ~mode4~0 % 256; 750#L308 assume ~id5~0 >= 0; 810#L309 assume 0 == ~st5~0; 736#L310 assume ~send5~0 == ~id5~0; 737#L311 assume 0 == ~mode5~0 % 256; 783#L312 assume ~id1~0 != ~id2~0; 784#L313 assume ~id1~0 != ~id3~0; 829#L314 assume ~id1~0 != ~id4~0; 776#L315 assume ~id1~0 != ~id5~0; 777#L316 assume ~id2~0 != ~id3~0; 814#L317 assume ~id2~0 != ~id4~0; 747#L318 assume ~id2~0 != ~id5~0; 748#L319 assume ~id3~0 != ~id4~0; 809#L320 assume ~id3~0 != ~id5~0; 734#L321 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 735#L290-1 init_#res := init_~tmp~0; 797#L419 main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 802#L67 assume !(0 == assume_abort_if_not_~cond); 803#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 788#L488-2 [2020-07-29 03:17:14,282 INFO L796 eck$LassoCheckResult]: Loop: 788#L488-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 801#L121 assume !(0 != ~mode1~0 % 256); 772#L139 assume !(0 != ~alive1~0 % 256); 740#L139-2 ~mode1~0 := 1; 741#L121-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 756#L153 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 758#L156 assume !(node2_~m2~0 != ~nomsg~0); 771#L156-1 ~mode2~0 := 0; 753#L153-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 754#L187 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 823#L190 assume !(node3_~m3~0 != ~nomsg~0); 793#L190-1 ~mode3~0 := 0; 818#L187-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 789#L221 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 790#L224 assume !(node4_~m4~0 != ~nomsg~0); 795#L224-1 ~mode4~0 := 0; 727#L221-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 744#L255 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 745#L258 assume !(node5_~m5~0 != ~nomsg~0); 733#L258-1 ~mode5~0 := 0; 832#L255-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 822#L427 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 766#L428 assume ~r1~0 < 5;check_~tmp~1 := 1; 760#L427-1 check_#res := check_~tmp~1; 764#L439 main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 765#L518 assume !(0 == assert_~arg % 256); 787#L513 main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 788#L488-2 [2020-07-29 03:17:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2020-07-29 03:17:14,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:14,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661955834] [2020-07-29 03:17:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:14,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:14,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:14,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -664930306, now seen corresponding path program 1 times [2020-07-29 03:17:14,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:14,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643049540] [2020-07-29 03:17:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:14,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:14,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:14,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash 696981672, now seen corresponding path program 1 times [2020-07-29 03:17:14,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:14,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289256841] [2020-07-29 03:17:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:14,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {1072#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {1072#true} is VALID [2020-07-29 03:17:14,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {1072#true} havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1072#true} is VALID [2020-07-29 03:17:14,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {1072#true} assume 0 == ~r1~0; {1072#true} is VALID [2020-07-29 03:17:14,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {1072#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1072#true} is VALID [2020-07-29 03:17:14,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {1072#true} assume ~id1~0 >= 0; {1072#true} is VALID [2020-07-29 03:17:14,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {1072#true} assume 0 == ~st1~0; {1072#true} is VALID [2020-07-29 03:17:14,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {1072#true} assume ~send1~0 == ~id1~0; {1072#true} is VALID [2020-07-29 03:17:14,579 INFO L280 TraceCheckUtils]: 7: Hoare triple {1072#true} assume 0 == ~mode1~0 % 256; {1072#true} is VALID [2020-07-29 03:17:14,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {1072#true} assume ~id2~0 >= 0; {1072#true} is VALID [2020-07-29 03:17:14,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {1072#true} assume 0 == ~st2~0; {1072#true} is VALID [2020-07-29 03:17:14,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {1072#true} assume ~send2~0 == ~id2~0; {1072#true} is VALID [2020-07-29 03:17:14,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {1072#true} assume 0 == ~mode2~0 % 256; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 >= 0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st3~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send3~0 == ~id3~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode3~0 % 256; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 >= 0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st4~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send4~0 == ~id4~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode4~0 % 256; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,590 INFO L280 TraceCheckUtils]: 20: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id5~0 >= 0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,592 INFO L280 TraceCheckUtils]: 21: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st5~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,593 INFO L280 TraceCheckUtils]: 22: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send5~0 == ~id5~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,594 INFO L280 TraceCheckUtils]: 23: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode5~0 % 256; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,595 INFO L280 TraceCheckUtils]: 24: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id2~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,596 INFO L280 TraceCheckUtils]: 25: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id3~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,597 INFO L280 TraceCheckUtils]: 26: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id4~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,598 INFO L280 TraceCheckUtils]: 27: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id5~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,599 INFO L280 TraceCheckUtils]: 28: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id3~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id4~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,601 INFO L280 TraceCheckUtils]: 30: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id5~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,602 INFO L280 TraceCheckUtils]: 31: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id4~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,603 INFO L280 TraceCheckUtils]: 32: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id5~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,605 INFO L280 TraceCheckUtils]: 33: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,606 INFO L280 TraceCheckUtils]: 34: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} init_#res := init_~tmp~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,608 INFO L280 TraceCheckUtils]: 35: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,609 INFO L280 TraceCheckUtils]: 36: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 == assume_abort_if_not_~cond); {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,610 INFO L280 TraceCheckUtils]: 37: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,611 INFO L280 TraceCheckUtils]: 38: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,612 INFO L280 TraceCheckUtils]: 39: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~mode1~0 % 256); {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,613 INFO L280 TraceCheckUtils]: 40: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~alive1~0 % 256); {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,613 INFO L280 TraceCheckUtils]: 41: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~mode1~0 := 1; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,614 INFO L280 TraceCheckUtils]: 42: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:14,615 INFO L280 TraceCheckUtils]: 43: Hoare triple {1074#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,616 INFO L280 TraceCheckUtils]: 44: Hoare triple {1073#false} assume !(node2_~m2~0 != ~nomsg~0); {1073#false} is VALID [2020-07-29 03:17:14,616 INFO L280 TraceCheckUtils]: 45: Hoare triple {1073#false} ~mode2~0 := 0; {1073#false} is VALID [2020-07-29 03:17:14,616 INFO L280 TraceCheckUtils]: 46: Hoare triple {1073#false} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,617 INFO L280 TraceCheckUtils]: 47: Hoare triple {1073#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,617 INFO L280 TraceCheckUtils]: 48: Hoare triple {1073#false} assume !(node3_~m3~0 != ~nomsg~0); {1073#false} is VALID [2020-07-29 03:17:14,617 INFO L280 TraceCheckUtils]: 49: Hoare triple {1073#false} ~mode3~0 := 0; {1073#false} is VALID [2020-07-29 03:17:14,617 INFO L280 TraceCheckUtils]: 50: Hoare triple {1073#false} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,618 INFO L280 TraceCheckUtils]: 51: Hoare triple {1073#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,618 INFO L280 TraceCheckUtils]: 52: Hoare triple {1073#false} assume !(node4_~m4~0 != ~nomsg~0); {1073#false} is VALID [2020-07-29 03:17:14,618 INFO L280 TraceCheckUtils]: 53: Hoare triple {1073#false} ~mode4~0 := 0; {1073#false} is VALID [2020-07-29 03:17:14,624 INFO L280 TraceCheckUtils]: 54: Hoare triple {1073#false} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,624 INFO L280 TraceCheckUtils]: 55: Hoare triple {1073#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1073#false} is VALID [2020-07-29 03:17:14,624 INFO L280 TraceCheckUtils]: 56: Hoare triple {1073#false} assume !(node5_~m5~0 != ~nomsg~0); {1073#false} is VALID [2020-07-29 03:17:14,625 INFO L280 TraceCheckUtils]: 57: Hoare triple {1073#false} ~mode5~0 := 0; {1073#false} is VALID [2020-07-29 03:17:14,626 INFO L280 TraceCheckUtils]: 58: Hoare triple {1073#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1073#false} is VALID [2020-07-29 03:17:14,626 INFO L280 TraceCheckUtils]: 59: Hoare triple {1073#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1073#false} is VALID [2020-07-29 03:17:14,627 INFO L280 TraceCheckUtils]: 60: Hoare triple {1073#false} assume ~r1~0 < 5;check_~tmp~1 := 1; {1073#false} is VALID [2020-07-29 03:17:14,630 INFO L280 TraceCheckUtils]: 61: Hoare triple {1073#false} check_#res := check_~tmp~1; {1073#false} is VALID [2020-07-29 03:17:14,631 INFO L280 TraceCheckUtils]: 62: Hoare triple {1073#false} main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1073#false} is VALID [2020-07-29 03:17:14,631 INFO L280 TraceCheckUtils]: 63: Hoare triple {1073#false} assume !(0 == assert_~arg % 256); {1073#false} is VALID [2020-07-29 03:17:14,632 INFO L280 TraceCheckUtils]: 64: Hoare triple {1073#false} main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; {1073#false} is VALID [2020-07-29 03:17:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:17:14,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289256841] [2020-07-29 03:17:14,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:14,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:17:14,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056580043] [2020-07-29 03:17:15,025 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2020-07-29 03:17:15,406 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2020-07-29 03:17:15,420 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:15,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:15,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:15,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:15,421 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:17:15,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:15,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:15,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:15,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2020-07-29 03:17:15,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:15,422 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:15,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,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:17:15,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:15,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:16,424 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-29 03:17:16,905 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-29 03:17:17,055 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:17,057 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:17:17,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:17:17,073 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:17,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:17:17,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:17:17,206 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:17:17,209 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:17,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:17,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:17,209 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:17,210 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:17:17,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:17,210 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:17,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:17,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2020-07-29 03:17:17,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:17,210 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:17,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:17,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:18,088 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-29 03:17:18,502 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-29 03:17:18,679 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:18,685 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:17:18,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:18,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:18,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:18,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:18,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:18,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:18,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:18,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:18,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:18,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:18,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:18,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:18,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:18,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:18,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:18,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:18,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:18,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,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:17:18,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:18,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:18,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:18,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:18,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:18,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:18,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:18,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:18,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:18,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:18,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:18,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:18,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:18,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:18,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:19,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:19,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:19,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:19,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:19,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:19,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:19,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:19,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:19,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:19,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:19,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:19,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:19,283 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:17:19,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:17:19,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:19,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:17:19,306 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:17:19,307 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:17:19,308 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:19,355 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:17:19,377 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(0 != ~alive1~0 % 256);" "~mode1~0 := 1;" "havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1;" "assume ~r1~0 < 5;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;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~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37;" [2020-07-29 03:17:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:19,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:17:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:19,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:19,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {1075#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {1075#unseeded} is VALID [2020-07-29 03:17:19,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {1075#unseeded} havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {1075#unseeded} assume 0 == ~r1~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,635 INFO L280 TraceCheckUtils]: 3: Hoare triple {1075#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1075#unseeded} is VALID [2020-07-29 03:17:19,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {1075#unseeded} assume ~id1~0 >= 0; {1075#unseeded} is VALID [2020-07-29 03:17:19,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {1075#unseeded} assume 0 == ~st1~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {1075#unseeded} assume ~send1~0 == ~id1~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {1075#unseeded} assume 0 == ~mode1~0 % 256; {1075#unseeded} is VALID [2020-07-29 03:17:19,645 INFO L280 TraceCheckUtils]: 8: Hoare triple {1075#unseeded} assume ~id2~0 >= 0; {1075#unseeded} is VALID [2020-07-29 03:17:19,646 INFO L280 TraceCheckUtils]: 9: Hoare triple {1075#unseeded} assume 0 == ~st2~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,646 INFO L280 TraceCheckUtils]: 10: Hoare triple {1075#unseeded} assume ~send2~0 == ~id2~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,647 INFO L280 TraceCheckUtils]: 11: Hoare triple {1075#unseeded} assume 0 == ~mode2~0 % 256; {1075#unseeded} is VALID [2020-07-29 03:17:19,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {1075#unseeded} assume ~id3~0 >= 0; {1075#unseeded} is VALID [2020-07-29 03:17:19,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {1075#unseeded} assume 0 == ~st3~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {1075#unseeded} assume ~send3~0 == ~id3~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {1075#unseeded} assume 0 == ~mode3~0 % 256; {1075#unseeded} is VALID [2020-07-29 03:17:19,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {1075#unseeded} assume ~id4~0 >= 0; {1075#unseeded} is VALID [2020-07-29 03:17:19,652 INFO L280 TraceCheckUtils]: 17: Hoare triple {1075#unseeded} assume 0 == ~st4~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {1075#unseeded} assume ~send4~0 == ~id4~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,653 INFO L280 TraceCheckUtils]: 19: Hoare triple {1075#unseeded} assume 0 == ~mode4~0 % 256; {1075#unseeded} is VALID [2020-07-29 03:17:19,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {1075#unseeded} assume ~id5~0 >= 0; {1075#unseeded} is VALID [2020-07-29 03:17:19,654 INFO L280 TraceCheckUtils]: 21: Hoare triple {1075#unseeded} assume 0 == ~st5~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,654 INFO L280 TraceCheckUtils]: 22: Hoare triple {1075#unseeded} assume ~send5~0 == ~id5~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {1075#unseeded} assume 0 == ~mode5~0 % 256; {1075#unseeded} is VALID [2020-07-29 03:17:19,656 INFO L280 TraceCheckUtils]: 24: Hoare triple {1075#unseeded} assume ~id1~0 != ~id2~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,656 INFO L280 TraceCheckUtils]: 25: Hoare triple {1075#unseeded} assume ~id1~0 != ~id3~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,657 INFO L280 TraceCheckUtils]: 26: Hoare triple {1075#unseeded} assume ~id1~0 != ~id4~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,657 INFO L280 TraceCheckUtils]: 27: Hoare triple {1075#unseeded} assume ~id1~0 != ~id5~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,658 INFO L280 TraceCheckUtils]: 28: Hoare triple {1075#unseeded} assume ~id2~0 != ~id3~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,658 INFO L280 TraceCheckUtils]: 29: Hoare triple {1075#unseeded} assume ~id2~0 != ~id4~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,659 INFO L280 TraceCheckUtils]: 30: Hoare triple {1075#unseeded} assume ~id2~0 != ~id5~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,659 INFO L280 TraceCheckUtils]: 31: Hoare triple {1075#unseeded} assume ~id3~0 != ~id4~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,660 INFO L280 TraceCheckUtils]: 32: Hoare triple {1075#unseeded} assume ~id3~0 != ~id5~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {1075#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1075#unseeded} is VALID [2020-07-29 03:17:19,661 INFO L280 TraceCheckUtils]: 34: Hoare triple {1075#unseeded} init_#res := init_~tmp~0; {1075#unseeded} is VALID [2020-07-29 03:17:19,661 INFO L280 TraceCheckUtils]: 35: Hoare triple {1075#unseeded} main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1075#unseeded} is VALID [2020-07-29 03:17:19,662 INFO L280 TraceCheckUtils]: 36: Hoare triple {1075#unseeded} assume !(0 == assume_abort_if_not_~cond); {1075#unseeded} is VALID [2020-07-29 03:17:19,662 INFO L280 TraceCheckUtils]: 37: Hoare triple {1075#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {1075#unseeded} is VALID [2020-07-29 03:17:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:19,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:17:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:19,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:19,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {1078#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19))} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode1~0 % 256); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~alive1~0 % 256); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 1; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,770 INFO L280 TraceCheckUtils]: 9: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,771 INFO L280 TraceCheckUtils]: 10: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,772 INFO L280 TraceCheckUtils]: 11: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,772 INFO L280 TraceCheckUtils]: 12: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,773 INFO L280 TraceCheckUtils]: 13: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,774 INFO L280 TraceCheckUtils]: 14: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,775 INFO L280 TraceCheckUtils]: 15: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,776 INFO L280 TraceCheckUtils]: 16: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,776 INFO L280 TraceCheckUtils]: 17: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,778 INFO L280 TraceCheckUtils]: 19: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,778 INFO L280 TraceCheckUtils]: 20: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,779 INFO L280 TraceCheckUtils]: 21: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,780 INFO L280 TraceCheckUtils]: 22: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 5;check_~tmp~1 := 1; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:19,783 INFO L280 TraceCheckUtils]: 26: Hoare triple {1204#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; {1088#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:17:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:17:19,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:19,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:19,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:19,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:19,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:17:19,823 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 45 Second operand 3 states. [2020-07-29 03:17:20,200 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 45. Second operand 3 states. Result 188 states and 277 transitions. Complement of second has 4 states. [2020-07-29 03:17:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:17:20,201 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:20,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. cyclomatic complexity: 45 [2020-07-29 03:17:20,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:20,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:20,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:17:20,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:20,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:20,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:20,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 277 transitions. [2020-07-29 03:17:20,217 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:20,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:20,221 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 113 states and 157 transitions. cyclomatic complexity: 45 [2020-07-29 03:17:20,276 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 75 examples of accepted words. [2020-07-29 03:17:20,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:17:20,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:20,281 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:17:20,281 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 277 transitions. cyclomatic complexity: 90 [2020-07-29 03:17:20,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 277 transitions. cyclomatic complexity: 90 [2020-07-29 03:17:20,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:20,281 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:17:20,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:20,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:20,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:20,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 188 letters. Loop has 188 letters. [2020-07-29 03:17:20,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 188 letters. Loop has 188 letters. [2020-07-29 03:17:20,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 188 letters. Loop has 188 letters. [2020-07-29 03:17:20,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 113 letters. Loop has 113 letters. [2020-07-29 03:17:20,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 113 letters. Loop has 113 letters. [2020-07-29 03:17:20,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 113 letters. Loop has 113 letters. [2020-07-29 03:17:20,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:20,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:20,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:20,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:20,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:20,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:20,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:20,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:20,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:20,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:20,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:20,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:20,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:20,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:20,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:20,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:20,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:20,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:20,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:20,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:20,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:20,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:20,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:20,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:20,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:20,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:20,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:20,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:20,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:20,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:20,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:20,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:20,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:20,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:20,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:20,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:20,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:20,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:20,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:20,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:20,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:20,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:20,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:20,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:20,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:20,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:20,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:20,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:20,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:20,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:20,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:20,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:20,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:20,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:20,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:20,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:20,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:20,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:20,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:20,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:20,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:20,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:20,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:20,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:20,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:20,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:20,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:20,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:20,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:20,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:20,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:20,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:20,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:20,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:20,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:20,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:20,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:20,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:20,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:20,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:20,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:20,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:20,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:20,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:20,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:20,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:20,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:20,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:20,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:20,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:20,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:20,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:20,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:20,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:20,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:20,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:20,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:20,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:20,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:20,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:20,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:20,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:20,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:20,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:20,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:20,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:20,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:20,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:20,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:20,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:20,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:20,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:20,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:20,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:20,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:20,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:20,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:20,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:20,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:20,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:20,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:20,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:20,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:20,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:20,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:20,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:20,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:20,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:20,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:20,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:20,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:20,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:20,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:20,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:20,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:20,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:20,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:20,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:20,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:20,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:20,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:20,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:20,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:20,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:20,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:20,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:20,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:20,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:20,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:20,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:20,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:20,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:20,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:20,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:20,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:20,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:20,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:20,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:20,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:20,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:20,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:20,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:20,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:20,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:20,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:20,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:20,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:20,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:20,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:20,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:20,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:20,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:20,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:20,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:20,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:20,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:20,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:20,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:20,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:20,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:20,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:20,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:20,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:20,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:20,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:20,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:20,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:20,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:20,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:20,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:20,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:20,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:20,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:20,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:20,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:20,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:20,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:20,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:20,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:20,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:20,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:20,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:20,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:20,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:20,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:20,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,418 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:17:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2020-07-29 03:17:20,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 157 transitions. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:20,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 157 transitions. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:17:20,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 157 transitions. Stem has 38 letters. Loop has 54 letters. [2020-07-29 03:17:20,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:20,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 277 transitions. cyclomatic complexity: 90 [2020-07-29 03:17:20,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:20,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 0 states and 0 transitions. [2020-07-29 03:17:20,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:20,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:20,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:20,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:20,433 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:20,433 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:20,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:20,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:17:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:17:20,434 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:17:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:20,434 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:17:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:20,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:20,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:20,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:17:20,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:20,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:17:20,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:20,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:20,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:20,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:20,521 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:20,521 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:20,521 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:20,521 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:17:20,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:17:20,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:20,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:20,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:17:20 BoogieIcfgContainer [2020-07-29 03:17:20,529 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:17:20,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:17:20,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:17:20,530 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:17:20,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:11" (3/4) ... [2020-07-29 03:17:20,544 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:17:20,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:17:20,547 INFO L168 Benchmark]: Toolchain (without parser) took 10698.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.9 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -113.0 MB). Peak memory consumption was 143.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:20,548 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:20,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 532.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:20,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:20,553 INFO L168 Benchmark]: Boogie Preprocessor took 60.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:20,556 INFO L168 Benchmark]: RCFGBuilder took 1065.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.9 MB in the end (delta: 81.2 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:20,558 INFO L168 Benchmark]: BuchiAutomizer took 8914.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 975.9 MB in the beginning and 1.1 GB in the end (delta: -98.7 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:20,558 INFO L168 Benchmark]: Witness Printer took 15.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:20,563 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 532.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1065.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.9 MB in the end (delta: 81.2 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8914.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 975.9 MB in the beginning and 1.1 GB in the end (delta: -98.7 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. * Witness Printer took 15.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.0s. Construction of modules took 0.0s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 113 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 506 SDtfs, 161 SDslu, 1129 SDs, 0 SdLazy, 26 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax142 hnf109 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq228 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...