./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.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.1.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 0ccfbaba6fc8f083385125788f16d74d1c53e3cf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:03,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:17:03,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:17:03,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:17:03,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:17:03,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:17:03,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:17:03,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:17:03,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:17:03,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:17:03,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:17:03,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:17:03,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:17:03,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:17:03,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:17:03,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:17:03,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:17:03,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:17:03,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:17:03,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:17:03,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:17:03,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:17:03,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:17:03,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:17:03,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:17:03,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:17:03,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:17:03,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:17:03,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:17:03,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:17:03,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:17:03,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:17:03,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:17:03,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:17:03,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:17:03,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:17:03,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:17:03,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:17:03,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:17:03,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:17:03,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:17:03,558 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:03,578 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:17:03,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:17:03,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:17:03,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:17:03,580 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:17:03,580 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:17:03,580 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:17:03,580 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:17:03,581 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:17:03,581 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:17:03,581 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:17:03,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:17:03,581 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:17:03,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:17:03,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:17:03,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:17:03,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:17:03,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:17:03,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:17:03,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:17:03,583 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:17:03,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:17:03,584 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:17:03,584 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:17:03,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:17:03,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:17:03,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:17:03,585 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:17:03,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:17:03,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:17:03,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:17:03,586 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:17:03,587 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:17:03,587 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 -> 0ccfbaba6fc8f083385125788f16d74d1c53e3cf [2020-07-29 03:17:03,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:17:03,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:17:03,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:17:03,936 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:17:03,937 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:17:03,937 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.1.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:03,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bf88f02/f5524a88bef54ea7b42292d0764ca83d/FLAGfa5925f91 [2020-07-29 03:17:04,516 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:17:04,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:04,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bf88f02/f5524a88bef54ea7b42292d0764ca83d/FLAGfa5925f91 [2020-07-29 03:17:04,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bf88f02/f5524a88bef54ea7b42292d0764ca83d [2020-07-29 03:17:04,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:17:04,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:17:04,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:04,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:17:04,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:17:04,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:04" (1/1) ... [2020-07-29 03:17:04,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f89cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:04, skipping insertion in model container [2020-07-29 03:17:04,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:04" (1/1) ... [2020-07-29 03:17:04,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:17:04,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:17:05,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:05,205 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:17:05,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:05,386 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:17:05,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:05 WrapperNode [2020-07-29 03:17:05,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:05,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:05,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:17:05,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:17:05,395 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:05" (1/1) ... [2020-07-29 03:17:05,406 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:05" (1/1) ... [2020-07-29 03:17:05,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:05,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:17:05,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:17:05,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:17:05,492 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:05" (1/1) ... [2020-07-29 03:17:05,492 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:05" (1/1) ... [2020-07-29 03:17:05,503 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:05" (1/1) ... [2020-07-29 03:17:05,504 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:05" (1/1) ... [2020-07-29 03:17:05,523 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:05" (1/1) ... [2020-07-29 03:17:05,542 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:05" (1/1) ... [2020-07-29 03:17:05,546 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:05" (1/1) ... [2020-07-29 03:17:05,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:17:05,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:17:05,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:17:05,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:17:05,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:05" (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:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:17:05,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:17:06,719 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:17:06,720 INFO L295 CfgBuilder]: Removed 23 assume(true) statements. [2020-07-29 03:17:06,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:06 BoogieIcfgContainer [2020-07-29 03:17:06,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:17:06,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:17:06,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:17:06,732 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:17:06,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:06,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:17:04" (1/3) ... [2020-07-29 03:17:06,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c295435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:06, skipping insertion in model container [2020-07-29 03:17:06,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:06,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:05" (2/3) ... [2020-07-29 03:17:06,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c295435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:06, skipping insertion in model container [2020-07-29 03:17:06,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:06,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:06" (3/3) ... [2020-07-29 03:17:06,739 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:06,798 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:17:06,798 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:17:06,798 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:17:06,799 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:17:06,799 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:17:06,799 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:17:06,800 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:17:06,800 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:17:06,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2020-07-29 03:17:06,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-07-29 03:17:06,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:06,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:06,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:06,888 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:06,888 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:17:06,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2020-07-29 03:17:06,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-07-29 03:17:06,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:06,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:06,905 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:06,905 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:06,917 INFO L794 eck$LassoCheckResult]: Stem: 91#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]; 11#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 51#L295true assume !(0 == ~r1~0);init_~tmp~0 := 0; 50#L295-1true init_#res := init_~tmp~0; 73#L424true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 47#L67true assume !(0 == assume_abort_if_not_~cond); 95#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; 66#L493-2true [2020-07-29 03:17:06,919 INFO L796 eck$LassoCheckResult]: Loop: 66#L493-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 98#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; 21#L125true assume !(node1_~m1~0 != ~nomsg~0); 19#L125-1true ~mode1~0 := 0; 94#L121-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 23#L158true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 27#L161true assume !(node2_~m2~0 != ~nomsg~0); 26#L161-1true ~mode2~0 := 0; 20#L158-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 119#L192true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 107#L195true assume !(node3_~m3~0 != ~nomsg~0); 106#L195-1true ~mode3~0 := 0; 101#L192-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 76#L226true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 49#L229true assume !(node4_~m4~0 != ~nomsg~0); 62#L229-1true ~mode4~0 := 0; 72#L226-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 32#L260true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 7#L263true assume !(node5_~m5~0 != ~nomsg~0); 6#L263-1true ~mode5~0 := 0; 28#L260-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; 96#L432true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 99#L432-1true check_#res := check_~tmp~1; 44#L444true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 87#L523true assume !(0 == assert_~arg % 256); 59#L518true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 66#L493-2true [2020-07-29 03:17:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2020-07-29 03:17:06,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:06,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827447850] [2020-07-29 03:17:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:07,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#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]; {125#true} is VALID [2020-07-29 03:17:07,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {125#true} is VALID [2020-07-29 03:17:07,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {127#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:17:07,214 INFO L280 TraceCheckUtils]: 3: Hoare triple {127#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {128#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:17:07,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {128#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {129#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:17:07,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {129#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {126#false} is VALID [2020-07-29 03:17:07,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#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; {126#false} is VALID [2020-07-29 03:17:07,220 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:07,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827447850] [2020-07-29 03:17:07,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:07,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:07,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560502056] [2020-07-29 03:17:07,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 1 times [2020-07-29 03:17:07,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:07,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303845545] [2020-07-29 03:17:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:07,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {130#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {130#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; {130#true} is VALID [2020-07-29 03:17:07,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {130#true} assume !(node1_~m1~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:07,407 INFO L280 TraceCheckUtils]: 3: Hoare triple {130#true} ~mode1~0 := 0; {130#true} is VALID [2020-07-29 03:17:07,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {130#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {130#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,408 INFO L280 TraceCheckUtils]: 6: Hoare triple {130#true} assume !(node2_~m2~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:07,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {130#true} ~mode2~0 := 0; {130#true} is VALID [2020-07-29 03:17:07,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {130#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,409 INFO L280 TraceCheckUtils]: 10: Hoare triple {130#true} assume !(node3_~m3~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:07,409 INFO L280 TraceCheckUtils]: 11: Hoare triple {130#true} ~mode3~0 := 0; {130#true} is VALID [2020-07-29 03:17:07,410 INFO L280 TraceCheckUtils]: 12: Hoare triple {130#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {130#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,411 INFO L280 TraceCheckUtils]: 14: Hoare triple {130#true} assume !(node4_~m4~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:07,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {130#true} ~mode4~0 := 0; {130#true} is VALID [2020-07-29 03:17:07,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {130#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {130#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:07,412 INFO L280 TraceCheckUtils]: 18: Hoare triple {130#true} assume !(node5_~m5~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:07,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {130#true} ~mode5~0 := 0; {130#true} is VALID [2020-07-29 03:17:07,413 INFO L280 TraceCheckUtils]: 20: Hoare triple {130#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; {130#true} is VALID [2020-07-29 03:17:07,414 INFO L280 TraceCheckUtils]: 21: Hoare triple {130#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {132#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:07,415 INFO L280 TraceCheckUtils]: 22: Hoare triple {132#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {133#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:07,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {133#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {134#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:07,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {134#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {131#false} is VALID [2020-07-29 03:17:07,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {131#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {131#false} is VALID [2020-07-29 03:17:07,422 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:07,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303845545] [2020-07-29 03:17:07,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:07,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:07,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879982739] [2020-07-29 03:17:07,425 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:07,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:07,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:07,445 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 5 states. [2020-07-29 03:17:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:08,179 INFO L93 Difference]: Finished difference Result 124 states and 203 transitions. [2020-07-29 03:17:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:08,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:08,205 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:08,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 203 transitions. [2020-07-29 03:17:08,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:08,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 116 states and 164 transitions. [2020-07-29 03:17:08,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-07-29 03:17:08,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-07-29 03:17:08,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 164 transitions. [2020-07-29 03:17:08,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:08,234 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2020-07-29 03:17:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 164 transitions. [2020-07-29 03:17:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-07-29 03:17:08,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:08,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 164 transitions. Second operand 116 states. [2020-07-29 03:17:08,273 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 164 transitions. Second operand 116 states. [2020-07-29 03:17:08,275 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand 116 states. [2020-07-29 03:17:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:08,283 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2020-07-29 03:17:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2020-07-29 03:17:08,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:08,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:08,286 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states and 164 transitions. [2020-07-29 03:17:08,287 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states and 164 transitions. [2020-07-29 03:17:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:08,294 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2020-07-29 03:17:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2020-07-29 03:17:08,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:08,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:08,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:08,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-29 03:17:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2020-07-29 03:17:08,306 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2020-07-29 03:17:08,306 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2020-07-29 03:17:08,306 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:17:08,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 164 transitions. [2020-07-29 03:17:08,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:08,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:08,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:08,318 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:08,318 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:08,319 INFO L794 eck$LassoCheckResult]: Stem: 374#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]; 282#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 283#L295 assume 0 == ~r1~0; 280#L296 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 281#L297 assume ~id1~0 >= 0; 347#L298 assume 0 == ~st1~0; 291#L299 assume ~send1~0 == ~id1~0; 292#L300 assume 0 == ~mode1~0 % 256; 339#L301 assume ~id2~0 >= 0; 340#L302 assume 0 == ~st2~0; 356#L303 assume ~send2~0 == ~id2~0; 317#L304 assume 0 == ~mode2~0 % 256; 318#L305 assume ~id3~0 >= 0; 349#L306 assume 0 == ~st3~0; 289#L307 assume ~send3~0 == ~id3~0; 290#L308 assume 0 == ~mode3~0 % 256; 346#L309 assume ~id4~0 >= 0; 278#L310 assume 0 == ~st4~0; 279#L311 assume ~send4~0 == ~id4~0; 325#L312 assume 0 == ~mode4~0 % 256; 326#L313 assume ~id5~0 >= 0; 369#L314 assume 0 == ~st5~0; 315#L315 assume ~send5~0 == ~id5~0; 316#L316 assume 0 == ~mode5~0 % 256; 348#L317 assume ~id1~0 != ~id2~0; 284#L318 assume ~id1~0 != ~id3~0; 285#L319 assume ~id1~0 != ~id4~0; 345#L320 assume ~id1~0 != ~id5~0; 276#L321 assume ~id2~0 != ~id3~0; 277#L322 assume ~id2~0 != ~id4~0; 320#L323 assume ~id2~0 != ~id5~0; 321#L324 assume ~id3~0 != ~id4~0; 368#L325 assume ~id3~0 != ~id5~0; 313#L326 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 314#L295-1 init_#res := init_~tmp~0; 344#L424 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 341#L67 assume !(0 == assume_abort_if_not_~cond); 342#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; 352#L493-2 [2020-07-29 03:17:08,319 INFO L796 eck$LassoCheckResult]: Loop: 352#L493-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 360#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; 300#L125 assume !(node1_~m1~0 != ~nomsg~0); 296#L125-1 ~mode1~0 := 0; 297#L121-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 304#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 305#L161 assume !(node2_~m2~0 != ~nomsg~0); 310#L161-1 ~mode2~0 := 0; 298#L158-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 299#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 375#L195 assume !(node3_~m3~0 != ~nomsg~0); 267#L195-1 ~mode3~0 := 0; 359#L192-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 367#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 343#L229 assume !(node4_~m4~0 != ~nomsg~0); 270#L229-1 ~mode4~0 := 0; 307#L226-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 319#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 274#L263 assume !(node5_~m5~0 != ~nomsg~0); 272#L263-1 ~mode5~0 := 0; 273#L260-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; 312#L432 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 309#L432-1 check_#res := check_~tmp~1; 336#L444 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 337#L523 assume !(0 == assert_~arg % 256); 351#L518 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 352#L493-2 [2020-07-29 03:17:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2020-07-29 03:17:08,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:08,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052380421] [2020-07-29 03:17:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:08,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:08,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:08,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 2 times [2020-07-29 03:17:08,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:08,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345638174] [2020-07-29 03:17:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:08,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {616#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#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; {616#true} is VALID [2020-07-29 03:17:08,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {616#true} assume !(node1_~m1~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:08,656 INFO L280 TraceCheckUtils]: 3: Hoare triple {616#true} ~mode1~0 := 0; {616#true} is VALID [2020-07-29 03:17:08,656 INFO L280 TraceCheckUtils]: 4: Hoare triple {616#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,656 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,657 INFO L280 TraceCheckUtils]: 6: Hoare triple {616#true} assume !(node2_~m2~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:08,657 INFO L280 TraceCheckUtils]: 7: Hoare triple {616#true} ~mode2~0 := 0; {616#true} is VALID [2020-07-29 03:17:08,658 INFO L280 TraceCheckUtils]: 8: Hoare triple {616#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,658 INFO L280 TraceCheckUtils]: 9: Hoare triple {616#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {616#true} assume !(node3_~m3~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:08,659 INFO L280 TraceCheckUtils]: 11: Hoare triple {616#true} ~mode3~0 := 0; {616#true} is VALID [2020-07-29 03:17:08,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {616#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,660 INFO L280 TraceCheckUtils]: 14: Hoare triple {616#true} assume !(node4_~m4~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:08,660 INFO L280 TraceCheckUtils]: 15: Hoare triple {616#true} ~mode4~0 := 0; {616#true} is VALID [2020-07-29 03:17:08,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {616#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,661 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:08,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {616#true} assume !(node5_~m5~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:08,665 INFO L280 TraceCheckUtils]: 19: Hoare triple {616#true} ~mode5~0 := 0; {616#true} is VALID [2020-07-29 03:17:08,665 INFO L280 TraceCheckUtils]: 20: Hoare triple {616#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; {616#true} is VALID [2020-07-29 03:17:08,672 INFO L280 TraceCheckUtils]: 21: Hoare triple {616#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {618#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:08,673 INFO L280 TraceCheckUtils]: 22: Hoare triple {618#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {619#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:08,675 INFO L280 TraceCheckUtils]: 23: Hoare triple {619#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {620#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:08,676 INFO L280 TraceCheckUtils]: 24: Hoare triple {620#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {617#false} is VALID [2020-07-29 03:17:08,676 INFO L280 TraceCheckUtils]: 25: Hoare triple {617#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {617#false} is VALID [2020-07-29 03:17:08,677 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:08,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345638174] [2020-07-29 03:17:08,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:08,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:08,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256051099] [2020-07-29 03:17:08,679 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:08,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:08,680 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-07-29 03:17:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:09,266 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2020-07-29 03:17:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:09,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:09,308 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:09,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 166 transitions. [2020-07-29 03:17:09,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:09,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 116 states and 162 transitions. [2020-07-29 03:17:09,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-07-29 03:17:09,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-07-29 03:17:09,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 162 transitions. [2020-07-29 03:17:09,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:09,323 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2020-07-29 03:17:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 162 transitions. [2020-07-29 03:17:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-07-29 03:17:09,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:09,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 162 transitions. Second operand 116 states. [2020-07-29 03:17:09,331 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 162 transitions. Second operand 116 states. [2020-07-29 03:17:09,331 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand 116 states. [2020-07-29 03:17:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:09,336 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2020-07-29 03:17:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2020-07-29 03:17:09,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:09,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:09,339 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states and 162 transitions. [2020-07-29 03:17:09,339 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states and 162 transitions. [2020-07-29 03:17:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:09,344 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2020-07-29 03:17:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2020-07-29 03:17:09,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:09,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:09,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:09,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-29 03:17:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2020-07-29 03:17:09,351 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2020-07-29 03:17:09,352 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2020-07-29 03:17:09,352 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:17:09,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. [2020-07-29 03:17:09,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:09,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:09,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:09,355 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:09,356 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:09,356 INFO L794 eck$LassoCheckResult]: Stem: 855#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]; 763#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 764#L295 assume 0 == ~r1~0; 761#L296 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 762#L297 assume ~id1~0 >= 0; 828#L298 assume 0 == ~st1~0; 772#L299 assume ~send1~0 == ~id1~0; 773#L300 assume 0 == ~mode1~0 % 256; 820#L301 assume ~id2~0 >= 0; 821#L302 assume 0 == ~st2~0; 837#L303 assume ~send2~0 == ~id2~0; 798#L304 assume 0 == ~mode2~0 % 256; 799#L305 assume ~id3~0 >= 0; 830#L306 assume 0 == ~st3~0; 770#L307 assume ~send3~0 == ~id3~0; 771#L308 assume 0 == ~mode3~0 % 256; 827#L309 assume ~id4~0 >= 0; 759#L310 assume 0 == ~st4~0; 760#L311 assume ~send4~0 == ~id4~0; 806#L312 assume 0 == ~mode4~0 % 256; 807#L313 assume ~id5~0 >= 0; 850#L314 assume 0 == ~st5~0; 796#L315 assume ~send5~0 == ~id5~0; 797#L316 assume 0 == ~mode5~0 % 256; 829#L317 assume ~id1~0 != ~id2~0; 765#L318 assume ~id1~0 != ~id3~0; 766#L319 assume ~id1~0 != ~id4~0; 826#L320 assume ~id1~0 != ~id5~0; 757#L321 assume ~id2~0 != ~id3~0; 758#L322 assume ~id2~0 != ~id4~0; 801#L323 assume ~id2~0 != ~id5~0; 802#L324 assume ~id3~0 != ~id4~0; 849#L325 assume ~id3~0 != ~id5~0; 794#L326 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 795#L295-1 init_#res := init_~tmp~0; 825#L424 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 822#L67 assume !(0 == assume_abort_if_not_~cond); 823#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; 834#L493-2 [2020-07-29 03:17:09,357 INFO L796 eck$LassoCheckResult]: Loop: 834#L493-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 841#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; 781#L125 assume !(node1_~m1~0 != ~nomsg~0); 777#L125-1 ~mode1~0 := 0; 778#L121-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 785#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 786#L161 assume !(node2_~m2~0 != ~nomsg~0); 791#L161-1 ~mode2~0 := 0; 779#L158-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 780#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 856#L195 assume !(node3_~m3~0 != ~nomsg~0); 748#L195-1 ~mode3~0 := 0; 840#L192-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 848#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 824#L229 assume !(node4_~m4~0 != ~nomsg~0); 751#L229-1 ~mode4~0 := 0; 788#L226-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 800#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 755#L263 assume !(node5_~m5~0 != ~nomsg~0); 753#L263-1 ~mode5~0 := 0; 754#L260-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; 793#L432 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 819#L433 assume ~r1~0 < 5;check_~tmp~1 := 1; 790#L432-1 check_#res := check_~tmp~1; 817#L444 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 818#L523 assume !(0 == assert_~arg % 256); 833#L518 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 834#L493-2 [2020-07-29 03:17:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2020-07-29 03:17:09,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:09,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956302834] [2020-07-29 03:17:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:09,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:09,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:09,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1026451556, now seen corresponding path program 1 times [2020-07-29 03:17:09,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:09,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279315749] [2020-07-29 03:17:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:09,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:09,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:09,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:09,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1906603762, now seen corresponding path program 1 times [2020-07-29 03:17:09,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:09,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812025633] [2020-07-29 03:17:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:09,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {1099#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]; {1099#true} is VALID [2020-07-29 03:17:09,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {1099#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1099#true} is VALID [2020-07-29 03:17:09,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {1099#true} assume 0 == ~r1~0; {1099#true} is VALID [2020-07-29 03:17:09,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {1099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1099#true} is VALID [2020-07-29 03:17:09,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1099#true} assume ~id1~0 >= 0; {1099#true} is VALID [2020-07-29 03:17:09,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {1099#true} assume 0 == ~st1~0; {1099#true} is VALID [2020-07-29 03:17:09,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#true} assume ~send1~0 == ~id1~0; {1099#true} is VALID [2020-07-29 03:17:09,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {1099#true} assume 0 == ~mode1~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,588 INFO L280 TraceCheckUtils]: 9: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,589 INFO L280 TraceCheckUtils]: 10: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,590 INFO L280 TraceCheckUtils]: 12: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,593 INFO L280 TraceCheckUtils]: 15: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,595 INFO L280 TraceCheckUtils]: 17: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,595 INFO L280 TraceCheckUtils]: 18: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,596 INFO L280 TraceCheckUtils]: 19: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,598 INFO L280 TraceCheckUtils]: 21: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,599 INFO L280 TraceCheckUtils]: 22: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,599 INFO L280 TraceCheckUtils]: 23: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,600 INFO L280 TraceCheckUtils]: 24: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,601 INFO L280 TraceCheckUtils]: 25: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,602 INFO L280 TraceCheckUtils]: 26: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,603 INFO L280 TraceCheckUtils]: 27: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,604 INFO L280 TraceCheckUtils]: 28: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,605 INFO L280 TraceCheckUtils]: 29: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,605 INFO L280 TraceCheckUtils]: 30: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,606 INFO L280 TraceCheckUtils]: 31: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,607 INFO L280 TraceCheckUtils]: 32: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,608 INFO L280 TraceCheckUtils]: 33: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,609 INFO L280 TraceCheckUtils]: 34: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,610 INFO L280 TraceCheckUtils]: 35: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,610 INFO L280 TraceCheckUtils]: 36: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,611 INFO L280 TraceCheckUtils]: 37: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~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; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,612 INFO L280 TraceCheckUtils]: 38: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:09,614 INFO L280 TraceCheckUtils]: 39: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} 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; {1100#false} is VALID [2020-07-29 03:17:09,614 INFO L280 TraceCheckUtils]: 40: Hoare triple {1100#false} assume !(node1_~m1~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:09,615 INFO L280 TraceCheckUtils]: 41: Hoare triple {1100#false} ~mode1~0 := 0; {1100#false} is VALID [2020-07-29 03:17:09,615 INFO L280 TraceCheckUtils]: 42: Hoare triple {1100#false} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,615 INFO L280 TraceCheckUtils]: 43: Hoare triple {1100#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,615 INFO L280 TraceCheckUtils]: 44: Hoare triple {1100#false} assume !(node2_~m2~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:09,616 INFO L280 TraceCheckUtils]: 45: Hoare triple {1100#false} ~mode2~0 := 0; {1100#false} is VALID [2020-07-29 03:17:09,616 INFO L280 TraceCheckUtils]: 46: Hoare triple {1100#false} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,616 INFO L280 TraceCheckUtils]: 47: Hoare triple {1100#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,617 INFO L280 TraceCheckUtils]: 48: Hoare triple {1100#false} assume !(node3_~m3~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:09,617 INFO L280 TraceCheckUtils]: 49: Hoare triple {1100#false} ~mode3~0 := 0; {1100#false} is VALID [2020-07-29 03:17:09,617 INFO L280 TraceCheckUtils]: 50: Hoare triple {1100#false} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,618 INFO L280 TraceCheckUtils]: 51: Hoare triple {1100#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,618 INFO L280 TraceCheckUtils]: 52: Hoare triple {1100#false} assume !(node4_~m4~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:09,618 INFO L280 TraceCheckUtils]: 53: Hoare triple {1100#false} ~mode4~0 := 0; {1100#false} is VALID [2020-07-29 03:17:09,618 INFO L280 TraceCheckUtils]: 54: Hoare triple {1100#false} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,619 INFO L280 TraceCheckUtils]: 55: Hoare triple {1100#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:09,619 INFO L280 TraceCheckUtils]: 56: Hoare triple {1100#false} assume !(node5_~m5~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:09,619 INFO L280 TraceCheckUtils]: 57: Hoare triple {1100#false} ~mode5~0 := 0; {1100#false} is VALID [2020-07-29 03:17:09,620 INFO L280 TraceCheckUtils]: 58: Hoare triple {1100#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; {1100#false} is VALID [2020-07-29 03:17:09,620 INFO L280 TraceCheckUtils]: 59: Hoare triple {1100#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1100#false} is VALID [2020-07-29 03:17:09,620 INFO L280 TraceCheckUtils]: 60: Hoare triple {1100#false} assume ~r1~0 < 5;check_~tmp~1 := 1; {1100#false} is VALID [2020-07-29 03:17:09,621 INFO L280 TraceCheckUtils]: 61: Hoare triple {1100#false} check_#res := check_~tmp~1; {1100#false} is VALID [2020-07-29 03:17:09,621 INFO L280 TraceCheckUtils]: 62: Hoare triple {1100#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1100#false} is VALID [2020-07-29 03:17:09,621 INFO L280 TraceCheckUtils]: 63: Hoare triple {1100#false} assume !(0 == assert_~arg % 256); {1100#false} is VALID [2020-07-29 03:17:09,622 INFO L280 TraceCheckUtils]: 64: Hoare triple {1100#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1100#false} is VALID [2020-07-29 03:17:09,630 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:09,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812025633] [2020-07-29 03:17:09,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:09,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:17:09,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004717159] [2020-07-29 03:17:10,116 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2020-07-29 03:17:10,604 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2020-07-29 03:17:10,624 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:10,625 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:10,625 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:10,625 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:10,625 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:17:10,626 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:10,626 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:10,626 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:10,626 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2020-07-29 03:17:10,626 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:10,626 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:10,728 INFO L141 MapEliminator]: 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:10,741 INFO L141 MapEliminator]: 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:10,747 INFO L141 MapEliminator]: 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:10,751 INFO L141 MapEliminator]: 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:10,757 INFO L141 MapEliminator]: 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:10,761 INFO L141 MapEliminator]: 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:10,780 INFO L141 MapEliminator]: 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:10,784 INFO L141 MapEliminator]: 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:10,792 INFO L141 MapEliminator]: 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:10,798 INFO L141 MapEliminator]: 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:10,803 INFO L141 MapEliminator]: 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:10,807 INFO L141 MapEliminator]: 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:10,810 INFO L141 MapEliminator]: 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:10,813 INFO L141 MapEliminator]: 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:10,817 INFO L141 MapEliminator]: 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:10,819 INFO L141 MapEliminator]: 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:10,822 INFO L141 MapEliminator]: 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:10,831 INFO L141 MapEliminator]: 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:10,838 INFO L141 MapEliminator]: 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:10,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:10,904 INFO L141 MapEliminator]: 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:10,909 INFO L141 MapEliminator]: 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:10,917 INFO L141 MapEliminator]: 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:10,921 INFO L141 MapEliminator]: 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:10,926 INFO L141 MapEliminator]: 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:10,930 INFO L141 MapEliminator]: 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:10,933 INFO L141 MapEliminator]: 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:10,940 INFO L141 MapEliminator]: 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:10,950 INFO L141 MapEliminator]: 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:10,958 INFO L141 MapEliminator]: 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:10,962 INFO L141 MapEliminator]: 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:10,966 INFO L141 MapEliminator]: 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:10,970 INFO L141 MapEliminator]: 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:11,718 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:12,205 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:12,391 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:12,392 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:12,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:17:12,406 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:12,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:17:12,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:17:12,599 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:17:12,602 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:12,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:12,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:12,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:12,603 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:17:12,603 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:12,603 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:12,603 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:12,603 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2020-07-29 03:17:12,603 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:12,604 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:12,653 INFO L141 MapEliminator]: 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:12,663 INFO L141 MapEliminator]: 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:12,666 INFO L141 MapEliminator]: 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:12,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,718 INFO L141 MapEliminator]: 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:12,726 INFO L141 MapEliminator]: 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:12,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,733 INFO L141 MapEliminator]: 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:12,754 INFO L141 MapEliminator]: 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:12,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,767 INFO L141 MapEliminator]: 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:12,772 INFO L141 MapEliminator]: 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:12,776 INFO L141 MapEliminator]: 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:12,779 INFO L141 MapEliminator]: 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:12,783 INFO L141 MapEliminator]: 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:12,787 INFO L141 MapEliminator]: 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:12,791 INFO L141 MapEliminator]: 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:12,795 INFO L141 MapEliminator]: 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:12,803 INFO L141 MapEliminator]: 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:12,811 INFO L141 MapEliminator]: 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:12,821 INFO L141 MapEliminator]: 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:12,832 INFO L141 MapEliminator]: 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:12,835 INFO L141 MapEliminator]: 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:12,839 INFO L141 MapEliminator]: 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:12,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,850 INFO L141 MapEliminator]: 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:12,853 INFO L141 MapEliminator]: 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:12,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,861 INFO L141 MapEliminator]: 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:12,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:12,880 INFO L141 MapEliminator]: 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:12,884 INFO L141 MapEliminator]: 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:13,355 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:13,871 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:14,233 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:14,240 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:14,246 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:14,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,255 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:14,282 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:14,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:14,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:14,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,319 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:14,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,367 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:14,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:14,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:14,376 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) [2020-07-29 03:17:14,420 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:14,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,432 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:14,457 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:14,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:14,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:14,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:14,497 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:14,528 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:14,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,530 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:17:14,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,532 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:17:14,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,536 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:14,558 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:14,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,565 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:14,589 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:14,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:14,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:14,601 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:14,631 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:14,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,636 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:14,672 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:14,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,676 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) [2020-07-29 03:17:14,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,735 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:14,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,739 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:14,762 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:14,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,768 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:14,811 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:14,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:14,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:14,820 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:14,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:14,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:14,869 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) [2020-07-29 03:17:14,926 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:14,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:14,973 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:14,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:14,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:14,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:14,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:14,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:14,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:14,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:14,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:17:15,003 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:17:15,003 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:15,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:17:15,007 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:17:15,008 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:17:15,008 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:15,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:17:15,050 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "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;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite2, node2_#t~ite3, 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~ite4, node3_#t~ite5, 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~ite6, node4_#t~ite7, 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~ite8, node5_#t~ite9, 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~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg;" "assume !(0 == assert_~arg % 256);" "main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38;" [2020-07-29 03:17:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:17:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:15,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:15,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {1102#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]; {1102#unseeded} is VALID [2020-07-29 03:17:15,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {1102#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {1102#unseeded} assume 0 == ~r1~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {1102#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1102#unseeded} is VALID [2020-07-29 03:17:15,269 INFO L280 TraceCheckUtils]: 4: Hoare triple {1102#unseeded} assume ~id1~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:15,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {1102#unseeded} assume 0 == ~st1~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {1102#unseeded} assume ~send1~0 == ~id1~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {1102#unseeded} assume 0 == ~mode1~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:15,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {1102#unseeded} assume ~id2~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:15,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {1102#unseeded} assume 0 == ~st2~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {1102#unseeded} assume ~send2~0 == ~id2~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {1102#unseeded} assume 0 == ~mode2~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:15,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {1102#unseeded} assume ~id3~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:15,277 INFO L280 TraceCheckUtils]: 13: Hoare triple {1102#unseeded} assume 0 == ~st3~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,278 INFO L280 TraceCheckUtils]: 14: Hoare triple {1102#unseeded} assume ~send3~0 == ~id3~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,279 INFO L280 TraceCheckUtils]: 15: Hoare triple {1102#unseeded} assume 0 == ~mode3~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:15,279 INFO L280 TraceCheckUtils]: 16: Hoare triple {1102#unseeded} assume ~id4~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:15,280 INFO L280 TraceCheckUtils]: 17: Hoare triple {1102#unseeded} assume 0 == ~st4~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,281 INFO L280 TraceCheckUtils]: 18: Hoare triple {1102#unseeded} assume ~send4~0 == ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {1102#unseeded} assume 0 == ~mode4~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:15,283 INFO L280 TraceCheckUtils]: 20: Hoare triple {1102#unseeded} assume ~id5~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:15,284 INFO L280 TraceCheckUtils]: 21: Hoare triple {1102#unseeded} assume 0 == ~st5~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,285 INFO L280 TraceCheckUtils]: 22: Hoare triple {1102#unseeded} assume ~send5~0 == ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,286 INFO L280 TraceCheckUtils]: 23: Hoare triple {1102#unseeded} assume 0 == ~mode5~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:15,286 INFO L280 TraceCheckUtils]: 24: Hoare triple {1102#unseeded} assume ~id1~0 != ~id2~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {1102#unseeded} assume ~id1~0 != ~id3~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,288 INFO L280 TraceCheckUtils]: 26: Hoare triple {1102#unseeded} assume ~id1~0 != ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,289 INFO L280 TraceCheckUtils]: 27: Hoare triple {1102#unseeded} assume ~id1~0 != ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,290 INFO L280 TraceCheckUtils]: 28: Hoare triple {1102#unseeded} assume ~id2~0 != ~id3~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,291 INFO L280 TraceCheckUtils]: 29: Hoare triple {1102#unseeded} assume ~id2~0 != ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,292 INFO L280 TraceCheckUtils]: 30: Hoare triple {1102#unseeded} assume ~id2~0 != ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,292 INFO L280 TraceCheckUtils]: 31: Hoare triple {1102#unseeded} assume ~id3~0 != ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,293 INFO L280 TraceCheckUtils]: 32: Hoare triple {1102#unseeded} assume ~id3~0 != ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,294 INFO L280 TraceCheckUtils]: 33: Hoare triple {1102#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1102#unseeded} is VALID [2020-07-29 03:17:15,295 INFO L280 TraceCheckUtils]: 34: Hoare triple {1102#unseeded} init_#res := init_~tmp~0; {1102#unseeded} is VALID [2020-07-29 03:17:15,295 INFO L280 TraceCheckUtils]: 35: Hoare triple {1102#unseeded} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1102#unseeded} is VALID [2020-07-29 03:17:15,296 INFO L280 TraceCheckUtils]: 36: Hoare triple {1102#unseeded} assume !(0 == assume_abort_if_not_~cond); {1102#unseeded} is VALID [2020-07-29 03:17:15,297 INFO L280 TraceCheckUtils]: 37: Hoare triple {1102#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; {1102#unseeded} is VALID [2020-07-29 03:17:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:15,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:17:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:15,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:15,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19))} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} 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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {1231#(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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {1231#(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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,419 INFO L280 TraceCheckUtils]: 10: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,421 INFO L280 TraceCheckUtils]: 12: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,422 INFO L280 TraceCheckUtils]: 13: Hoare triple {1231#(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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,423 INFO L280 TraceCheckUtils]: 14: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,424 INFO L280 TraceCheckUtils]: 15: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,425 INFO L280 TraceCheckUtils]: 16: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,426 INFO L280 TraceCheckUtils]: 17: Hoare triple {1231#(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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,428 INFO L280 TraceCheckUtils]: 19: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,429 INFO L280 TraceCheckUtils]: 20: Hoare triple {1231#(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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,430 INFO L280 TraceCheckUtils]: 21: Hoare triple {1231#(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; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,431 INFO L280 TraceCheckUtils]: 22: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 5;check_~tmp~1 := 1; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,433 INFO L280 TraceCheckUtils]: 24: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,434 INFO L280 TraceCheckUtils]: 25: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:15,435 INFO L280 TraceCheckUtils]: 26: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1115#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:17:15,436 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:15,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:15,474 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:15,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:15,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:15,482 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:15,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47 Second operand 3 states. [2020-07-29 03:17:15,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47. Second operand 3 states. Result 194 states and 287 transitions. Complement of second has 4 states. [2020-07-29 03:17:15,950 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:15,951 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:15,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2020-07-29 03:17:15,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:15,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:15,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:17:15,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:15,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:15,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:15,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. [2020-07-29 03:17:15,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:15,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:15,975 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2020-07-29 03:17:16,027 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 78 examples of accepted words. [2020-07-29 03:17:16,027 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:17:16,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:16,031 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:17:16,031 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:17:16,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:17:16,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:16,031 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:17:16,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:16,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:16,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:16,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:17:16,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:17:16,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:17:16,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 116 letters. Loop has 116 letters. [2020-07-29 03:17:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 116 letters. [2020-07-29 03:17:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 116 letters. Loop has 116 letters. [2020-07-29 03:17:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:16,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 28 letters. [2020-07-29 03:17:16,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 28 letters. [2020-07-29 03:17:16,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 28 letters. [2020-07-29 03:17:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:16,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:16,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:16,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:16,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:16,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:16,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:16,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:16,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:16,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:16,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:16,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:16,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:16,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:16,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:16,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:16,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:16,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:16,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:16,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:16,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:16,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:16,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:16,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:16,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:16,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:16,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:16,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:16,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:16,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:16,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:16,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:16,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:16,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:16,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:16,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:16,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:16,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:16,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:16,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:16,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:16,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:16,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:16,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:16,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 30 letters. [2020-07-29 03:17:16,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 30 letters. [2020-07-29 03:17:16,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 30 letters. [2020-07-29 03:17:16,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:16,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:16,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:16,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:16,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:16,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 28 letters. [2020-07-29 03:17:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 28 letters. [2020-07-29 03:17:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 28 letters. [2020-07-29 03:17:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:16,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:16,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:16,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:16,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:16,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:16,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:16,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:16,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:16,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:16,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:16,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:16,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:16,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:16,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:16,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:16,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:16,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:16,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:16,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:16,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:16,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:16,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:16,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:16,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:16,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:16,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:16,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:16,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:16,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:16,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:16,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:16,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:16,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:16,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:16,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:16,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:16,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:16,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:16,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:16,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:16,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:16,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:16,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:16,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:16,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:16,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:16,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:16,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:16,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:16,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:16,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:16,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:16,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:16,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:16,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:16,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:16,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:16,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:16,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:16,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:16,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:16,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:16,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:16,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:16,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:16,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:16,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:16,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:16,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:16,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:16,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:16,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:16,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:16,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:16,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:16,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:16,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:16,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:16,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:16,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:16,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:16,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:16,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:16,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:16,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:16,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:16,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:16,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:16,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:16,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:16,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:16,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:16,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:16,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:16,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:16,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:16,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:16,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,148 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:17:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-29 03:17:16,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:16,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:17:16,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 54 letters. [2020-07-29 03:17:16,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:16,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:17:16,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:16,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 0 states and 0 transitions. [2020-07-29 03:17:16,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:16,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:16,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:16,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:16,162 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:16,162 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:16,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:17:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:17:16,163 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:17:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:16,163 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:17:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:16,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:16,254 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:16,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:17:16,255 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:16,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:17:16,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:16,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:16,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:16,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:16,256 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:16,256 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:16,256 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:16,256 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:17:16,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:17:16,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:16,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:16,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:17:16 BoogieIcfgContainer [2020-07-29 03:17:16,264 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:17:16,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:17:16,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:17:16,265 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:17:16,266 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:06" (3/4) ... [2020-07-29 03:17:16,270 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:17:16,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:17:16,272 INFO L168 Benchmark]: Toolchain (without parser) took 11437.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -42.4 MB). Peak memory consumption was 283.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:16,273 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:16,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:16,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:16,275 INFO L168 Benchmark]: Boogie Preprocessor took 78.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:16,275 INFO L168 Benchmark]: RCFGBuilder took 1173.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:16,276 INFO L168 Benchmark]: BuchiAutomizer took 9537.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.8 MB). Peak memory consumption was 219.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:16,276 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:16,280 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 549.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1173.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9537.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.8 MB). Peak memory consumption was 219.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 9.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.5s. 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 116 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 521 SDtfs, 263 SDslu, 1164 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: inital167 mio100 ax135 hnf108 lsp25 ukn100 mio100 lsp100 div103 bol100 ite100 ukn100 eq221 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...