./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 460c5a2466ddacef0b654abb4130c31f8265660c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:22:51,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:22:51,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:22:51,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:22:51,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:22:51,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:22:51,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:22:51,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:22:51,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:22:51,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:22:51,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:22:51,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:22:51,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:22:51,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:22:51,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:22:51,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:22:51,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:22:51,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:22:51,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:22:51,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:22:51,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:22:51,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:22:51,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:22:51,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:22:51,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:22:51,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:22:51,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:22:51,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:22:51,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:22:51,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:22:51,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:22:51,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:22:51,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:22:51,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:22:51,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:22:51,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:22:51,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:22:51,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:22:51,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:22:51,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:22:51,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:22:51,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:22:51,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:22:51,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:22:51,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:22:51,651 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:22:51,651 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:22:51,651 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:22:51,651 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:22:51,651 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:22:51,652 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:22:51,652 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:22:51,652 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:22:51,652 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:22:51,652 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:22:51,652 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:22:51,652 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:22:51,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:22:51,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:22:51,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:22:51,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:22:51,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:22:51,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:22:51,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:22:51,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:22:51,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:22:51,655 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 460c5a2466ddacef0b654abb4130c31f8265660c [2019-12-07 14:22:51,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:22:51,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:22:51,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:22:51,767 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:22:51,768 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:22:51,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2019-12-07 14:22:51,813 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/data/f0f63e06d/211537324af34ae48ff67bff71ac6c70/FLAG384749634 [2019-12-07 14:22:52,160 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:22:52,161 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2019-12-07 14:22:52,168 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/data/f0f63e06d/211537324af34ae48ff67bff71ac6c70/FLAG384749634 [2019-12-07 14:22:52,176 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/data/f0f63e06d/211537324af34ae48ff67bff71ac6c70 [2019-12-07 14:22:52,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:22:52,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:22:52,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:22:52,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:22:52,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:22:52,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5575fbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52, skipping insertion in model container [2019-12-07 14:22:52,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:22:52,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:22:52,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:22:52,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:22:52,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:22:52,426 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:22:52,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52 WrapperNode [2019-12-07 14:22:52,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:22:52,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:22:52,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:22:52,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:22:52,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:22:52,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:22:52,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:22:52,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:22:52,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... [2019-12-07 14:22:52,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:22:52,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:22:52,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:22:52,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:22:52,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:22:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:22:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:22:53,609 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:22:53,609 INFO L287 CfgBuilder]: Removed 130 assume(true) statements. [2019-12-07 14:22:53,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:22:53 BoogieIcfgContainer [2019-12-07 14:22:53,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:22:53,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:22:53,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:22:53,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:22:53,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:22:52" (1/3) ... [2019-12-07 14:22:53,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f4a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:22:53, skipping insertion in model container [2019-12-07 14:22:53,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:52" (2/3) ... [2019-12-07 14:22:53,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f4a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:22:53, skipping insertion in model container [2019-12-07 14:22:53,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:22:53" (3/3) ... [2019-12-07 14:22:53,618 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-12-07 14:22:53,625 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:22:53,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:22:53,637 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:22:53,653 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:22:53,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:22:53,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:22:53,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:22:53,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:22:53,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:22:53,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:22:53,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:22:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-12-07 14:22:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:22:53,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:53,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:53,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1096111314, now seen corresponding path program 1 times [2019-12-07 14:22:53,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:53,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318564996] [2019-12-07 14:22:53,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:53,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318564996] [2019-12-07 14:22:53,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:53,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:22:53,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849226873] [2019-12-07 14:22:53,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:53,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:53,796 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-12-07 14:22:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:53,880 INFO L93 Difference]: Finished difference Result 406 states and 623 transitions. [2019-12-07 14:22:53,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:53,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 14:22:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:53,891 INFO L225 Difference]: With dead ends: 406 [2019-12-07 14:22:53,891 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 14:22:53,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 14:22:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2019-12-07 14:22:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 14:22:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 364 transitions. [2019-12-07 14:22:53,934 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 364 transitions. Word has length 22 [2019-12-07 14:22:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:53,934 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 364 transitions. [2019-12-07 14:22:53,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 364 transitions. [2019-12-07 14:22:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:22:53,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:53,937 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-12-07 14:22:53,937 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -495224614, now seen corresponding path program 1 times [2019-12-07 14:22:53,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:53,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584689237] [2019-12-07 14:22:53,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:22:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584689237] [2019-12-07 14:22:54,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:54,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:22:54,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412373833] [2019-12-07 14:22:54,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:54,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,003 INFO L87 Difference]: Start difference. First operand 245 states and 364 transitions. Second operand 3 states. [2019-12-07 14:22:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:54,051 INFO L93 Difference]: Finished difference Result 669 states and 993 transitions. [2019-12-07 14:22:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:54,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 14:22:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:54,054 INFO L225 Difference]: With dead ends: 669 [2019-12-07 14:22:54,055 INFO L226 Difference]: Without dead ends: 433 [2019-12-07 14:22:54,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-12-07 14:22:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 429. [2019-12-07 14:22:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 14:22:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 626 transitions. [2019-12-07 14:22:54,080 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 626 transitions. Word has length 43 [2019-12-07 14:22:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:54,080 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 626 transitions. [2019-12-07 14:22:54,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 626 transitions. [2019-12-07 14:22:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:22:54,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:54,083 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-12-07 14:22:54,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2034926073, now seen corresponding path program 1 times [2019-12-07 14:22:54,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223831194] [2019-12-07 14:22:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:22:54,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223831194] [2019-12-07 14:22:54,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:54,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:22:54,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768288282] [2019-12-07 14:22:54,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:54,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:54,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,119 INFO L87 Difference]: Start difference. First operand 429 states and 626 transitions. Second operand 3 states. [2019-12-07 14:22:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:54,155 INFO L93 Difference]: Finished difference Result 1183 states and 1726 transitions. [2019-12-07 14:22:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:54,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 14:22:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:54,159 INFO L225 Difference]: With dead ends: 1183 [2019-12-07 14:22:54,159 INFO L226 Difference]: Without dead ends: 766 [2019-12-07 14:22:54,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-07 14:22:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 760. [2019-12-07 14:22:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-07 14:22:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1089 transitions. [2019-12-07 14:22:54,180 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1089 transitions. Word has length 43 [2019-12-07 14:22:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:54,180 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1089 transitions. [2019-12-07 14:22:54,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1089 transitions. [2019-12-07 14:22:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:22:54,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:54,182 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-12-07 14:22:54,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -545992807, now seen corresponding path program 1 times [2019-12-07 14:22:54,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:54,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424099935] [2019-12-07 14:22:54,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:54,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424099935] [2019-12-07 14:22:54,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:54,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:54,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373183682] [2019-12-07 14:22:54,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:54,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,223 INFO L87 Difference]: Start difference. First operand 760 states and 1089 transitions. Second operand 3 states. [2019-12-07 14:22:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:54,274 INFO L93 Difference]: Finished difference Result 2188 states and 3119 transitions. [2019-12-07 14:22:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:54,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 14:22:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:54,280 INFO L225 Difference]: With dead ends: 2188 [2019-12-07 14:22:54,280 INFO L226 Difference]: Without dead ends: 1433 [2019-12-07 14:22:54,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-12-07 14:22:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1351. [2019-12-07 14:22:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2019-12-07 14:22:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1902 transitions. [2019-12-07 14:22:54,311 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1902 transitions. Word has length 43 [2019-12-07 14:22:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:54,311 INFO L462 AbstractCegarLoop]: Abstraction has 1351 states and 1902 transitions. [2019-12-07 14:22:54,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1902 transitions. [2019-12-07 14:22:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:22:54,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:54,313 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-12-07 14:22:54,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:54,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash 115340984, now seen corresponding path program 1 times [2019-12-07 14:22:54,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:54,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783615745] [2019-12-07 14:22:54,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:54,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783615745] [2019-12-07 14:22:54,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:54,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:22:54,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076393872] [2019-12-07 14:22:54,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:22:54,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:22:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:54,358 INFO L87 Difference]: Start difference. First operand 1351 states and 1902 transitions. Second operand 4 states. [2019-12-07 14:22:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:54,441 INFO L93 Difference]: Finished difference Result 3329 states and 4811 transitions. [2019-12-07 14:22:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:22:54,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 14:22:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:54,450 INFO L225 Difference]: With dead ends: 3329 [2019-12-07 14:22:54,450 INFO L226 Difference]: Without dead ends: 1991 [2019-12-07 14:22:54,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-07 14:22:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1615. [2019-12-07 14:22:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-07 14:22:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2350 transitions. [2019-12-07 14:22:54,494 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2350 transitions. Word has length 43 [2019-12-07 14:22:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:54,494 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2350 transitions. [2019-12-07 14:22:54,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:22:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2350 transitions. [2019-12-07 14:22:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:22:54,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:54,497 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:54,497 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash 527776824, now seen corresponding path program 1 times [2019-12-07 14:22:54,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:54,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914349626] [2019-12-07 14:22:54,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:54,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914349626] [2019-12-07 14:22:54,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:54,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:54,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450926957] [2019-12-07 14:22:54,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:54,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,543 INFO L87 Difference]: Start difference. First operand 1615 states and 2350 transitions. Second operand 3 states. [2019-12-07 14:22:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:54,602 INFO L93 Difference]: Finished difference Result 2605 states and 3787 transitions. [2019-12-07 14:22:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:54,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 14:22:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:54,609 INFO L225 Difference]: With dead ends: 2605 [2019-12-07 14:22:54,609 INFO L226 Difference]: Without dead ends: 1715 [2019-12-07 14:22:54,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-12-07 14:22:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1615. [2019-12-07 14:22:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-07 14:22:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2298 transitions. [2019-12-07 14:22:54,655 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2298 transitions. Word has length 62 [2019-12-07 14:22:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:54,655 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2298 transitions. [2019-12-07 14:22:54,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2298 transitions. [2019-12-07 14:22:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:22:54,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:54,658 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:54,658 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2118171801, now seen corresponding path program 1 times [2019-12-07 14:22:54,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:54,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114715937] [2019-12-07 14:22:54,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:22:54,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114715937] [2019-12-07 14:22:54,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:54,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:54,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240912342] [2019-12-07 14:22:54,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:22:54,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:54,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:22:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:54,730 INFO L87 Difference]: Start difference. First operand 1615 states and 2298 transitions. Second operand 4 states. [2019-12-07 14:22:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:54,804 INFO L93 Difference]: Finished difference Result 2537 states and 3607 transitions. [2019-12-07 14:22:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:22:54,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 14:22:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:54,814 INFO L225 Difference]: With dead ends: 2537 [2019-12-07 14:22:54,814 INFO L226 Difference]: Without dead ends: 1663 [2019-12-07 14:22:54,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-12-07 14:22:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1615. [2019-12-07 14:22:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-07 14:22:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2266 transitions. [2019-12-07 14:22:54,879 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2266 transitions. Word has length 62 [2019-12-07 14:22:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:54,879 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2266 transitions. [2019-12-07 14:22:54,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:22:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2266 transitions. [2019-12-07 14:22:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:22:54,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:54,882 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:54,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1903494512, now seen corresponding path program 1 times [2019-12-07 14:22:54,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:54,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569180248] [2019-12-07 14:22:54,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:54,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569180248] [2019-12-07 14:22:54,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631833640] [2019-12-07 14:22:54,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:55,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:22:55,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:22:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:22:55,044 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:22:55,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:22:55,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:22:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:22:55,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:22:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-12-07 14:22:55,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176644128] [2019-12-07 14:22:55,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:55,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:22:55,063 INFO L87 Difference]: Start difference. First operand 1615 states and 2266 transitions. Second operand 3 states. [2019-12-07 14:22:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:55,158 INFO L93 Difference]: Finished difference Result 3919 states and 5518 transitions. [2019-12-07 14:22:55,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:55,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-07 14:22:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:55,167 INFO L225 Difference]: With dead ends: 3919 [2019-12-07 14:22:55,167 INFO L226 Difference]: Without dead ends: 2317 [2019-12-07 14:22:55,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:22:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-12-07 14:22:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2315. [2019-12-07 14:22:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2019-12-07 14:22:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3232 transitions. [2019-12-07 14:22:55,236 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3232 transitions. Word has length 63 [2019-12-07 14:22:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:55,236 INFO L462 AbstractCegarLoop]: Abstraction has 2315 states and 3232 transitions. [2019-12-07 14:22:55,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3232 transitions. [2019-12-07 14:22:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 14:22:55,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:55,239 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:55,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:55,440 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:55,440 INFO L82 PathProgramCache]: Analyzing trace with hash -338448342, now seen corresponding path program 1 times [2019-12-07 14:22:55,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:55,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795491835] [2019-12-07 14:22:55,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:55,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795491835] [2019-12-07 14:22:55,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:55,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:22:55,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645039987] [2019-12-07 14:22:55,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:22:55,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:55,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:22:55,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:22:55,493 INFO L87 Difference]: Start difference. First operand 2315 states and 3232 transitions. Second operand 6 states. [2019-12-07 14:22:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:55,660 INFO L93 Difference]: Finished difference Result 4380 states and 6126 transitions. [2019-12-07 14:22:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:22:55,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-07 14:22:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:55,672 INFO L225 Difference]: With dead ends: 4380 [2019-12-07 14:22:55,672 INFO L226 Difference]: Without dead ends: 3120 [2019-12-07 14:22:55,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:22:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-07 14:22:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2641. [2019-12-07 14:22:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-12-07 14:22:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3748 transitions. [2019-12-07 14:22:55,760 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3748 transitions. Word has length 64 [2019-12-07 14:22:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:55,760 INFO L462 AbstractCegarLoop]: Abstraction has 2641 states and 3748 transitions. [2019-12-07 14:22:55,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:22:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3748 transitions. [2019-12-07 14:22:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:22:55,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:55,764 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:55,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -654493223, now seen corresponding path program 1 times [2019-12-07 14:22:55,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:55,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381449650] [2019-12-07 14:22:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381449650] [2019-12-07 14:22:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866711510] [2019-12-07 14:22:55,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:55,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:22:55,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:22:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:22:55,900 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:22:55,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:22:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:22:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:22:55,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:22:55,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-12-07 14:22:55,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220414302] [2019-12-07 14:22:55,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:55,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:55,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:22:55,912 INFO L87 Difference]: Start difference. First operand 2641 states and 3748 transitions. Second operand 3 states. [2019-12-07 14:22:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:56,081 INFO L93 Difference]: Finished difference Result 6390 states and 9078 transitions. [2019-12-07 14:22:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:56,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 14:22:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:56,095 INFO L225 Difference]: With dead ends: 6390 [2019-12-07 14:22:56,095 INFO L226 Difference]: Without dead ends: 3762 [2019-12-07 14:22:56,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:22:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3762 states. [2019-12-07 14:22:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3762 to 3760. [2019-12-07 14:22:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3760 states. [2019-12-07 14:22:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 5270 transitions. [2019-12-07 14:22:56,214 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 5270 transitions. Word has length 65 [2019-12-07 14:22:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:56,214 INFO L462 AbstractCegarLoop]: Abstraction has 3760 states and 5270 transitions. [2019-12-07 14:22:56,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 5270 transitions. [2019-12-07 14:22:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:22:56,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:56,219 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:56,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:56,420 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2023230088, now seen corresponding path program 1 times [2019-12-07 14:22:56,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:56,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465770642] [2019-12-07 14:22:56,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:56,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465770642] [2019-12-07 14:22:56,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665202092] [2019-12-07 14:22:56,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:56,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:22:56,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:22:56,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:22:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:56,565 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:22:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:56,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:22:56,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-12-07 14:22:56,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131538742] [2019-12-07 14:22:56,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:22:56,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:22:56,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:22:56,588 INFO L87 Difference]: Start difference. First operand 3760 states and 5270 transitions. Second operand 8 states. [2019-12-07 14:22:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:57,323 INFO L93 Difference]: Finished difference Result 14103 states and 19908 transitions. [2019-12-07 14:22:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:22:57,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 14:22:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:57,361 INFO L225 Difference]: With dead ends: 14103 [2019-12-07 14:22:57,361 INFO L226 Difference]: Without dead ends: 10356 [2019-12-07 14:22:57,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:22:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2019-12-07 14:22:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 6285. [2019-12-07 14:22:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6285 states. [2019-12-07 14:22:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 8751 transitions. [2019-12-07 14:22:57,592 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 8751 transitions. Word has length 66 [2019-12-07 14:22:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:57,593 INFO L462 AbstractCegarLoop]: Abstraction has 6285 states and 8751 transitions. [2019-12-07 14:22:57,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:22:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 8751 transitions. [2019-12-07 14:22:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:22:57,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:57,599 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:57,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:57,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 545826369, now seen corresponding path program 1 times [2019-12-07 14:22:57,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:57,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312458675] [2019-12-07 14:22:57,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:57,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312458675] [2019-12-07 14:22:57,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:57,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:22:57,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012404195] [2019-12-07 14:22:57,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:22:57,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:22:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:22:57,854 INFO L87 Difference]: Start difference. First operand 6285 states and 8751 transitions. Second operand 7 states. [2019-12-07 14:22:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:58,131 INFO L93 Difference]: Finished difference Result 9470 states and 13123 transitions. [2019-12-07 14:22:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:22:58,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 14:22:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:58,140 INFO L225 Difference]: With dead ends: 9470 [2019-12-07 14:22:58,140 INFO L226 Difference]: Without dead ends: 6700 [2019-12-07 14:22:58,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:22:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-12-07 14:22:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 6360. [2019-12-07 14:22:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6360 states. [2019-12-07 14:22:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 8847 transitions. [2019-12-07 14:22:58,305 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 8847 transitions. Word has length 67 [2019-12-07 14:22:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:58,306 INFO L462 AbstractCegarLoop]: Abstraction has 6360 states and 8847 transitions. [2019-12-07 14:22:58,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:22:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 8847 transitions. [2019-12-07 14:22:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:22:58,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:58,313 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:58,313 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash -707739700, now seen corresponding path program 1 times [2019-12-07 14:22:58,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:58,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326520710] [2019-12-07 14:22:58,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:58,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326520710] [2019-12-07 14:22:58,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:58,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:58,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709118317] [2019-12-07 14:22:58,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:58,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:58,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:58,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:58,340 INFO L87 Difference]: Start difference. First operand 6360 states and 8847 transitions. Second operand 3 states. [2019-12-07 14:22:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:58,516 INFO L93 Difference]: Finished difference Result 10817 states and 15103 transitions. [2019-12-07 14:22:58,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:58,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 14:22:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:58,525 INFO L225 Difference]: With dead ends: 10817 [2019-12-07 14:22:58,525 INFO L226 Difference]: Without dead ends: 6386 [2019-12-07 14:22:58,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6386 states. [2019-12-07 14:22:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6386 to 6262. [2019-12-07 14:22:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-12-07 14:22:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 8442 transitions. [2019-12-07 14:22:58,714 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 8442 transitions. Word has length 69 [2019-12-07 14:22:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:58,714 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 8442 transitions. [2019-12-07 14:22:58,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 8442 transitions. [2019-12-07 14:22:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:22:58,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:58,723 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:58,724 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash 362683979, now seen corresponding path program 1 times [2019-12-07 14:22:58,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:58,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091151683] [2019-12-07 14:22:58,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:22:58,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091151683] [2019-12-07 14:22:58,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:58,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:58,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684478559] [2019-12-07 14:22:58,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:22:58,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:22:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:58,778 INFO L87 Difference]: Start difference. First operand 6262 states and 8442 transitions. Second operand 4 states. [2019-12-07 14:22:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:58,944 INFO L93 Difference]: Finished difference Result 10732 states and 14513 transitions. [2019-12-07 14:22:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:22:58,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 14:22:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:58,952 INFO L225 Difference]: With dead ends: 10732 [2019-12-07 14:22:58,952 INFO L226 Difference]: Without dead ends: 6330 [2019-12-07 14:22:58,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2019-12-07 14:22:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 6262. [2019-12-07 14:22:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-12-07 14:22:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 8309 transitions. [2019-12-07 14:22:59,114 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 8309 transitions. Word has length 69 [2019-12-07 14:22:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:59,114 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 8309 transitions. [2019-12-07 14:22:59,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:22:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 8309 transitions. [2019-12-07 14:22:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:22:59,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:59,120 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:59,120 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1503035690, now seen corresponding path program 1 times [2019-12-07 14:22:59,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:59,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352272768] [2019-12-07 14:22:59,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:59,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352272768] [2019-12-07 14:22:59,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:59,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:59,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243289836] [2019-12-07 14:22:59,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:22:59,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:22:59,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:59,152 INFO L87 Difference]: Start difference. First operand 6262 states and 8309 transitions. Second operand 3 states. [2019-12-07 14:22:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:59,350 INFO L93 Difference]: Finished difference Result 10687 states and 14193 transitions. [2019-12-07 14:22:59,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:22:59,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 14:22:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:59,362 INFO L225 Difference]: With dead ends: 10687 [2019-12-07 14:22:59,363 INFO L226 Difference]: Without dead ends: 6285 [2019-12-07 14:22:59,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:22:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-12-07 14:22:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6176. [2019-12-07 14:22:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6176 states. [2019-12-07 14:22:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6176 states to 6176 states and 7928 transitions. [2019-12-07 14:22:59,567 INFO L78 Accepts]: Start accepts. Automaton has 6176 states and 7928 transitions. Word has length 69 [2019-12-07 14:22:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:22:59,567 INFO L462 AbstractCegarLoop]: Abstraction has 6176 states and 7928 transitions. [2019-12-07 14:22:59,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:22:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6176 states and 7928 transitions. [2019-12-07 14:22:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:22:59,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:22:59,572 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:59,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:22:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1181558282, now seen corresponding path program 1 times [2019-12-07 14:22:59,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:22:59,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419277705] [2019-12-07 14:22:59,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:59,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419277705] [2019-12-07 14:22:59,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:59,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:22:59,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824835208] [2019-12-07 14:22:59,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:22:59,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:22:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:22:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:59,598 INFO L87 Difference]: Start difference. First operand 6176 states and 7928 transitions. Second operand 4 states. [2019-12-07 14:22:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:59,850 INFO L93 Difference]: Finished difference Result 12986 states and 16818 transitions. [2019-12-07 14:22:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:22:59,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 14:22:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:22:59,860 INFO L225 Difference]: With dead ends: 12986 [2019-12-07 14:22:59,860 INFO L226 Difference]: Without dead ends: 8761 [2019-12-07 14:22:59,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8761 states. [2019-12-07 14:23:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8761 to 6602. [2019-12-07 14:23:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6602 states. [2019-12-07 14:23:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 8586 transitions. [2019-12-07 14:23:00,064 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 8586 transitions. Word has length 70 [2019-12-07 14:23:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:00,064 INFO L462 AbstractCegarLoop]: Abstraction has 6602 states and 8586 transitions. [2019-12-07 14:23:00,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 8586 transitions. [2019-12-07 14:23:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:23:00,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:00,068 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:00,069 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:00,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1480155978, now seen corresponding path program 1 times [2019-12-07 14:23:00,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:00,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704370887] [2019-12-07 14:23:00,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:00,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704370887] [2019-12-07 14:23:00,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:00,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:00,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500746568] [2019-12-07 14:23:00,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:00,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:00,137 INFO L87 Difference]: Start difference. First operand 6602 states and 8586 transitions. Second operand 4 states. [2019-12-07 14:23:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:00,326 INFO L93 Difference]: Finished difference Result 11245 states and 14643 transitions. [2019-12-07 14:23:00,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:00,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 14:23:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:00,331 INFO L225 Difference]: With dead ends: 11245 [2019-12-07 14:23:00,331 INFO L226 Difference]: Without dead ends: 6624 [2019-12-07 14:23:00,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6624 states. [2019-12-07 14:23:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6624 to 6602. [2019-12-07 14:23:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6602 states. [2019-12-07 14:23:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 8464 transitions. [2019-12-07 14:23:00,514 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 8464 transitions. Word has length 70 [2019-12-07 14:23:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:00,514 INFO L462 AbstractCegarLoop]: Abstraction has 6602 states and 8464 transitions. [2019-12-07 14:23:00,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 8464 transitions. [2019-12-07 14:23:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:23:00,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:00,519 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:00,519 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -591373394, now seen corresponding path program 1 times [2019-12-07 14:23:00,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:00,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377397588] [2019-12-07 14:23:00,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:00,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377397588] [2019-12-07 14:23:00,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491652794] [2019-12-07 14:23:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:00,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:23:00,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:00,640 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:00,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:23:00,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:23:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:00,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:23:00,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-12-07 14:23:00,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037395519] [2019-12-07 14:23:00,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:00,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:00,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:00,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:00,652 INFO L87 Difference]: Start difference. First operand 6602 states and 8464 transitions. Second operand 3 states. [2019-12-07 14:23:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:00,910 INFO L93 Difference]: Finished difference Result 14069 states and 18085 transitions. [2019-12-07 14:23:00,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:00,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 14:23:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:00,917 INFO L225 Difference]: With dead ends: 14069 [2019-12-07 14:23:00,917 INFO L226 Difference]: Without dead ends: 7481 [2019-12-07 14:23:00,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states. [2019-12-07 14:23:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 7462. [2019-12-07 14:23:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7462 states. [2019-12-07 14:23:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 9489 transitions. [2019-12-07 14:23:01,175 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 9489 transitions. Word has length 71 [2019-12-07 14:23:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:01,175 INFO L462 AbstractCegarLoop]: Abstraction has 7462 states and 9489 transitions. [2019-12-07 14:23:01,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 9489 transitions. [2019-12-07 14:23:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:23:01,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:01,180 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:01,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:01,381 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash -14451245, now seen corresponding path program 1 times [2019-12-07 14:23:01,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:01,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822649098] [2019-12-07 14:23:01,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:01,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822649098] [2019-12-07 14:23:01,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:01,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:01,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893633976] [2019-12-07 14:23:01,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:01,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:01,416 INFO L87 Difference]: Start difference. First operand 7462 states and 9489 transitions. Second operand 4 states. [2019-12-07 14:23:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:01,701 INFO L93 Difference]: Finished difference Result 14382 states and 18404 transitions. [2019-12-07 14:23:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:01,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 14:23:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:01,707 INFO L225 Difference]: With dead ends: 14382 [2019-12-07 14:23:01,708 INFO L226 Difference]: Without dead ends: 9321 [2019-12-07 14:23:01,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9321 states. [2019-12-07 14:23:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9321 to 7489. [2019-12-07 14:23:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7489 states. [2019-12-07 14:23:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 9584 transitions. [2019-12-07 14:23:01,937 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 9584 transitions. Word has length 74 [2019-12-07 14:23:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:01,938 INFO L462 AbstractCegarLoop]: Abstraction has 7489 states and 9584 transitions. [2019-12-07 14:23:01,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 9584 transitions. [2019-12-07 14:23:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:23:01,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:01,943 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:01,943 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:01,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash 794189323, now seen corresponding path program 1 times [2019-12-07 14:23:01,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:01,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44003976] [2019-12-07 14:23:01,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:01,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44003976] [2019-12-07 14:23:01,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:01,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:01,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074422334] [2019-12-07 14:23:01,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:01,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:01,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:01,975 INFO L87 Difference]: Start difference. First operand 7489 states and 9584 transitions. Second operand 4 states. [2019-12-07 14:23:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:02,243 INFO L93 Difference]: Finished difference Result 14540 states and 18604 transitions. [2019-12-07 14:23:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:02,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 14:23:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:02,248 INFO L225 Difference]: With dead ends: 14540 [2019-12-07 14:23:02,248 INFO L226 Difference]: Without dead ends: 7639 [2019-12-07 14:23:02,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2019-12-07 14:23:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 7489. [2019-12-07 14:23:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7489 states. [2019-12-07 14:23:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 9494 transitions. [2019-12-07 14:23:02,486 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 9494 transitions. Word has length 74 [2019-12-07 14:23:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:02,486 INFO L462 AbstractCegarLoop]: Abstraction has 7489 states and 9494 transitions. [2019-12-07 14:23:02,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 9494 transitions. [2019-12-07 14:23:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:23:02,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:02,491 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:02,491 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170252, now seen corresponding path program 1 times [2019-12-07 14:23:02,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:02,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986634615] [2019-12-07 14:23:02,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:02,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986634615] [2019-12-07 14:23:02,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:02,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:02,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875138813] [2019-12-07 14:23:02,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:02,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:02,515 INFO L87 Difference]: Start difference. First operand 7489 states and 9494 transitions. Second operand 3 states. [2019-12-07 14:23:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:02,679 INFO L93 Difference]: Finished difference Result 11180 states and 14251 transitions. [2019-12-07 14:23:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:02,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 14:23:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:02,683 INFO L225 Difference]: With dead ends: 11180 [2019-12-07 14:23:02,683 INFO L226 Difference]: Without dead ends: 4279 [2019-12-07 14:23:02,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2019-12-07 14:23:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4053. [2019-12-07 14:23:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-12-07 14:23:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 4949 transitions. [2019-12-07 14:23:02,816 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 4949 transitions. Word has length 74 [2019-12-07 14:23:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:02,816 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 4949 transitions. [2019-12-07 14:23:02,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 4949 transitions. [2019-12-07 14:23:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:23:02,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:02,820 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:02,820 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1478497803, now seen corresponding path program 1 times [2019-12-07 14:23:02,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:02,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567508173] [2019-12-07 14:23:02,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:02,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567508173] [2019-12-07 14:23:02,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761117846] [2019-12-07 14:23:02,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:02,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 14:23:02,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:02,969 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:03,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:23:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:03,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:23:03,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-12-07 14:23:03,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457305476] [2019-12-07 14:23:03,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:03,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:03,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:03,023 INFO L87 Difference]: Start difference. First operand 4053 states and 4949 transitions. Second operand 6 states. [2019-12-07 14:23:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:03,397 INFO L93 Difference]: Finished difference Result 9038 states and 10854 transitions. [2019-12-07 14:23:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:03,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-07 14:23:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:03,403 INFO L225 Difference]: With dead ends: 9038 [2019-12-07 14:23:03,403 INFO L226 Difference]: Without dead ends: 6346 [2019-12-07 14:23:03,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:23:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2019-12-07 14:23:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 5193. [2019-12-07 14:23:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-12-07 14:23:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6139 transitions. [2019-12-07 14:23:03,598 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6139 transitions. Word has length 75 [2019-12-07 14:23:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:03,598 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 6139 transitions. [2019-12-07 14:23:03,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6139 transitions. [2019-12-07 14:23:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:23:03,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:03,601 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:03,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:03,802 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687200, now seen corresponding path program 1 times [2019-12-07 14:23:03,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:03,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135005146] [2019-12-07 14:23:03,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:03,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135005146] [2019-12-07 14:23:03,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:03,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:03,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494864297] [2019-12-07 14:23:03,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:03,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:03,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:03,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:03,841 INFO L87 Difference]: Start difference. First operand 5193 states and 6139 transitions. Second operand 5 states. [2019-12-07 14:23:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:04,166 INFO L93 Difference]: Finished difference Result 10716 states and 12544 transitions. [2019-12-07 14:23:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:04,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-07 14:23:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:04,172 INFO L225 Difference]: With dead ends: 10716 [2019-12-07 14:23:04,172 INFO L226 Difference]: Without dead ends: 7061 [2019-12-07 14:23:04,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2019-12-07 14:23:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 5551. [2019-12-07 14:23:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5551 states. [2019-12-07 14:23:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 6455 transitions. [2019-12-07 14:23:04,367 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 6455 transitions. Word has length 75 [2019-12-07 14:23:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:04,367 INFO L462 AbstractCegarLoop]: Abstraction has 5551 states and 6455 transitions. [2019-12-07 14:23:04,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 6455 transitions. [2019-12-07 14:23:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:23:04,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,368 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:04,369 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash 584416540, now seen corresponding path program 1 times [2019-12-07 14:23:04,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515368431] [2019-12-07 14:23:04,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:23:04,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515368431] [2019-12-07 14:23:04,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:04,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:04,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214774199] [2019-12-07 14:23:04,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:04,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:04,418 INFO L87 Difference]: Start difference. First operand 5551 states and 6455 transitions. Second operand 4 states. [2019-12-07 14:23:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:04,763 INFO L93 Difference]: Finished difference Result 12827 states and 14798 transitions. [2019-12-07 14:23:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:04,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 14:23:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:04,767 INFO L225 Difference]: With dead ends: 12827 [2019-12-07 14:23:04,767 INFO L226 Difference]: Without dead ends: 5406 [2019-12-07 14:23:04,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2019-12-07 14:23:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 4215. [2019-12-07 14:23:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4215 states. [2019-12-07 14:23:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 4829 transitions. [2019-12-07 14:23:04,936 INFO L78 Accepts]: Start accepts. Automaton has 4215 states and 4829 transitions. Word has length 75 [2019-12-07 14:23:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:04,936 INFO L462 AbstractCegarLoop]: Abstraction has 4215 states and 4829 transitions. [2019-12-07 14:23:04,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4215 states and 4829 transitions. [2019-12-07 14:23:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 14:23:04,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,937 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:04,937 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,938 INFO L82 PathProgramCache]: Analyzing trace with hash -213304305, now seen corresponding path program 1 times [2019-12-07 14:23:04,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677878793] [2019-12-07 14:23:04,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:04,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677878793] [2019-12-07 14:23:04,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:04,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:04,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607105524] [2019-12-07 14:23:04,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:04,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:04,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:04,994 INFO L87 Difference]: Start difference. First operand 4215 states and 4829 transitions. Second operand 4 states. [2019-12-07 14:23:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:05,254 INFO L93 Difference]: Finished difference Result 8150 states and 9334 transitions. [2019-12-07 14:23:05,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:05,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 14:23:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:05,257 INFO L225 Difference]: With dead ends: 8150 [2019-12-07 14:23:05,257 INFO L226 Difference]: Without dead ends: 4517 [2019-12-07 14:23:05,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-07 14:23:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 3727. [2019-12-07 14:23:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2019-12-07 14:23:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4215 transitions. [2019-12-07 14:23:05,397 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4215 transitions. Word has length 96 [2019-12-07 14:23:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:05,397 INFO L462 AbstractCegarLoop]: Abstraction has 3727 states and 4215 transitions. [2019-12-07 14:23:05,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4215 transitions. [2019-12-07 14:23:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 14:23:05,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:05,399 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:05,399 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2122216595, now seen corresponding path program 1 times [2019-12-07 14:23:05,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:05,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343897764] [2019-12-07 14:23:05,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:23:05,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343897764] [2019-12-07 14:23:05,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:05,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:23:05,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914021875] [2019-12-07 14:23:05,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:05,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:05,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:05,490 INFO L87 Difference]: Start difference. First operand 3727 states and 4215 transitions. Second operand 6 states. [2019-12-07 14:23:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:05,995 INFO L93 Difference]: Finished difference Result 12750 states and 14454 transitions. [2019-12-07 14:23:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:05,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-12-07 14:23:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:06,004 INFO L225 Difference]: With dead ends: 12750 [2019-12-07 14:23:06,004 INFO L226 Difference]: Without dead ends: 10890 [2019-12-07 14:23:06,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-12-07 14:23:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 6229. [2019-12-07 14:23:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6229 states. [2019-12-07 14:23:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 7061 transitions. [2019-12-07 14:23:06,332 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 7061 transitions. Word has length 118 [2019-12-07 14:23:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:06,332 INFO L462 AbstractCegarLoop]: Abstraction has 6229 states and 7061 transitions. [2019-12-07 14:23:06,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 7061 transitions. [2019-12-07 14:23:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 14:23:06,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:06,335 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:06,335 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1409494772, now seen corresponding path program 1 times [2019-12-07 14:23:06,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:06,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980521065] [2019-12-07 14:23:06,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:23:06,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980521065] [2019-12-07 14:23:06,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:06,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:06,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478690852] [2019-12-07 14:23:06,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:06,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:06,363 INFO L87 Difference]: Start difference. First operand 6229 states and 7061 transitions. Second operand 4 states. [2019-12-07 14:23:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:06,744 INFO L93 Difference]: Finished difference Result 14386 states and 16439 transitions. [2019-12-07 14:23:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:06,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 14:23:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:06,750 INFO L225 Difference]: With dead ends: 14386 [2019-12-07 14:23:06,750 INFO L226 Difference]: Without dead ends: 8319 [2019-12-07 14:23:06,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8319 states. [2019-12-07 14:23:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8319 to 6457. [2019-12-07 14:23:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6457 states. [2019-12-07 14:23:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6457 states to 6457 states and 7371 transitions. [2019-12-07 14:23:07,038 INFO L78 Accepts]: Start accepts. Automaton has 6457 states and 7371 transitions. Word has length 123 [2019-12-07 14:23:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:07,038 INFO L462 AbstractCegarLoop]: Abstraction has 6457 states and 7371 transitions. [2019-12-07 14:23:07,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 7371 transitions. [2019-12-07 14:23:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 14:23:07,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:07,041 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-12-07 14:23:07,041 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash 147299194, now seen corresponding path program 1 times [2019-12-07 14:23:07,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:07,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875811899] [2019-12-07 14:23:07,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:07,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875811899] [2019-12-07 14:23:07,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:07,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:07,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830367059] [2019-12-07 14:23:07,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:07,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:07,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:07,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:07,084 INFO L87 Difference]: Start difference. First operand 6457 states and 7371 transitions. Second operand 5 states. [2019-12-07 14:23:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:07,247 INFO L93 Difference]: Finished difference Result 7960 states and 9081 transitions. [2019-12-07 14:23:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:07,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-12-07 14:23:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:07,248 INFO L225 Difference]: With dead ends: 7960 [2019-12-07 14:23:07,248 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:23:07,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:23:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:23:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:23:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:23:07,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2019-12-07 14:23:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:07,251 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:23:07,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:23:07,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:23:07,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:23:07,871 WARN L192 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 334 [2019-12-07 14:23:08,153 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 178 [2019-12-07 14:23:08,435 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 334 [2019-12-07 14:23:08,892 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 505 DAG size of output: 434 [2019-12-07 14:23:10,156 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 832 DAG size of output: 696 [2019-12-07 14:23:12,717 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 1156 DAG size of output: 932 [2019-12-07 14:23:13,017 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 251 [2019-12-07 14:23:13,430 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 512 DAG size of output: 396 [2019-12-07 14:23:13,928 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 497 DAG size of output: 407 [2019-12-07 14:23:16,113 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 1123 DAG size of output: 977 [2019-12-07 14:23:16,357 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 231 [2019-12-07 14:23:18,308 WARN L192 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 1080 DAG size of output: 934 [2019-12-07 14:23:18,686 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 375 [2019-12-07 14:23:19,043 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 189 [2019-12-07 14:23:19,265 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 237 [2019-12-07 14:23:19,755 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 310 [2019-12-07 14:23:20,094 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 255 [2019-12-07 14:23:23,266 WARN L192 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 305 DAG size of output: 95 [2019-12-07 14:23:24,019 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-12-07 14:23:24,951 WARN L192 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-12-07 14:23:25,836 WARN L192 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 84 [2019-12-07 14:23:27,035 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 14:23:28,379 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 304 DAG size of output: 76 [2019-12-07 14:23:32,719 WARN L192 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 404 DAG size of output: 108 [2019-12-07 14:23:44,588 WARN L192 SmtUtils]: Spent 11.87 s on a formula simplification. DAG size of input: 665 DAG size of output: 166 [2019-12-07 14:23:45,455 WARN L192 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-12-07 14:24:02,941 WARN L192 SmtUtils]: Spent 17.48 s on a formula simplification. DAG size of input: 825 DAG size of output: 152 [2019-12-07 14:24:03,299 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 60 [2019-12-07 14:24:05,775 WARN L192 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 229 DAG size of output: 93 [2019-12-07 14:24:06,357 WARN L192 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2019-12-07 14:24:10,148 WARN L192 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 365 DAG size of output: 112 [2019-12-07 14:24:10,628 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 59 [2019-12-07 14:24:16,504 WARN L192 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 371 DAG size of output: 111 [2019-12-07 14:24:33,519 WARN L192 SmtUtils]: Spent 17.01 s on a formula simplification. DAG size of input: 861 DAG size of output: 161 [2019-12-07 14:24:35,012 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 180 DAG size of output: 75 [2019-12-07 14:24:36,938 WARN L192 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 153 DAG size of output: 75 [2019-12-07 14:24:37,717 WARN L192 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-12-07 14:24:39,168 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 204 DAG size of output: 76 [2019-12-07 14:24:58,192 WARN L192 SmtUtils]: Spent 19.02 s on a formula simplification. DAG size of input: 869 DAG size of output: 166 [2019-12-07 14:25:03,668 WARN L192 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 339 DAG size of output: 102 [2019-12-07 14:25:05,083 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-12-07 14:25:05,944 WARN L192 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 73 [2019-12-07 14:25:06,252 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-12-07 14:25:07,087 WARN L192 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 66 [2019-12-07 14:25:07,194 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-07 14:25:07,972 WARN L192 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 73 [2019-12-07 14:25:08,755 WARN L192 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-07 14:25:10,086 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 112 DAG size of output: 68 [2019-12-07 14:25:13,269 WARN L192 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 231 DAG size of output: 77 [2019-12-07 14:25:14,626 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-12-07 14:25:16,936 WARN L192 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 133 DAG size of output: 71 [2019-12-07 14:25:21,394 WARN L192 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 283 DAG size of output: 98 [2019-12-07 14:25:21,853 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 54 [2019-12-07 14:25:22,639 WARN L192 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-12-07 14:25:23,209 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 55 [2019-12-07 14:25:26,743 WARN L192 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 245 DAG size of output: 105 [2019-12-07 14:25:28,603 WARN L192 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-12-07 14:25:28,606 INFO L242 CegarLoopResult]: At program point L366(lines 342 408) the Hoare annotation is: (let ((.cse29 (= 0 ~t1_st~0)) (.cse32 (= ~m_st~0 0)) (.cse18 (= 0 ~t2_st~0)) (.cse5 (= 0 ~t3_st~0)) (.cse33 (+ ~local~0 1))) (let ((.cse19 (<= ~token~0 .cse33)) (.cse23 (<= .cse33 ~token~0)) (.cse25 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse26 (+ ~local~0 2)) (.cse16 (<= 2 ~t1_st~0)) (.cse22 (not .cse5)) (.cse7 (not .cse18)) (.cse2 (= 1 ~t2_pc~0)) (.cse30 (<= 2 ~t2_st~0)) (.cse15 (<= ~m_pc~0 0)) (.cse27 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse28 (= 0 ~t1_pc~0)) (.cse24 (<= 2 ~m_st~0)) (.cse9 (<= ~t3_pc~0 0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse20 (<= 2 ~t3_st~0)) (.cse3 (<= 2 ~E_3~0)) (.cse21 (= 1 ~t3_pc~0)) (.cse17 (<= ~t2_pc~0 0)) (.cse4 (not .cse32)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 2 ~E_2~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse31 (or .cse32 .cse29)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse6 .cse1 .cse8 .cse3 .cse9 .cse10 .cse16 .cse17 .cse12 .cse5 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse20 .cse3 .cse21 .cse16 .cse22 .cse4 .cse6 .cse8 .cse10 .cse23 .cse12) (and .cse15 .cse6 .cse1 .cse8 .cse3 .cse20 .cse21 .cse10 .cse16 .cse17 .cse12 .cse18) (and .cse0 .cse1 .cse3 .cse20 .cse21 .cse24 .cse17 .cse18 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse6 .cse1 .cse8 .cse2 .cse3 .cse9 .cse10 .cse12 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse21 (<= ~token~0 (+ ~local~0 3)) .cse16 .cse6 .cse7 .cse8 .cse10 .cse25 .cse12 (< .cse26 ~token~0)) (and .cse0 .cse1 .cse3 .cse16 .cse17 .cse4 .cse5 .cse18 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse15 .cse6 .cse1 .cse8 .cse2 .cse3 .cse21 .cse10 .cse12 .cse4) (and .cse15 .cse27 .cse2 .cse3 .cse20 .cse21 .cse28 .cse29 .cse30 .cse6 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse6 .cse1 .cse8 .cse20 .cse3 .cse21 .cse10 .cse17 .cse12 .cse4 .cse18) (and .cse15 .cse6 .cse1 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse16 .cse12 .cse5) (and .cse15 .cse27 .cse3 .cse20 .cse21 .cse28 .cse17 .cse4 .cse18 .cse6 .cse10 .cse31 .cse12) (and .cse15 .cse27 .cse2 .cse3 .cse20 .cse21 .cse28 .cse4 .cse30 .cse6 .cse10 .cse31 .cse12) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse12 .cse13) (and .cse15 .cse6 .cse1 .cse7 .cse8 .cse2 .cse20 .cse3 .cse21 .cse10 .cse16 .cse12) (and .cse0 .cse1 .cse3 .cse20 .cse21 .cse16 .cse17 .cse4 .cse18 .cse6 .cse8 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse17 .cse4 .cse5 .cse18 .cse6 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse14) (and .cse15 .cse27 .cse3 .cse28 .cse17 .cse4 .cse5 .cse18 .cse6 .cse9 .cse10 .cse31 .cse12) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse21 .cse16 .cse22 .cse4 .cse6 .cse7 .cse8 .cse10 .cse12) (and .cse0 .cse2 .cse3 .cse28 .cse24 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse27 .cse3 .cse28 .cse29 .cse17 .cse5 .cse18 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse20 .cse21 .cse28 .cse24 .cse29 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse13) (and .cse0 .cse1 .cse3 .cse24 .cse17 .cse5 .cse18 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse27 .cse2 .cse3 .cse28 .cse4 .cse5 .cse30 .cse6 .cse9 .cse10 .cse31 .cse12) (and .cse15 .cse6 .cse1 .cse8 .cse3 .cse9 .cse10 .cse17 .cse12 .cse4 .cse5 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse16 .cse4 .cse6 .cse7 .cse8 .cse10 .cse25 (<= .cse26 ~token~0) .cse12 (<= ~token~0 .cse26)) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse21 .cse22 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse27 .cse2 .cse3 .cse28 .cse29 .cse5 .cse30 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse27 .cse3 .cse20 .cse21 .cse28 .cse29 .cse17 .cse18 .cse6 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse20 .cse21 .cse28 .cse24 .cse29 .cse17 .cse18 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse27 .cse3 .cse28 .cse24 .cse29 .cse17 .cse5 .cse18 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse20 .cse3 .cse21 .cse17 .cse4 .cse18 .cse6 .cse8 .cse10 .cse11 .cse31 .cse12 .cse13 .cse14)))) [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236-2(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236-3(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236-5(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236-6(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236-8(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,606 INFO L246 CegarLoopResult]: For program point L236-9(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-11(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-12(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-14(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-15(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-17(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-18(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L236-20(lines 236 245) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L369(lines 369 376) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237-1(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237-2(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237-3(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237-4(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237-5(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L237-6(lines 237 242) no Hoare annotation was computed. [2019-12-07 14:25:28,607 INFO L246 CegarLoopResult]: For program point L700(lines 700 704) no Hoare annotation was computed. [2019-12-07 14:25:28,608 INFO L242 CegarLoopResult]: At program point L173-1(lines 161 192) the Hoare annotation is: (let ((.cse28 (= ~m_st~0 0)) (.cse17 (= 0 ~t2_st~0))) (let ((.cse21 (= 0 ~t1_st~0)) (.cse4 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse7 (not .cse17)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (<= 2 ~E_1~0)) (.cse16 (not .cse28)) (.cse13 (not (= 0 ~t3_st~0))) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (let ((.cse14 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18) (and .cse6 .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse10 .cse11 .cse16 .cse13 .cse18))) (.cse25 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse22 (<= 2 ~t2_st~0)) (.cse26 (or .cse28 .cse21)) (.cse12 (<= ~m_pc~0 0)) (.cse19 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse20 (= 0 ~t1_pc~0)) (.cse15 (<= ~t2_pc~0 0)) (.cse23 (<= ~token~0 ~local~0)) (.cse24 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (< (+ ~local~0 2) ~token~0) .cse11) (and (or (and .cse6 .cse12 .cse1 .cse7 .cse8 .cse2 .cse3 .cse10 .cse11 .cse13) (and .cse6 .cse12 .cse1 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11)) .cse5) (and .cse14 .cse5) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse16 .cse13 .cse17 .cse6 .cse8 .cse10 .cse11 .cse18) (and .cse6 .cse12 .cse1 .cse8 .cse2 .cse3 .cse10 .cse11 .cse16 .cse13) (and .cse6 .cse12 .cse1 .cse8 .cse2 .cse3 .cse10 .cse11 .cse18 .cse16) (and .cse12 .cse19 .cse2 .cse3 .cse20 .cse21 .cse13 .cse22 .cse6 .cse10 .cse23 .cse11 .cse24) (and .cse14 .cse23 .cse24) (and .cse6 .cse12 .cse1 .cse8 .cse3 .cse10 .cse5 .cse15 .cse11 .cse13 .cse17) (and .cse0 .cse3 .cse20 .cse25 .cse21 .cse15 .cse13 .cse17 .cse6 .cse8 .cse10 .cse23 .cse11 .cse18 .cse24) (and .cse0 .cse2 .cse3 .cse20 .cse25 .cse21 .cse13 .cse6 .cse7 .cse8 .cse10 .cse23 .cse11 .cse18 .cse24) (and .cse0 .cse1 .cse3 .cse15 .cse16 .cse13 .cse17 .cse6 .cse8 .cse10 .cse23 .cse26 .cse11 .cse18 .cse24) (and .cse0 .cse1 .cse3 .cse25 .cse15 .cse13 .cse16 .cse17 .cse6 .cse8 .cse10 .cse23 .cse11 .cse18 .cse24) (let ((.cse27 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse27) .cse2 .cse3 .cse5 .cse16 .cse17 .cse6 .cse8 .cse10 (<= .cse27 ~token~0) .cse11)) (and .cse6 .cse12 .cse1 .cse8 .cse2 .cse3 .cse10 .cse11 .cse16 .cse17) (and .cse12 .cse6 .cse19 .cse3 .cse10 .cse20 .cse26 .cse15 .cse11 .cse16 .cse13 .cse17) (and .cse12 .cse22 .cse6 .cse19 .cse2 .cse3 .cse10 .cse20 .cse26 .cse11 .cse16 .cse13) (and .cse6 .cse12 .cse1 .cse8 .cse3 .cse10 .cse15 .cse11 .cse16 .cse13 .cse17) (and .cse12 .cse19 .cse3 .cse20 .cse21 .cse15 .cse13 .cse17 .cse6 .cse10 .cse23 .cse11 .cse24))))) [2019-12-07 14:25:28,608 INFO L249 CegarLoopResult]: At program point L706(lines 653 711) the Hoare annotation is: true [2019-12-07 14:25:28,608 INFO L246 CegarLoopResult]: For program point L46(lines 46 54) no Hoare annotation was computed. [2019-12-07 14:25:28,608 INFO L242 CegarLoopResult]: At program point L247(lines 235 249) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_3~0) (= 0 ~t1_pc~0) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (= 0 ~t3_st~0) (= 0 ~t2_st~0) (<= 2 ~E_M~0) (<= ~t3_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-12-07 14:25:28,608 INFO L242 CegarLoopResult]: At program point L247-1(lines 235 249) the Hoare annotation is: (let ((.cse19 (= 0 ~t2_st~0))) (let ((.cse4 (= 0 ~t1_pc~0)) (.cse6 (= 0 ~t1_st~0)) (.cse16 (= 0 ~t3_st~0)) (.cse17 (<= ~t3_pc~0 0)) (.cse0 (= 1 ~t2_pc~0)) (.cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse9 (not .cse19)) (.cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse20 (= 1 ~t1_pc~0)) (.cse1 (<= 2 ~t3_st~0)) (.cse2 (<= 2 ~E_3~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (<= 2 ~E_2~0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse5 .cse4 .cse6 .cse7 .cse16 (<= 2 ~t2_st~0) .cse8 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15) (and (= ULTIMATE.start_eval_~tmp~0 1) .cse2 .cse4 .cse6 .cse18 .cse7 .cse16 .cse19 .cse8 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse20 .cse2 .cse18 .cse7 .cse16 .cse19 .cse8 .cse10 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse20 .cse0 .cse2 .cse5 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse20 .cse0 .cse2 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse20 .cse1 .cse2 .cse3 .cse18 .cse7 .cse19 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15)))) [2019-12-07 14:25:28,608 INFO L242 CegarLoopResult]: At program point L247-2(lines 235 249) the Hoare annotation is: (let ((.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= 0 ~t2_st~0)) (.cse22 (+ ~local~0 1))) (let ((.cse10 (= 0 ~t3_st~0)) (.cse5 (<= ~t3_pc~0 0)) (.cse15 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse20 (<= ~token~0 .cse22)) (.cse16 (not .cse11)) (.cse21 (<= .cse22 ~token~0)) (.cse12 (<= ~m_pc~0 0)) (.cse13 (= 1 ~t2_pc~0)) (.cse14 (or (= ~E_2~0 1) .cse9)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (<= 2 ~E_3~0)) (.cse18 (<= 2 ~t3_st~0)) (.cse19 (= 1 ~t3_pc~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse7 .cse8 .cse10) (and .cse1 .cse2 .cse13 .cse4 .cse15 .cse8 .cse10 .cse0 .cse3 .cse16 .cse5 .cse17 .cse7 .cse9) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse1 .cse2 .cse13 .cse20 .cse4 .cse8 .cse10 .cse0 .cse3 .cse16 .cse5 .cse21 .cse7 .cse9) (and .cse1 .cse2 .cse13 .cse18 .cse4 .cse19 .cse15 .cse8 .cse0 .cse16 .cse3 .cse17 .cse14 .cse7) (and .cse1 .cse2 .cse13 .cse20 .cse18 .cse4 .cse19 .cse8 .cse0 .cse16 .cse3 .cse21 .cse14 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse13 .cse4 .cse19 .cse14 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11)))) [2019-12-07 14:25:28,608 INFO L242 CegarLoopResult]: At program point L247-3(lines 235 249) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (let ((.cse10 (<= ~t3_pc~0 0)) (.cse6 (= 0 ~t3_st~0)) (.cse16 (<= ~m_pc~0 0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse18 (= 1 ~t3_pc~0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (not (= ~m_st~0 0))) (.cse7 (<= 2 ~E_M~0)) (.cse8 (not (= 0 ~t2_st~0))) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse12 (<= 2 ~E_2~0)) (.cse17 (or (= ~E_2~0 1) .cse15)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse7 .cse1 .cse8 .cse9 .cse2 .cse10 .cse12 .cse17 .cse14 .cse5 .cse6) (and .cse16 .cse7 .cse1 .cse8 .cse9 .cse2 .cse18 .cse12 .cse17 .cse14 .cse5) (let ((.cse19 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 (<= 2 ~t3_st~0) .cse18 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse13 (<= .cse19 ~token~0) .cse14 (<= ~token~0 .cse19)))))) [2019-12-07 14:25:28,608 INFO L242 CegarLoopResult]: At program point L247-4(lines 235 249) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 1)) (.cse0 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse11 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse12 (<= 2 ~t1_st~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= 0 ~t3_st~0))) (.cse13 (not (= 0 ~t2_st~0))) (.cse1 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse14 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (or (= ~E_2~0 1) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (.cse15 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (<= 2 ~E_1~0))) (or (and (<= ~m_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 (<= ~token~0 (+ ~local~0 3)) .cse12 .cse9 .cse13 .cse1 .cse14 .cse5 .cse15 (< (+ ~local~0 2) ~token~0) .cse7) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 .cse12 .cse8 .cse9 .cse13 .cse1 .cse14 .cse5 .cse6 .cse15 .cse7))) [2019-12-07 14:25:28,609 INFO L242 CegarLoopResult]: At program point L247-5(lines 235 249) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse20 (= 0 ~t2_st~0)) (.cse27 (+ ~local~0 1))) (let ((.cse22 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse24 (<= ~token~0 .cse27)) (.cse26 (<= .cse27 ~token~0)) (.cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse9 (not .cse20)) (.cse10 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (+ ~local~0 2)) (.cse0 (= ~m_pc~0 1)) (.cse25 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (<= 2 ~t1_st~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse16 (<= ~m_pc~0 0)) (.cse8 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse17 (<= ~t3_pc~0 0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (or (= ~E_2~0 1) .cse21)) (.cse15 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse19 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0) .cse15 (<= ~token~0 .cse14)) (and .cse16 .cse8 .cse1 .cse3 .cse17 .cse11 .cse13 .cse6 .cse18 .cse15 .cse19 .cse20) (and .cse16 .cse1 .cse2 .cse3 .cse5 .cse6 .cse19 .cse8 .cse9 .cse10 .cse17 .cse11 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse17 .cse10 .cse11 .cse13 .cse15 .cse21) (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse9 .cse17 .cse10 .cse11 .cse22 .cse15 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse25 .cse4 .cse6 .cse7 .cse20 .cse8 .cse11 .cse26 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse15 .cse23) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse6 .cse7 .cse19 .cse20 .cse8 .cse17 .cse11 .cse26 .cse13 .cse15 .cse21) (and .cse0 .cse1 .cse3 .cse6 .cse18 .cse7 .cse19 .cse20 .cse8 .cse17 .cse11 .cse13 .cse15 .cse21) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse16 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 3)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 (< .cse14 ~token~0) .cse15) (and .cse16 .cse8 .cse1 .cse25 .cse3 .cse4 .cse11 .cse18 .cse15 .cse7 .cse21 .cse20) (and .cse16 .cse8 .cse1 .cse3 .cse17 .cse11 .cse18 .cse15 .cse7 .cse21 .cse19 .cse20) (and .cse0 .cse1 .cse3 .cse25 .cse4 .cse6 .cse18 .cse7 .cse20 .cse8 .cse11 .cse13 .cse15 .cse21) (and .cse16 .cse8 .cse1 .cse25 .cse3 .cse4 .cse11 .cse13 .cse6 .cse18 .cse15 .cse20) (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse17 .cse11 .cse12 .cse15 .cse7 .cse19)))) [2019-12-07 14:25:28,609 INFO L246 CegarLoopResult]: For program point L49(lines 49 53) no Hoare annotation was computed. [2019-12-07 14:25:28,609 INFO L242 CegarLoopResult]: At program point L247-6(lines 235 249) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse28 (+ ~local~0 1))) (let ((.cse20 (+ ~local~0 2)) (.cse26 (<= ~token~0 .cse28)) (.cse27 (<= .cse28 ~token~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (<= ~m_pc~0 0)) (.cse22 (<= ~t3_pc~0 0)) (.cse23 (= 0 ~t3_st~0)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse14 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse15 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse16 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse17 (not .cse7)) (.cse18 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse19 (or (= ~E_2~0 1) .cse21)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4 .cse15 .cse5 .cse16 .cse8 .cse17 .cse18 .cse10 .cse19 .cse11 (<= .cse20 ~token~0) .cse12 (<= ~token~0 .cse20)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse21) (and .cse0 .cse8 .cse1 .cse2 .cse22 .cse10 .cse11 .cse5 .cse6 .cse12 .cse23 .cse7) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse5 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse14 .cse2 .cse4 .cse10 .cse19 .cse12 .cse16) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 (< .cse20 ~token~0) .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse24 .cse12 .cse21 .cse25) (and .cse13 .cse1 .cse26 .cse14 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse27 .cse19 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse5 .cse6 .cse16 .cse23 .cse7 .cse8 .cse22 .cse10 .cse11 .cse12 .cse21) (and .cse13 .cse1 .cse26 .cse14 .cse2 .cse5 .cse16 .cse23 .cse7 .cse8 .cse22 .cse10 .cse27 .cse11 .cse12 .cse21) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse22 .cse10 .cse6 .cse12 .cse16 .cse21 .cse23 .cse7) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse16 .cse8 .cse9 .cse17 .cse18 .cse10 .cse24 .cse19 .cse12 .cse25) (and .cse13 .cse1 .cse14 .cse2 .cse15 .cse5 .cse16 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse8 .cse1 .cse14 .cse2 .cse22 .cse10 .cse19 .cse12 .cse16 .cse23) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse5 .cse16 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12)))) [2019-12-07 14:25:28,610 INFO L242 CegarLoopResult]: At program point L380(lines 342 408) the Hoare annotation is: (let ((.cse26 (= 0 ~t1_st~0)) (.cse31 (= ~m_st~0 0)) (.cse11 (= 0 ~t2_st~0)) (.cse32 (+ ~local~0 1))) (let ((.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse22 (+ ~local~0 2)) (.cse29 (<= ~token~0 .cse32)) (.cse30 (<= .cse32 ~token~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse20 (not .cse11)) (.cse19 (= 1 ~t2_pc~0)) (.cse27 (<= 2 ~t2_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse24 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse25 (= 0 ~t1_pc~0)) (.cse15 (<= 2 ~m_st~0)) (.cse10 (= 0 ~t3_st~0)) (.cse5 (<= ~t3_pc~0 0)) (.cse14 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse12 (<= 2 ~t3_st~0)) (.cse4 (<= 2 ~E_3~0)) (.cse13 (= 1 ~t3_pc~0)) (.cse8 (<= ~t2_pc~0 0)) (.cse23 (not .cse31)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse28 (or .cse31 .cse26)) (.cse9 (<= 2 ~E_1~0)) (.cse17 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse18 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse14 .cse2 .cse4 .cse12 .cse13 .cse15 .cse8 .cse11 .cse1 .cse3 .cse6 .cse16 .cse9 .cse17 .cse18) (and .cse14 .cse2 .cse19 .cse12 .cse4 .cse13 (<= ~token~0 (+ ~local~0 3)) .cse7 .cse1 .cse20 .cse3 .cse6 .cse21 .cse9 (< .cse22 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse9 .cse23 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse13 .cse6 .cse9 .cse23) (and .cse14 .cse2 .cse4 .cse7 .cse8 .cse23 .cse10 .cse11 .cse1 .cse3 .cse5 .cse6 .cse9 .cse17) (and .cse0 .cse24 .cse19 .cse4 .cse12 .cse13 .cse25 .cse26 .cse27 .cse1 .cse6 .cse16 .cse9 .cse18) (and .cse14 .cse2 .cse19 .cse4 .cse12 .cse13 .cse23 .cse1 .cse20 .cse3 .cse6 .cse16 .cse9 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6 .cse8 .cse9 .cse23 .cse11) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse24 .cse4 .cse12 .cse13 .cse25 .cse8 .cse23 .cse11 .cse1 .cse6 .cse28 .cse9) (and .cse14 .cse2 .cse19 .cse4 .cse23 .cse10 .cse1 .cse20 .cse3 .cse5 .cse6 .cse16 .cse9 .cse18 .cse17) (and .cse0 .cse24 .cse19 .cse4 .cse12 .cse13 .cse25 .cse23 .cse27 .cse1 .cse6 .cse28 .cse9) (and .cse14 .cse2 .cse29 .cse19 .cse4 .cse7 .cse23 .cse10 .cse1 .cse3 .cse5 .cse6 .cse30 .cse9 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse19 .cse12 .cse4 .cse13 .cse6 .cse7 .cse9) (and .cse14 .cse19 .cse4 .cse12 .cse13 .cse25 .cse15 .cse26 .cse1 .cse20 .cse3 .cse6 .cse16 .cse9 .cse17 .cse18) (and .cse14 .cse2 .cse4 .cse12 .cse13 .cse7 .cse8 .cse23 .cse11 .cse1 .cse3 .cse6 .cse9 .cse17) (and .cse14 .cse2 .cse4 .cse8 .cse23 .cse10 .cse11 .cse1 .cse3 .cse5 .cse6 .cse16 .cse28 .cse9 .cse17 .cse18) (and .cse0 .cse24 .cse4 .cse25 .cse8 .cse23 .cse10 .cse11 .cse1 .cse5 .cse6 .cse28 .cse9) (and .cse14 .cse2 .cse19 .cse4 .cse12 .cse13 .cse7 .cse23 .cse1 .cse20 .cse3 .cse6 .cse9) (and .cse0 .cse24 .cse4 .cse25 .cse26 .cse8 .cse10 .cse11 .cse1 .cse5 .cse6 .cse16 .cse9 .cse18) (and .cse14 .cse19 .cse4 .cse25 .cse15 .cse26 .cse10 .cse1 .cse20 .cse3 .cse5 .cse6 .cse16 .cse9 .cse17 .cse18) (and .cse14 .cse2 .cse4 .cse15 .cse8 .cse10 .cse11 .cse1 .cse3 .cse5 .cse6 .cse16 .cse9 .cse17 .cse18) (and .cse0 .cse24 .cse19 .cse4 .cse25 .cse23 .cse10 .cse27 .cse1 .cse5 .cse6 .cse28 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse23 .cse10 .cse11) (and .cse14 .cse2 .cse19 .cse4 .cse13 .cse7 .cse23 .cse1 .cse20 .cse3 .cse6 .cse21 (<= .cse22 ~token~0) .cse9 (<= ~token~0 .cse22)) (and .cse14 .cse2 .cse29 .cse19 .cse12 .cse4 .cse13 .cse7 .cse23 .cse1 .cse3 .cse6 .cse30 .cse9) (and .cse14 .cse2 .cse19 .cse4 .cse7 .cse23 .cse10 .cse1 .cse20 .cse3 .cse5 .cse6 .cse9 .cse17) (and .cse0 .cse24 .cse19 .cse4 .cse25 .cse26 .cse10 .cse27 .cse1 .cse5 .cse6 .cse16 .cse9 .cse18) (and .cse0 .cse24 .cse4 .cse12 .cse13 .cse25 .cse26 .cse8 .cse11 .cse1 .cse6 .cse16 .cse9 .cse18) (and .cse14 .cse4 .cse12 .cse13 .cse25 .cse15 .cse26 .cse8 .cse11 .cse1 .cse3 .cse6 .cse16 .cse9 .cse17 .cse18) (and .cse14 .cse24 .cse4 .cse25 .cse15 .cse26 .cse8 .cse10 .cse11 .cse1 .cse5 .cse6 .cse16 .cse9 .cse17 .cse18) (and .cse14 .cse2 .cse12 .cse4 .cse13 .cse8 .cse23 .cse11 .cse1 .cse3 .cse6 .cse16 .cse28 .cse9 .cse17 .cse18)))) [2019-12-07 14:25:28,610 INFO L242 CegarLoopResult]: At program point L50(lines 45 84) the Hoare annotation is: (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (<= 2 ~E_3~0) (<= 2 ~t3_st~0) (= 1 ~t3_pc~0) (<= ~token~0 (+ ~local~0 3)) (<= 2 ~t1_st~0) (not (= ~m_st~0 0)) (<= 2 ~E_M~0) (not (= 0 ~t2_st~0)) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_2~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~E_1~0) (< (+ ~local~0 2) ~token~0)) [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-2(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-3(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-5(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-6(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-8(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-9(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-11(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-12(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-14(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-15(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-17(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-18(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,610 INFO L246 CegarLoopResult]: For program point L255-20(lines 255 264) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256-1(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256-2(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256-3(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256-4(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256-5(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L256-6(lines 256 261) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L246 CegarLoopResult]: For program point L126(lines 126 134) no Hoare annotation was computed. [2019-12-07 14:25:28,611 INFO L242 CegarLoopResult]: At program point L129(lines 129 133) the Hoare annotation is: (let ((.cse26 (= ~m_st~0 0)) (.cse19 (= 0 ~t1_st~0))) (let ((.cse23 (or .cse26 .cse19)) (.cse15 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse18 (= 0 ~t1_pc~0)) (.cse22 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse0 (= ~m_pc~0 1)) (.cse6 (= 0 ~t3_st~0)) (.cse10 (<= ~t3_pc~0 0)) (.cse20 (<= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (<= ~local~0 ~token~0)) (.cse14 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (not (= 0 ~t2_st~0))) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse16 (<= 2 ~t3_st~0)) (.cse2 (<= 2 ~E_3~0)) (.cse17 (= 1 ~t3_pc~0)) (.cse11 (<= 2 ~E_2~0)) (.cse4 (<= ~t2_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse5 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse2 .cse16 .cse17 .cse18 .cse19 .cse4 .cse7 .cse8 .cse11 .cse20 .cse12 .cse21) (and .cse14 .cse15 .cse2 .cse18 .cse19 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse21) (and .cse14 .cse7 .cse1 .cse8 .cse9 .cse22 .cse2 .cse17 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse20 .cse23 .cse12 .cse13 .cse21) (and .cse14 .cse15 .cse2 .cse16 .cse17 .cse18 .cse4 .cse5 .cse7 .cse8 .cse11 .cse23 .cse12) (and .cse0 .cse1 .cse2 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse14 .cse15 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse23 .cse12) (and .cse0 .cse2 .cse16 .cse17 .cse18 .cse24 .cse19 .cse4 .cse7 .cse8 .cse9 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse0 .cse15 .cse2 .cse18 .cse24 .cse19 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse25) .cse22 .cse2 .cse16 .cse17 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 (<= .cse25 ~token~0) .cse12)) (and .cse14 .cse7 .cse1 .cse8 .cse9 .cse16 .cse2 .cse17 .cse11 .cse3 .cse4 .cse12) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse7 .cse1 .cse8 .cse9 .cse22 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse14 .cse7 .cse1 .cse8 .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse6) (and .cse14 .cse7 .cse1 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse24 .cse4 .cse7 .cse8 .cse9 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse14 .cse7 .cse1 .cse8 .cse9 .cse16 .cse2 .cse17 .cse11 .cse4 .cse12 .cse5)))) [2019-12-07 14:25:28,612 INFO L242 CegarLoopResult]: At program point L394(lines 342 408) the Hoare annotation is: (let ((.cse16 (= 0 ~t2_st~0)) (.cse7 (= 0 ~t3_st~0)) (.cse32 (= ~m_st~0 0)) (.cse25 (= 0 ~t1_st~0)) (.cse33 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse33)) (.cse11 (<= .cse33 ~token~0)) (.cse29 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse30 (+ ~local~0 2)) (.cse31 (or .cse32 .cse25)) (.cse27 (not .cse7)) (.cse26 (<= 2 ~t2_st~0)) (.cse14 (<= ~m_pc~0 0)) (.cse17 (<= 2 ~t3_st~0)) (.cse18 (= 1 ~t3_pc~0)) (.cse20 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse23 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse24 (= 0 ~t1_pc~0)) (.cse19 (<= 2 ~m_st~0)) (.cse15 (<= ~t2_pc~0 0)) (.cse21 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~E_3~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse6 (not .cse32)) (.cse8 (<= 2 ~E_M~0)) (.cse28 (not .cse16)) (.cse9 (<= ~t3_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse8 .cse1 .cse4 .cse9 .cse10 .cse5 .cse15 .cse12 .cse7 .cse16) (and .cse0 .cse1 .cse4 .cse17 .cse18 .cse19 .cse15 .cse16 .cse8 .cse20 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12) (and .cse14 .cse23 .cse3 .cse4 .cse17 .cse18 .cse24 .cse25 .cse26 .cse8 .cse10 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse3 .cse17 .cse4 .cse18 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse27 .cse8 .cse28 .cse10 .cse29 .cse12 (< .cse30 ~token~0)) (and .cse14 .cse8 .cse1 .cse3 .cse9 .cse4 .cse10 .cse12 .cse6 .cse7) (and .cse14 .cse23 .cse4 .cse17 .cse18 .cse24 .cse15 .cse6 .cse16 .cse8 .cse10 .cse31 .cse12) (and .cse14 .cse23 .cse3 .cse4 .cse17 .cse18 .cse24 .cse6 .cse26 .cse8 .cse10 .cse31 .cse12) (and .cse0 .cse1 .cse3 .cse17 .cse4 .cse18 .cse5 .cse27 .cse6 .cse8 .cse28 .cse10 .cse12) (and .cse0 .cse3 .cse4 .cse17 .cse18 .cse24 .cse19 .cse25 .cse8 .cse28 .cse20 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse1 .cse17 .cse4 .cse18 .cse5 .cse15 .cse6 .cse16 .cse8 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse4 .cse15 .cse6 .cse7 .cse16 .cse8 .cse20 .cse9 .cse10 .cse21 .cse31 .cse12 .cse13 .cse22) (and .cse14 .cse8 .cse1 .cse28 .cse3 .cse4 .cse9 .cse10 .cse5 .cse12 .cse7) (and .cse14 .cse23 .cse4 .cse24 .cse15 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse31 .cse12) (and .cse14 .cse8 .cse1 .cse20 .cse4 .cse17 .cse18 .cse10 .cse15 .cse12 .cse6 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse1 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse28 .cse10 .cse29 (<= .cse30 ~token~0) .cse12 (<= ~token~0 .cse30)) (and .cse0 .cse3 .cse4 .cse24 .cse19 .cse25 .cse7 .cse8 .cse28 .cse20 .cse9 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse1 .cse4 .cse19 .cse15 .cse7 .cse16 .cse8 .cse20 .cse9 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse14 .cse8 .cse1 .cse3 .cse4 .cse18 .cse10 .cse12 .cse6) (and .cse14 .cse8 .cse1 .cse28 .cse3 .cse4 .cse17 .cse18 .cse10 .cse5 .cse12) (and .cse14 .cse8 .cse1 .cse4 .cse17 .cse18 .cse10 .cse15 .cse12 .cse6 .cse13 .cse16) (and .cse14 .cse23 .cse3 .cse4 .cse24 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse31 .cse12) (and .cse14 .cse4 .cse24 .cse25 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse21 .cse12 .cse22) (and .cse14 .cse8 .cse1 .cse20 .cse4 .cse9 .cse10 .cse15 .cse12 .cse6 .cse7 .cse16) (and .cse0 .cse1 .cse3 .cse17 .cse4 .cse18 .cse27 .cse6 .cse8 .cse28 .cse10 .cse21 .cse12 .cse22) (and .cse14 .cse8 .cse1 .cse4 .cse9 .cse10 .cse15 .cse12 .cse6 .cse13 .cse7 .cse16) (and .cse14 .cse8 .cse1 .cse4 .cse17 .cse18 .cse10 .cse5 .cse15 .cse12 .cse16) (and .cse0 .cse1 .cse17 .cse4 .cse18 .cse25 .cse15 .cse6 .cse16 .cse8 .cse20 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse14 .cse23 .cse3 .cse4 .cse24 .cse25 .cse7 .cse26 .cse8 .cse9 .cse10 .cse21 .cse12 .cse22) (and .cse14 .cse23 .cse4 .cse17 .cse18 .cse24 .cse25 .cse15 .cse16 .cse8 .cse10 .cse21 .cse12 .cse22) (and .cse0 .cse4 .cse17 .cse18 .cse24 .cse19 .cse25 .cse15 .cse16 .cse8 .cse20 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse23 .cse4 .cse24 .cse19 .cse25 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse13)))) [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-2(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-3(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-5(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-6(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-8(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-9(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-11(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-12(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-14(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-15(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-17(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-18(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L198-20(lines 198 207) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L397(lines 397 404) no Hoare annotation was computed. [2019-12-07 14:25:28,612 INFO L246 CegarLoopResult]: For program point L199(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L246 CegarLoopResult]: For program point L199-1(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L246 CegarLoopResult]: For program point L199-2(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L246 CegarLoopResult]: For program point L199-3(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L246 CegarLoopResult]: For program point L199-4(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L246 CegarLoopResult]: For program point L199-5(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L246 CegarLoopResult]: For program point L199-6(lines 199 204) no Hoare annotation was computed. [2019-12-07 14:25:28,613 INFO L242 CegarLoopResult]: At program point L266(lines 254 268) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_3~0) (= 0 ~t1_pc~0) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (= 0 ~t3_st~0) (= 0 ~t2_st~0) (<= 2 ~E_M~0) (<= ~t3_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-12-07 14:25:28,613 INFO L242 CegarLoopResult]: At program point L266-1(lines 254 268) the Hoare annotation is: (let ((.cse20 (= 0 ~t2_st~0))) (let ((.cse19 (<= ~t2_pc~0 0)) (.cse17 (= 0 ~t1_pc~0)) (.cse18 (= 0 ~t1_st~0)) (.cse5 (= 0 ~t3_st~0)) (.cse9 (<= ~t3_pc~0 0)) (.cse0 (= 1 ~t1_pc~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse15 (<= 2 ~t3_st~0)) (.cse2 (<= 2 ~E_3~0)) (.cse16 (= 1 ~t3_pc~0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (not (= ~m_st~0 0))) (.cse21 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (not .cse20)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse15 .cse16 .cse17 .cse18 .cse19 .cse4 .cse20 .cse21 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14) (and (= ULTIMATE.start_eval_~tmp~0 1) .cse2 .cse17 .cse18 .cse19 .cse4 .cse5 .cse20 .cse6 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse2 .cse16 .cse19 .cse4 .cse20 .cse21 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse20 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse17 .cse18 .cse4 .cse21 .cse6 .cse8 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse17 .cse18 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse3 .cse4 .cse21 .cse6 .cse8 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2019-12-07 14:25:28,613 INFO L242 CegarLoopResult]: At program point L266-2(lines 254 268) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (+ ~local~0 1))) (let ((.cse21 (<= ~token~0 .cse23)) (.cse22 (<= .cse23 ~token~0)) (.cse0 (<= ~m_pc~0 0)) (.cse17 (or (= ~E_2~0 1) .cse12)) (.cse3 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse5 (<= ~t2_pc~0 0)) (.cse8 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse16 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse18 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse15 (= 0 ~t3_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse19 (not .cse7)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse14 (<= ~t3_pc~0 0)) (.cse20 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse11 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse9 .cse13 .cse1 .cse10 .cse2 .cse14 .cse5 .cse11 .cse6 .cse12 .cse15 .cse7) (and .cse9 .cse0 .cse1 .cse10 .cse16 .cse2 .cse14 .cse17 .cse11 .cse6 .cse15) (and .cse13 .cse1 .cse16 .cse2 .cse3 .cse4 .cse18 .cse6 .cse8 .cse9 .cse19 .cse10 .cse20 .cse17 .cse11) (and .cse13 .cse1 .cse21 .cse16 .cse2 .cse6 .cse15 .cse9 .cse10 .cse14 .cse22 .cse11 .cse12) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse14 .cse5 .cse11 .cse6 .cse12 .cse15 .cse7) (and .cse13 .cse1 .cse21 .cse16 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse22 .cse17 .cse11) (and .cse9 .cse0 .cse1 .cse10 .cse16 .cse2 .cse4 .cse17 .cse11 .cse6) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse16 .cse2 .cse18 .cse6 .cse15 .cse9 .cse19 .cse10 .cse14 .cse20 .cse11 .cse12)))) [2019-12-07 14:25:28,613 INFO L242 CegarLoopResult]: At program point L266-3(lines 254 268) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (let ((.cse10 (<= ~t3_pc~0 0)) (.cse6 (= 0 ~t3_st~0)) (.cse16 (<= ~m_pc~0 0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse18 (= 1 ~t3_pc~0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (not (= ~m_st~0 0))) (.cse7 (<= 2 ~E_M~0)) (.cse8 (not (= 0 ~t2_st~0))) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse12 (<= 2 ~E_2~0)) (.cse17 (or (= ~E_2~0 1) .cse15)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse7 .cse1 .cse9 .cse2 .cse10 .cse12 .cse17 .cse14 .cse5 .cse6) (and .cse0 .cse1 .cse2 (<= 2 ~t3_st~0) .cse18 .cse3 .cse4 .cse5 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) .cse7 .cse9 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse7 .cse1 .cse9 .cse2 .cse18 .cse12 .cse14 .cse5 .cse15) (let ((.cse19 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse13 (<= .cse19 ~token~0) .cse14 (<= ~token~0 .cse19)))))) [2019-12-07 14:25:28,614 INFO L242 CegarLoopResult]: At program point L266-4(lines 254 268) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (<= 2 ~t1_st~0)) (.cse14 (not (= ~m_st~0 0))) (.cse7 (not (= 0 ~t3_st~0))) (.cse8 (not (= 0 ~t2_st~0))) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse13 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 3)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< (+ ~local~0 2) ~token~0) .cse13) (and (<= ~m_pc~0 0) .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse13 .cse14 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15))) [2019-12-07 14:25:28,614 INFO L242 CegarLoopResult]: At program point L266-5(lines 254 268) the Hoare annotation is: (let ((.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse28 (+ ~local~0 1))) (let ((.cse14 (+ ~local~0 2)) (.cse25 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse23 (<= ~token~0 .cse28)) (.cse24 (<= .cse28 ~token~0)) (.cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse9 (not .cse19)) (.cse10 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (<= ~m_pc~0 0)) (.cse2 (= 1 ~t2_pc~0)) (.cse21 (<= ~t3_pc~0 0)) (.cse12 (or (= ~E_2~0 1) .cse26)) (.cse22 (= 0 ~t3_st~0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse17 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse7 (not (= ~m_st~0 0))) (.cse20 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse8 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~E_2~0)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0) .cse15 (<= ~token~0 .cse14)) (and .cse16 .cse1 .cse17 .cse3 .cse4 .cse6 .cse18 .cse19 .cse20 .cse8 .cse11 .cse13 .cse15) (and .cse16 .cse8 .cse1 .cse3 .cse21 .cse11 .cse13 .cse6 .cse18 .cse15 .cse22 .cse19) (and .cse16 .cse1 .cse2 .cse3 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 .cse21 .cse11 .cse13 .cse15) (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 (<= ~token~0 (+ ~local~0 3)) .cse6 .cse8 .cse20 .cse9 .cse10 .cse11 .cse13 (< .cse14 ~token~0) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse23 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse19 .cse20 .cse8 .cse11 .cse24 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse21 .cse11 .cse25 .cse15 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse15 .cse27) (and .cse16 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse0 .cse1 .cse23 .cse2 .cse3 .cse6 .cse7 .cse22 .cse19 .cse8 .cse21 .cse11 .cse24 .cse13 .cse15 .cse26) (and .cse0 .cse1 .cse3 .cse6 .cse18 .cse7 .cse22 .cse19 .cse8 .cse21 .cse11 .cse13 .cse15 .cse26) (and .cse16 .cse1 .cse17 .cse3 .cse4 .cse18 .cse7 .cse19 .cse20 .cse8 .cse11 .cse15 .cse26) (and .cse16 .cse8 .cse1 .cse3 .cse21 .cse11 .cse18 .cse15 .cse7 .cse26 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse21 .cse11 .cse13 .cse15 .cse26) (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse21 .cse11 .cse12 .cse15 .cse7 .cse22) (and .cse0 .cse1 .cse3 .cse17 .cse4 .cse6 .cse18 .cse7 .cse19 .cse20 .cse8 .cse11 .cse13 .cse15 .cse26)))) [2019-12-07 14:25:28,614 INFO L242 CegarLoopResult]: At program point L266-6(lines 254 268) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse28 (+ ~local~0 1))) (let ((.cse20 (+ ~local~0 2)) (.cse26 (<= ~token~0 .cse28)) (.cse27 (<= .cse28 ~token~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (<= ~m_pc~0 0)) (.cse22 (<= ~t3_pc~0 0)) (.cse23 (= 0 ~t3_st~0)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse14 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse15 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse16 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse17 (not .cse7)) (.cse18 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse19 (or (= ~E_2~0 1) .cse21)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4 .cse15 .cse5 .cse16 .cse8 .cse17 .cse18 .cse10 .cse19 .cse11 (<= .cse20 ~token~0) .cse12 (<= ~token~0 .cse20)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse21) (and .cse0 .cse8 .cse1 .cse2 .cse22 .cse10 .cse11 .cse5 .cse6 .cse12 .cse23 .cse7) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse5 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse14 .cse2 .cse4 .cse10 .cse19 .cse12 .cse16) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 (< .cse20 ~token~0) .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse24 .cse12 .cse21 .cse25) (and .cse13 .cse1 .cse26 .cse14 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse27 .cse19 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse5 .cse6 .cse16 .cse23 .cse7 .cse8 .cse22 .cse10 .cse11 .cse12 .cse21) (and .cse13 .cse1 .cse26 .cse14 .cse2 .cse5 .cse16 .cse23 .cse7 .cse8 .cse22 .cse10 .cse27 .cse11 .cse12 .cse21) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse22 .cse10 .cse6 .cse12 .cse16 .cse21 .cse23 .cse7) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse16 .cse8 .cse9 .cse17 .cse18 .cse10 .cse24 .cse19 .cse12 .cse25) (and .cse13 .cse1 .cse14 .cse2 .cse15 .cse5 .cse16 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse8 .cse1 .cse14 .cse2 .cse22 .cse10 .cse19 .cse12 .cse16 .cse23) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse5 .cse16 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12)))) [2019-12-07 14:25:28,614 INFO L242 CegarLoopResult]: At program point L137-1(lines 125 156) the Hoare annotation is: (let ((.cse5 (= 0 ~t3_st~0))) (let ((.cse18 (<= 2 ~m_st~0)) (.cse9 (<= ~t3_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse20 (<= 2 ~t1_st~0)) (.cse19 (not .cse5)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (<= 2 ~E_M~0)) (.cse21 (<= ~m_pc~0 0)) (.cse22 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (not (= 0 ~t2_st~0))) (.cse2 (<= 2 ~E_3~0)) (.cse15 (<= 2 ~t3_st~0)) (.cse16 (= 1 ~t3_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse17 (= 0 ~t1_pc~0)) (.cse3 (= 0 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse15 .cse16 .cse17 .cse18 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse18 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse21 .cse22 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse21 .cse22 .cse2 .cse15 .cse16 .cse17 .cse3 .cse6 .cse7 .cse10 .cse11 .cse12 .cse14) (and .cse6 .cse21 .cse22 .cse7 .cse2 .cse9 .cse10 .cse17 .cse3 .cse12 .cse4 .cse5) (let ((.cse23 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse16 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse20 .cse4 .cse6 .cse7 .cse8 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse23 ~token~0) .cse12 (<= ~token~0 .cse23))) (and .cse6 .cse21 .cse1 .cse8 .cse2 .cse16 .cse10 .cse12 .cse13 .cse4) (and .cse6 .cse21 .cse1 .cse7 .cse8 .cse2 .cse16 .cse10 .cse12 .cse4) (and .cse6 .cse21 .cse1 .cse7 .cse8 .cse2 .cse9 .cse10 .cse20 .cse12 .cse5) (and .cse6 .cse21 .cse1 .cse8 .cse2 .cse9 .cse10 .cse12 .cse4 .cse13 .cse5) (and .cse6 .cse21 .cse7 .cse1 .cse8 .cse15 .cse2 .cse16 .cse10 .cse20 .cse12) (and .cse6 .cse21 .cse1 .cse7 .cse8 .cse9 .cse2 .cse10 .cse12 .cse4 .cse5) (and .cse0 .cse2 .cse17 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse20 .cse19 .cse4 .cse6 .cse7 .cse8 .cse10 .cse12) (and .cse6 .cse21 .cse22 .cse7 .cse2 .cse15 .cse16 .cse10 .cse17 .cse3 .cse12 .cse4)))) [2019-12-07 14:25:28,615 INFO L242 CegarLoopResult]: At program point L71(lines 45 84) the Hoare annotation is: (let ((.cse8 (= 0 ~t2_st~0))) (let ((.cse22 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse15 (not .cse8)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse0 (<= ~m_pc~0 0)) (.cse17 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse3 (<= 2 ~E_3~0)) (.cse18 (= 0 ~t1_pc~0)) (.cse19 (= 0 ~t1_st~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse7 (not (= ~m_st~0 0))) (.cse14 (= 0 ~t3_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse16 (<= ~t3_pc~0 0)) (.cse11 (<= 2 ~E_2~0)) (.cse20 (<= ~token~0 ~local~0)) (.cse12 (<= 2 ~E_1~0)) (.cse21 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse3 .cse5 .cse7 .cse14 .cse9 .cse15 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse17 .cse3 .cse2 .cse4 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse12 .cse21) (and .cse0 .cse17 .cse13 .cse3 .cse18 .cse19 .cse7 .cse14 .cse22 .cse9 .cse16 .cse11 .cse20 .cse12 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse17 .cse13 .cse3 .cse2 .cse4 .cse18 .cse19 .cse7 .cse22 .cse9 .cse11 .cse20 .cse12 .cse21) (and (= ~m_pc~0 1) .cse1 .cse13 .cse3 .cse2 .cse4 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse7 .cse9 .cse15 .cse10 .cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 (< (+ ~local~0 2) ~token~0)) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse3 .cse18 .cse19 .cse6 .cse7 .cse14 .cse8 .cse9 .cse16 .cse11 .cse20 .cse12 .cse21)))) [2019-12-07 14:25:28,615 INFO L242 CegarLoopResult]: At program point L668-1(lines 463 705) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_st~0)) (.cse27 (+ ~local~0 1))) (let ((.cse25 (<= ~token~0 .cse27)) (.cse26 (<= .cse27 ~token~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (<= ~m_pc~0 0)) (.cse15 (<= ~t3_pc~0 0)) (.cse16 (= 0 ~t3_st~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse23 (<= ~token~0 ~local~0)) (.cse24 (<= ~local~0 ~token~0)) (.cse21 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse18 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse13 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse19 (not .cse7)) (.cse20 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0)) (.cse22 (+ ~local~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse15 .cse10 .cse11 .cse5 .cse6 .cse12 .cse16 .cse7) (and .cse0 .cse1 .cse17 .cse2 .cse18 .cse5 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse11 .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 (< .cse22 ~token~0) .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse18 .cse13 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse23 .cse12 .cse14 .cse24) (and .cse0 .cse8 .cse1 .cse17 .cse2 .cse4 .cse10 .cse12 .cse13) (and .cse21 .cse1 .cse2 .cse5 .cse6 .cse13 .cse16 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse21 .cse1 .cse25 .cse17 .cse2 .cse5 .cse13 .cse16 .cse7 .cse8 .cse15 .cse10 .cse26 .cse11 .cse12 .cse14) (and .cse21 .cse1 .cse25 .cse17 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12) (and .cse0 .cse2 (= 0 ~t1_pc~0) (= 0 ~t1_st~0) .cse6 .cse16 .cse7 .cse8 .cse15 .cse10 .cse23 .cse12 .cse24) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse13 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse15 .cse10 .cse6 .cse12 .cse13 .cse14 .cse16 .cse7) (and .cse21 .cse1 .cse17 .cse2 .cse18 .cse5 .cse13 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse17 .cse2 .cse15 .cse10 .cse12 .cse13 .cse16) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse13 .cse8 .cse9 .cse19 .cse20 .cse10 .cse23 .cse12 .cse24) (and .cse21 .cse1 .cse17 .cse2 .cse4 .cse18 .cse5 .cse13 .cse8 .cse19 .cse20 .cse10 .cse11 (<= .cse22 ~token~0) .cse12 (<= ~token~0 .cse22))))) [2019-12-07 14:25:28,615 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-12-07 14:25:28,615 INFO L242 CegarLoopResult]: At program point L209(lines 197 211) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_3~0) (= 0 ~t1_pc~0) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (= 0 ~t3_st~0) (= 0 ~t2_st~0) (<= 2 ~E_M~0) (<= ~t3_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-12-07 14:25:28,615 INFO L242 CegarLoopResult]: At program point L209-1(lines 197 211) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0))) (let ((.cse14 (<= ~t2_pc~0 0)) (.cse3 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse16 (= 0 ~t1_pc~0)) (.cse17 (= 0 ~t1_st~0)) (.cse0 (= 1 ~t1_pc~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_st~0 0))) (.cse18 (= 0 ~t3_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (not .cse15)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse19 (<= ~t3_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse16 .cse17 .cse6 .cse18 (<= 2 ~t2_st~0) .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13) (and (= ULTIMATE.start_eval_~tmp~0 1) .cse2 .cse16 .cse17 .cse14 .cse6 .cse18 .cse15 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse5 .cse14 .cse6 .cse18 .cse15 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse16 .cse17 .cse14 .cse6 .cse15 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse2 .cse4 .cse16 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13)))) [2019-12-07 14:25:28,616 INFO L242 CegarLoopResult]: At program point L209-2(lines 197 211) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_st~0)) (.cse20 (+ ~local~0 1))) (let ((.cse13 (<= ~token~0 .cse20)) (.cse15 (not .cse7)) (.cse16 (<= .cse20 ~token~0)) (.cse0 (= ~m_pc~0 1)) (.cse18 (<= 2 ~t3_st~0)) (.cse3 (not (= 0 ~t1_st~0))) (.cse4 (<= ~t2_pc~0 0)) (.cse10 (<= ~t3_pc~0 0)) (.cse6 (= 0 ~t3_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse17 (<= ~m_pc~0 0)) (.cse1 (= 1 ~t1_pc~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse14 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse19 (= 1 ~t3_pc~0)) (.cse11 (<= 2 ~E_1~0)) (.cse5 (not (= ~m_st~0 0))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse2 .cse3 .cse5 .cse6 .cse8 .cse15 .cse9 .cse10 .cse16 .cse11 .cse12) (and .cse8 .cse17 .cse1 .cse9 .cse2 .cse10 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse14 .cse18 .cse2 .cse3 .cse19 .cse5 .cse8 .cse15 .cse9 .cse16 .cse11 .cse12) (and .cse8 .cse17 .cse1 .cse9 .cse2 .cse18 .cse19 .cse4 .cse11 .cse5 .cse12 .cse7) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse8 .cse17 .cse1 .cse9 .cse14 .cse10 .cse2 .cse11 .cse5 .cse12 .cse6) (and .cse8 .cse17 .cse1 .cse9 .cse14 .cse2 .cse19 .cse11 .cse5 .cse12)))) [2019-12-07 14:25:28,616 INFO L242 CegarLoopResult]: At program point L209-3(lines 197 211) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= 2 ~t1_st~0)) (.cse13 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse15 (<= ~m_pc~0 0)) (.cse1 (= 1 ~t1_pc~0)) (.cse7 (not (= 0 ~t2_st~0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= 1 ~t2_pc~0)) (.cse9 (<= ~t3_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_st~0 0))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 (<= 2 ~t3_st~0) .cse13 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 (<= .cse14 ~token~0) .cse11 .cse12 (<= ~token~0 .cse14))) (and .cse6 .cse15 .cse1 .cse7 .cse8 .cse2 .cse13 .cse10 .cse11 .cse12 .cse4) (and .cse6 .cse15 .cse1 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse4 .cse12 .cse5))) [2019-12-07 14:25:28,616 INFO L242 CegarLoopResult]: At program point L209-4(lines 197 211) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse6 (not (= 0 ~t3_st~0))) (.cse13 (not (= ~m_st~0 0))) (.cse7 (not (= 0 ~t2_st~0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (<= 2 ~E_2~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 2) ~token~0)) (and (<= ~m_pc~0 0) .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse12 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-12-07 14:25:28,616 INFO L242 CegarLoopResult]: At program point L209-5(lines 197 211) the Hoare annotation is: (let ((.cse24 (= 0 ~t2_st~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (+ ~local~0 1))) (let ((.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse11 (<= ~token~0 .cse25)) (.cse15 (<= .cse25 ~token~0)) (.cse20 (or (= ~E_2~0 1) .cse9)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse22 (+ ~local~0 2)) (.cse1 (<= ~m_pc~0 0)) (.cse19 (<= 2 ~t3_st~0)) (.cse5 (= 1 ~t3_pc~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~E_3~0)) (.cse12 (<= 2 ~t1_st~0)) (.cse8 (not (= ~m_st~0 0))) (.cse13 (= 0 ~t3_st~0)) (.cse0 (<= 2 ~E_M~0)) (.cse16 (not .cse24)) (.cse14 (<= ~t3_pc~0 0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse8 .cse13 .cse0 .cse14 .cse6 .cse15 .cse7 .cse9) (and .cse10 .cse2 .cse3 .cse4 .cse8 .cse13 .cse0 .cse16 .cse14 .cse6 .cse17 .cse7 .cse9 .cse18) (and .cse10 .cse2 .cse3 .cse19 .cse4 .cse5 .cse8 .cse0 .cse16 .cse6 .cse17 .cse20 .cse7 .cse18) (and .cse10 .cse2 .cse3 .cse19 .cse4 .cse5 .cse12 .cse8 .cse0 .cse16 .cse6 .cse20 .cse7) (and .cse10 .cse2 .cse3 .cse19 .cse4 .cse5 (<= ~token~0 (+ ~local~0 3)) .cse12 .cse0 .cse16 .cse6 .cse21 .cse7 (< .cse22 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse20 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse6 .cse23 .cse7 .cse8 .cse9 .cse13 .cse24) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse19 .cse5 .cse12 .cse8 .cse0 .cse6 .cse15 .cse20 .cse7) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse14 .cse6 .cse12 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse6 .cse12 .cse23 .cse7 .cse13 .cse24) (and .cse10 .cse2 .cse19 .cse4 .cse5 .cse12 .cse23 .cse8 .cse24 .cse0 .cse6 .cse7 .cse9) (and .cse10 .cse2 .cse4 .cse12 .cse23 .cse8 .cse13 .cse24 .cse0 .cse14 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse24) (and .cse10 .cse2 .cse3 .cse4 .cse5 .cse12 .cse8 .cse0 .cse16 .cse6 .cse20 .cse21 (<= .cse22 ~token~0) .cse7 (<= ~token~0 .cse22)) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse12 .cse7) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse12 .cse23 .cse7 .cse24) (and .cse10 .cse2 .cse3 .cse4 .cse12 .cse8 .cse13 .cse0 .cse16 .cse14 .cse6 .cse7 .cse9)))) [2019-12-07 14:25:28,616 INFO L242 CegarLoopResult]: At program point L209-6(lines 197 211) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse28 (+ ~local~0 1))) (let ((.cse20 (+ ~local~0 2)) (.cse26 (<= ~token~0 .cse28)) (.cse27 (<= .cse28 ~token~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (<= ~m_pc~0 0)) (.cse22 (<= ~t3_pc~0 0)) (.cse23 (= 0 ~t3_st~0)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse14 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse15 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse16 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse17 (not .cse7)) (.cse18 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse19 (or (= ~E_2~0 1) .cse21)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4 .cse15 .cse5 .cse16 .cse8 .cse17 .cse18 .cse10 .cse19 .cse11 (<= .cse20 ~token~0) .cse12 (<= ~token~0 .cse20)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse21) (and .cse0 .cse8 .cse1 .cse2 .cse22 .cse10 .cse11 .cse5 .cse6 .cse12 .cse23 .cse7) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse5 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse14 .cse2 .cse4 .cse10 .cse19 .cse12 .cse16) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 (< .cse20 ~token~0) .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse24 .cse12 .cse21 .cse25) (and .cse13 .cse1 .cse26 .cse14 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse27 .cse19 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse5 .cse6 .cse16 .cse23 .cse7 .cse8 .cse22 .cse10 .cse11 .cse12 .cse21) (and .cse13 .cse1 .cse26 .cse14 .cse2 .cse5 .cse16 .cse23 .cse7 .cse8 .cse22 .cse10 .cse27 .cse11 .cse12 .cse21) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse22 .cse10 .cse6 .cse12 .cse16 .cse21 .cse23 .cse7) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse16 .cse8 .cse9 .cse17 .cse18 .cse10 .cse24 .cse19 .cse12 .cse25) (and .cse13 .cse1 .cse14 .cse2 .cse15 .cse5 .cse16 .cse23 .cse8 .cse17 .cse18 .cse22 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse8 .cse1 .cse14 .cse2 .cse22 .cse10 .cse19 .cse12 .cse16 .cse23) (and .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse5 .cse16 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12)))) [2019-12-07 14:25:28,617 INFO L242 CegarLoopResult]: At program point L409(lines 336 414) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0)) (.cse24 (+ ~local~0 1))) (let ((.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse20 (+ ~local~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse12 (<= ~token~0 .cse24)) (.cse15 (<= .cse24 ~token~0)) (.cse21 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~t3_st~0)) (.cse7 (= 1 ~t3_pc~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse1 (= ~m_pc~0 1)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~E_3~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse11 (not (= ~m_st~0 0))) (.cse13 (= 0 ~t3_st~0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (not .cse23)) (.cse14 (<= ~t3_pc~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse10 (<= 2 ~E_1~0)) (.cse16 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse12 .cse4 .cse5 .cse9 .cse11 .cse13 .cse0 .cse14 .cse8 .cse15 .cse10 .cse16) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse13 .cse0 .cse2 .cse14 .cse8 .cse17 .cse10 .cse16 .cse18) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse11 .cse0 .cse2 .cse8 .cse19 (<= .cse20 ~token~0) .cse10 (<= ~token~0 .cse20)) (and .cse1 .cse3 .cse4 .cse6 .cse5 .cse7 (<= ~token~0 (+ ~local~0 3)) .cse9 .cse0 .cse2 .cse8 .cse19 .cse10 (< .cse20 ~token~0)) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11) (and .cse0 .cse21 .cse3 .cse5 .cse14 .cse8 .cse22 .cse10 .cse11 .cse13 .cse23) (and .cse0 .cse21 .cse3 .cse2 .cse4 .cse5 .cse14 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse21 .cse3 .cse6 .cse5 .cse7 .cse8 .cse22 .cse10 .cse11 .cse23) (and .cse0 .cse21 .cse3 .cse5 .cse14 .cse8 .cse9 .cse22 .cse10 .cse13 .cse23) (and .cse1 .cse3 .cse6 .cse5 .cse7 .cse9 .cse22 .cse11 .cse23 .cse0 .cse8 .cse10 .cse16) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse0 .cse2 .cse8 .cse17 .cse10 .cse18) (and .cse1 .cse3 .cse5 .cse9 .cse22 .cse11 .cse13 .cse23 .cse0 .cse14 .cse8 .cse10 .cse16) (and .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse9 .cse11 .cse0 .cse8 .cse15 .cse10) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse14 .cse8 .cse10 .cse11 .cse13) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse21 .cse3 .cse6 .cse5 .cse7 .cse8 .cse9 .cse22 .cse10 .cse23) (and .cse1 .cse3 .cse4 .cse5 .cse9 .cse11 .cse13 .cse0 .cse2 .cse14 .cse8 .cse10 .cse16)))) [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L347(lines 347 351) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L347-1(lines 342 408) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-2(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-3(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-5(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-6(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-8(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-9(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-11(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-12(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-14(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-15(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-17(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-18(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L246 CegarLoopResult]: For program point L217-20(lines 217 226) no Hoare annotation was computed. [2019-12-07 14:25:28,617 INFO L249 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218-2(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218-3(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218-4(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218-5(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L218-6(lines 218 223) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L242 CegarLoopResult]: At program point L352(lines 342 408) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_st~0)) (.cse33 (= ~m_st~0 0)) (.cse6 (= 0 ~t1_st~0)) (.cse34 (+ ~local~0 1))) (let ((.cse29 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse31 (<= ~token~0 .cse34)) (.cse32 (<= .cse34 ~token~0)) (.cse30 (or .cse33 .cse6)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse24 (+ ~local~0 2)) (.cse26 (<= 2 ~t2_st~0)) (.cse16 (<= ~m_pc~0 0)) (.cse21 (<= 2 ~t1_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse18 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse5 (= 1 ~t3_pc~0)) (.cse8 (not .cse33)) (.cse22 (not .cse9)) (.cse17 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse0 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (<= 2 ~E_3~0)) (.cse25 (= 0 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse7 (<= ~t2_pc~0 0)) (.cse20 (= 0 ~t3_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse19 (<= ~t3_pc~0 0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse10 .cse1 .cse17 .cse18 .cse4 .cse19 .cse11 .cse13 .cse8 .cse20) (and .cse16 .cse10 .cse1 .cse17 .cse18 .cse4 .cse5 .cse11 .cse13 .cse8) (and .cse0 .cse1 .cse4 .cse21 .cse7 .cse8 .cse20 .cse9 .cse10 .cse17 .cse19 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 3)) .cse21 .cse10 .cse22 .cse17 .cse11 .cse23 .cse13 (< .cse24 ~token~0)) (and .cse16 .cse2 .cse18 .cse4 .cse3 .cse5 .cse25 .cse6 .cse26 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse16 .cse10 .cse1 .cse22 .cse17 .cse18 .cse4 .cse19 .cse11 .cse21 .cse13 .cse20) (and .cse12 .cse14 .cse15 (let ((.cse27 (not .cse1))) (or (and .cse0 .cse2 .cse27 .cse4 .cse3 .cse5 .cse25 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse27 .cse4 .cse3 .cse5 .cse25 .cse28 .cse6 .cse7 .cse8 .cse9 .cse29 .cse10 .cse17 .cse11 .cse13)))) (and .cse16 .cse2 .cse4 .cse3 .cse5 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse13) (and .cse0 .cse1 .cse18 .cse4 .cse8 .cse20 .cse10 .cse22 .cse17 .cse19 .cse11 .cse12 .cse13 .cse15 .cse14) (and .cse16 .cse2 .cse18 .cse4 .cse3 .cse5 .cse25 .cse8 .cse26 .cse10 .cse11 .cse30 .cse13) (and .cse0 .cse1 .cse31 .cse18 .cse4 .cse21 .cse8 .cse20 .cse10 .cse17 .cse19 .cse11 .cse32 .cse13 .cse14) (and .cse16 .cse10 .cse1 .cse22 .cse17 .cse18 .cse3 .cse4 .cse5 .cse11 .cse21 .cse13) (and .cse12 (or (and .cse0 .cse18 .cse4 .cse3 .cse5 .cse25 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse28 .cse6 .cse10 .cse29 .cse17 .cse22 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse11 .cse13 .cse14) (and .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse25 .cse28 .cse6 .cse10 .cse22 .cse11 .cse13 .cse14)) .cse15) (and .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse21 .cse8 .cse10 .cse22 .cse17 .cse11 .cse13) (and .cse0 .cse1 .cse4 .cse28 .cse7 .cse8 .cse20 .cse9 .cse10 .cse17 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse3 .cse5 .cse28 .cse7 .cse8 .cse9 .cse29 .cse10 .cse17 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse2 .cse4 .cse25 .cse7 .cse8 .cse20 .cse9 .cse10 .cse19 .cse11 .cse30 .cse13) (and .cse16 .cse10 .cse1 .cse17 .cse4 .cse3 .cse5 .cse11 .cse7 .cse13 .cse8 .cse9) (and .cse16 .cse2 .cse4 .cse25 .cse6 .cse7 .cse20 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse18 .cse4 .cse25 .cse28 .cse6 .cse20 .cse10 .cse22 .cse17 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse18 .cse31 .cse3 .cse4 .cse5 .cse21 .cse8 .cse10 .cse17 .cse11 .cse32 .cse13) (and .cse0 .cse1 .cse4 .cse3 (not .cse6) .cse5 .cse28 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_eval_~tmp~0) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse2 .cse18 .cse4 .cse25 .cse8 .cse20 .cse26 .cse10 .cse19 .cse11 .cse30 .cse13) (and .cse16 .cse10 .cse1 .cse17 .cse3 .cse4 .cse5 .cse11 .cse21 .cse7 .cse13 .cse9) (and .cse16 .cse10 .cse1 .cse17 .cse19 .cse4 .cse11 .cse21 .cse7 .cse13 .cse20 .cse9) (and .cse16 .cse10 .cse1 .cse17 .cse4 .cse19 .cse11 .cse7 .cse13 .cse8 .cse20 .cse9) (and .cse0 .cse1 .cse18 .cse4 .cse5 .cse21 .cse8 .cse10 .cse22 .cse17 .cse11 .cse23 (<= .cse24 ~token~0) .cse13 (<= ~token~0 .cse24)) (and .cse0 .cse1 .cse18 .cse4 .cse21 .cse8 .cse20 .cse10 .cse22 .cse17 .cse19 .cse11 .cse13 .cse14) (and .cse16 .cse2 .cse18 .cse4 .cse25 .cse6 .cse20 .cse26 .cse10 .cse19 .cse11 .cse12 .cse13 .cse15) (and .cse16 .cse2 .cse4 .cse3 .cse5 .cse25 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse8 .cse10 .cse22 .cse17 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse2 .cse4 .cse25 .cse28 .cse6 .cse7 .cse20 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L90(lines 90 98) no Hoare annotation was computed. [2019-12-07 14:25:28,618 INFO L246 CegarLoopResult]: For program point L355(lines 355 362) no Hoare annotation was computed. [2019-12-07 14:25:28,619 INFO L242 CegarLoopResult]: At program point L687(lines 687 696) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_st~0)) (.cse27 (+ ~local~0 1))) (let ((.cse25 (<= ~token~0 .cse27)) (.cse26 (<= .cse27 ~token~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (<= ~m_pc~0 0)) (.cse15 (<= ~t3_pc~0 0)) (.cse16 (= 0 ~t3_st~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse23 (<= ~token~0 ~local~0)) (.cse24 (<= ~local~0 ~token~0)) (.cse21 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse18 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse13 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse19 (not .cse7)) (.cse20 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0)) (.cse22 (+ ~local~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse15 .cse10 .cse11 .cse5 .cse6 .cse12 .cse16 .cse7) (and .cse0 .cse1 .cse17 .cse2 .cse18 .cse5 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse11 .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 (< .cse22 ~token~0) .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse18 .cse13 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse23 .cse12 .cse14 .cse24) (and .cse0 .cse8 .cse1 .cse17 .cse2 .cse4 .cse10 .cse12 .cse13) (and .cse21 .cse1 .cse2 .cse5 .cse6 .cse13 .cse16 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse21 .cse1 .cse25 .cse17 .cse2 .cse5 .cse13 .cse16 .cse7 .cse8 .cse15 .cse10 .cse26 .cse11 .cse12 .cse14) (and .cse21 .cse1 .cse25 .cse17 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse13 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse15 .cse10 .cse6 .cse12 .cse13 .cse14 .cse16 .cse7) (and .cse21 .cse1 .cse17 .cse2 .cse18 .cse5 .cse13 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse17 .cse2 .cse15 .cse10 .cse12 .cse13 .cse16) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse13 .cse8 .cse9 .cse19 .cse20 .cse10 .cse23 .cse12 .cse24) (and .cse21 .cse1 .cse17 .cse2 .cse4 .cse18 .cse5 .cse13 .cse8 .cse19 .cse20 .cse10 .cse11 (<= .cse22 ~token~0) .cse12 (<= ~token~0 .cse22))))) [2019-12-07 14:25:28,619 INFO L242 CegarLoopResult]: At program point L687-1(lines 687 696) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_st~0)) (.cse27 (+ ~local~0 1))) (let ((.cse25 (<= ~token~0 .cse27)) (.cse26 (<= .cse27 ~token~0)) (.cse6 (<= ~t2_pc~0 0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (<= ~m_pc~0 0)) (.cse15 (<= ~t3_pc~0 0)) (.cse16 (= 0 ~t3_st~0)) (.cse3 (<= 2 ~t3_st~0)) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse23 (<= ~token~0 ~local~0)) (.cse24 (<= ~local~0 ~token~0)) (.cse21 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse18 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse13 (not (= ~m_st~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse19 (not .cse7)) (.cse20 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0)) (.cse22 (+ ~local~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse15 .cse10 .cse11 .cse5 .cse6 .cse12 .cse16 .cse7) (and .cse0 .cse1 .cse17 .cse2 .cse18 .cse5 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse11 .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 (< .cse22 ~token~0) .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse18 .cse13 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse23 .cse12 .cse14 .cse24) (and .cse0 .cse8 .cse1 .cse17 .cse2 .cse4 .cse10 .cse12 .cse13) (and .cse21 .cse1 .cse2 .cse5 .cse6 .cse13 .cse16 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse21 .cse1 .cse25 .cse17 .cse2 .cse5 .cse13 .cse16 .cse7 .cse8 .cse15 .cse10 .cse26 .cse11 .cse12 .cse14) (and .cse21 .cse1 .cse25 .cse17 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse13 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse15 .cse10 .cse6 .cse12 .cse13 .cse14 .cse16 .cse7) (and .cse21 .cse1 .cse17 .cse2 .cse18 .cse5 .cse13 .cse16 .cse8 .cse19 .cse20 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse17 .cse2 .cse15 .cse10 .cse12 .cse13 .cse16) (and .cse21 .cse1 .cse17 .cse2 .cse3 .cse4 .cse18 .cse13 .cse8 .cse9 .cse19 .cse20 .cse10 .cse23 .cse12 .cse24) (and .cse21 .cse1 .cse17 .cse2 .cse4 .cse18 .cse5 .cse13 .cse8 .cse19 .cse20 .cse10 .cse11 (<= .cse22 ~token~0) .cse12 (<= ~token~0 .cse22))))) [2019-12-07 14:25:28,619 INFO L242 CegarLoopResult]: At program point L93(lines 93 97) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_st~0))) (let ((.cse17 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= ~t3_pc~0 0)) (.cse10 (= 0 ~t3_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse7 (<= ~t2_pc~0 0)) (.cse12 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~E_3~0)) (.cse19 (<= 2 ~t3_st~0)) (.cse14 (not (= 0 ~t1_st~0))) (.cse20 (= 1 ~t3_pc~0)) (.cse9 (not (= ~m_st~0 0))) (.cse1 (<= 2 ~E_M~0)) (.cse15 (not .cse11)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse8 (<= 2 ~E_1~0)) (.cse18 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse13 .cse4 .cse14 .cse9 .cse10 .cse1 .cse15 .cse3 .cse5 .cse6 .cse16 .cse8 .cse17 .cse18) (and .cse12 .cse2 .cse19 .cse4 .cse14 .cse20 .cse7 .cse9 .cse11 .cse1 .cse3 .cse6 .cse8 .cse17) (and .cse12 .cse2 .cse4 .cse14 .cse7 .cse9 .cse10 .cse11 .cse1 .cse3 .cse5 .cse6 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse20 .cse6 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse12 .cse2 .cse13 .cse4 .cse19 .cse14 .cse20 .cse9 .cse1 .cse15 .cse3 .cse6 .cse16 .cse8 .cse18)))) [2019-12-07 14:25:28,619 INFO L242 CegarLoopResult]: At program point L228(lines 216 230) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_3~0) (= 0 ~t1_pc~0) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (= 0 ~t3_st~0) (= 0 ~t2_st~0) (<= 2 ~E_M~0) (<= ~t3_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-12-07 14:25:28,619 INFO L242 CegarLoopResult]: At program point L228-1(lines 216 230) the Hoare annotation is: (let ((.cse17 (= 0 ~t2_st~0))) (let ((.cse5 (= 0 ~t3_st~0)) (.cse9 (<= ~t3_pc~0 0)) (.cse14 (= 0 ~t1_pc~0)) (.cse15 (= 0 ~t1_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse7 (not .cse17)) (.cse0 (= 1 ~t1_pc~0)) (.cse18 (<= 2 ~t3_st~0)) (.cse2 (<= 2 ~E_3~0)) (.cse19 (= 1 ~t3_pc~0)) (.cse3 (<= 2 ~t1_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (<= 2 ~E_M~0)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 2 ~E_2~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse14 .cse15 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse2 .cse3 .cse16 .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and (= ULTIMATE.start_eval_~tmp~0 1) .cse2 .cse14 .cse15 .cse16 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse2 .cse18 .cse19 .cse14 .cse15 .cse16 .cse4 .cse17 .cse6 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse1 .cse18 .cse2 .cse19 .cse14 .cse15 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse18 .cse2 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse18 .cse2 .cse19 .cse3 .cse16 .cse4 .cse17 .cse6 .cse8 .cse10 .cse11 .cse13 .cse12)))) [2019-12-07 14:25:28,620 INFO L242 CegarLoopResult]: At program point L228-2(lines 216 230) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_st~0)) (.cse20 (+ ~local~0 1))) (let ((.cse10 (<= ~t3_pc~0 0)) (.cse6 (= 0 ~t3_st~0)) (.cse4 (<= ~t2_pc~0 0)) (.cse0 (= ~m_pc~0 1)) (.cse16 (<= ~token~0 .cse20)) (.cse14 (<= 2 ~t3_st~0)) (.cse3 (not (= 0 ~t1_st~0))) (.cse18 (not .cse7)) (.cse19 (<= .cse20 ~token~0)) (.cse8 (<= 2 ~E_M~0)) (.cse13 (<= ~m_pc~0 0)) (.cse1 (= 1 ~t1_pc~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse17 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_3~0)) (.cse15 (= 1 ~t3_pc~0)) (.cse11 (<= 2 ~E_1~0)) (.cse5 (not (= ~m_st~0 0))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse8 .cse1 .cse9 .cse2 .cse10 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7) (and .cse8 .cse13 .cse1 .cse9 .cse2 .cse14 .cse15 .cse4 .cse11 .cse5 .cse12 .cse7) (and .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11 .cse12) (and .cse8 .cse13 .cse1 .cse9 .cse17 .cse10 .cse2 .cse11 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse17 .cse16 .cse14 .cse2 .cse15 .cse3 .cse5 .cse8 .cse18 .cse9 .cse19 .cse11 .cse12) (and .cse8 .cse13 .cse1 .cse9 .cse17 .cse2 .cse15 .cse11 .cse5 .cse12)))) [2019-12-07 14:25:28,620 INFO L246 CegarLoopResult]: For program point L162(lines 162 170) no Hoare annotation was computed. [2019-12-07 14:25:28,620 INFO L242 CegarLoopResult]: At program point L228-3(lines 216 230) the Hoare annotation is: (let ((.cse4 (not (= ~m_st~0 0))) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (let ((.cse9 (<= ~t3_pc~0 0)) (.cse5 (= 0 ~t3_st~0)) (.cse14 (<= ~m_pc~0 0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse16 (= 1 ~t3_pc~0)) (.cse3 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t2_st~0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 2 ~E_2~0)) (.cse15 (or (= ~E_2~0 1) (and .cse4 .cse13))) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse6 .cse1 .cse7 .cse8 .cse2 .cse9 .cse10 .cse15 .cse12 .cse5) (and .cse14 .cse6 .cse1 .cse7 .cse8 .cse2 .cse16 .cse10 .cse15 .cse12) (let ((.cse17 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 (<= 2 ~t3_st~0) .cse16 .cse3 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 (<= .cse17 ~token~0) .cse12 (<= ~token~0 .cse17)))))) [2019-12-07 14:25:28,620 INFO L242 CegarLoopResult]: At program point L228-4(lines 216 230) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse6 (not (= 0 ~t3_st~0))) (.cse7 (not (= 0 ~t2_st~0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (<= 2 ~E_2~0)) (.cse12 (or (= ~E_2~0 1) (and (not (= ~m_st~0 0)) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)))) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 3)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 2) ~token~0)) (and (<= ~m_pc~0 0) .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse11))) [2019-12-07 14:25:28,620 INFO L242 CegarLoopResult]: At program point L228-5(lines 216 230) the Hoare annotation is: (let ((.cse20 (not (= ~m_st~0 0))) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse25 (+ ~local~0 1))) (let ((.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse22 (<= ~token~0 .cse25)) (.cse23 (<= .cse25 ~token~0)) (.cse5 (<= ~t3_pc~0 0)) (.cse9 (= 0 ~t3_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse11 (<= 2 ~t3_st~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~E_3~0)) (.cse12 (= 1 ~t3_pc~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse13 (not .cse19)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (or (= ~E_2~0 1) (and .cse20 .cse21))) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~E_1~0)) (.cse24 (+ ~local~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 .cse1 .cse13 .cse6 .cse7 .cse14 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse16 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse10 .cse2 .cse3 .cse4 .cse20 .cse9 .cse1 .cse13 .cse5 .cse6 .cse14 .cse8 .cse21 .cse15) (and .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 .cse17 .cse1 .cse13 .cse6 .cse7 .cse16 .cse8) (and .cse10 .cse2 .cse22 .cse3 .cse4 .cse17 .cse20 .cse9 .cse1 .cse5 .cse6 .cse23 .cse16 .cse8 .cse21) (and .cse10 .cse2 .cse4 .cse17 .cse18 .cse20 .cse9 .cse19 .cse1 .cse5 .cse6 .cse16 .cse8 .cse21) (and .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 (<= ~token~0 (+ ~local~0 3)) .cse17 .cse1 .cse13 .cse6 .cse16 (< .cse24 ~token~0) .cse8) (and .cse10 .cse2 .cse22 .cse3 .cse4 .cse11 .cse12 .cse17 .cse1 .cse6 .cse23 .cse7 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse18 .cse8 .cse20 .cse21 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse18 .cse8 .cse20 .cse21 .cse9 .cse19) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse11 .cse4 .cse12 .cse6 .cse16 .cse17 .cse8) (and .cse10 .cse2 .cse4 .cse11 .cse12 .cse17 .cse18 .cse20 .cse19 .cse1 .cse6 .cse16 .cse8 .cse21) (and .cse10 .cse2 .cse3 .cse4 .cse17 .cse20 .cse9 .cse1 .cse13 .cse5 .cse6 .cse16 .cse8 .cse21) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse16 .cse17 .cse18 .cse8 .cse19) (and .cse10 .cse2 .cse3 .cse4 .cse12 .cse17 .cse1 .cse13 .cse6 .cse7 .cse16 (<= .cse24 ~token~0) .cse8 (<= ~token~0 .cse24))))) [2019-12-07 14:25:28,621 INFO L242 CegarLoopResult]: At program point L228-6(lines 216 230) the Hoare annotation is: (let ((.cse17 (not (= ~m_st~0 0))) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= 0 ~t2_st~0)) (.cse28 (+ ~local~0 1))) (let ((.cse26 (<= ~token~0 .cse28)) (.cse27 (<= .cse28 ~token~0)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse23 (+ ~local~0 2)) (.cse0 (<= ~m_pc~0 0)) (.cse5 (<= ~t3_pc~0 0)) (.cse13 (<= ~t2_pc~0 0)) (.cse9 (= 0 ~t3_st~0)) (.cse22 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= 1 ~t3_pc~0)) (.cse19 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse12 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse15 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (not .cse14)) (.cse21 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (or (= ~E_2~0 1) (and .cse17 .cse18))) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse15 .cse6 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse10 .cse11 .cse13 .cse17 .cse14 .cse1 .cse15 .cse6 .cse8 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse16 .cse12 .cse13 .cse8 .cse9 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse19 .cse12 .cse9 .cse1 .cse20 .cse21 .cse5 .cse6 .cse16 .cse8) (and .cse22 .cse2 .cse3 .cse4 .cse19 .cse12 .cse17 .cse9 .cse1 .cse20 .cse5 .cse21 .cse6 .cse16 .cse8 .cse18) (and .cse22 .cse2 .cse3 .cse4 .cse10 .cse11 .cse19 (<= ~token~0 (+ ~local~0 3)) .cse12 .cse1 .cse15 .cse20 .cse21 .cse6 .cse16 (< .cse23 ~token~0) .cse8) (and .cse22 .cse2 .cse3 .cse4 .cse19 .cse17 .cse9 .cse1 .cse20 .cse5 .cse21 .cse6 .cse24 .cse8 .cse18 .cse25) (and .cse22 .cse2 .cse26 .cse3 .cse4 .cse10 .cse11 .cse12 .cse14 .cse1 .cse15 .cse6 .cse27 .cse7 .cse16 .cse8) (and .cse22 .cse2 .cse4 .cse12 .cse13 .cse17 .cse9 .cse14 .cse1 .cse5 .cse6 .cse16 .cse8 .cse18) (and .cse22 .cse2 .cse26 .cse3 .cse4 .cse12 .cse17 .cse9 .cse14 .cse1 .cse5 .cse6 .cse27 .cse16 .cse8 .cse18) (and .cse22 .cse2 .cse3 .cse4 .cse10 .cse11 .cse19 .cse1 .cse15 .cse20 .cse21 .cse6 .cse24 .cse7 .cse8 .cse25) (and .cse22 .cse2 .cse3 .cse4 .cse11 .cse19 .cse12 .cse1 .cse20 .cse21 .cse6 .cse7 .cse16 (<= .cse23 ~token~0) .cse8 (<= ~token~0 .cse23)) (and .cse22 .cse2 .cse4 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse1 .cse15 .cse6 .cse16 .cse8 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse11 .cse19 .cse12 .cse1 .cse15 .cse20 .cse21 .cse6 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse13 .cse8 .cse17 .cse18 .cse9 .cse14) (and .cse22 .cse2 .cse3 .cse4 .cse10 .cse11 .cse19 .cse12 .cse1 .cse15 .cse20 .cse21 .cse6 .cse7 .cse16 .cse8)))) [2019-12-07 14:25:28,621 INFO L242 CegarLoopResult]: At program point L165(lines 165 169) the Hoare annotation is: (let ((.cse19 (= 0 ~t2_st~0)) (.cse28 (= ~m_st~0 0)) (.cse17 (= 0 ~t1_st~0))) (let ((.cse16 (<= 2 ~m_st~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse20 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse14 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse15 (= 0 ~t1_pc~0)) (.cse25 (<= 2 ~t2_st~0)) (.cse24 (or .cse28 .cse17)) (.cse0 (= ~m_pc~0 1)) (.cse3 (= 1 ~t2_pc~0)) (.cse26 (= 1 ~t3_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse23 (not .cse19)) (.cse22 (<= ~m_pc~0 0)) (.cse8 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (<= 2 ~E_3~0)) (.cse10 (<= ~t3_pc~0 0)) (.cse11 (<= 2 ~E_2~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse7 (not (= 0 ~t3_st~0))) (.cse6 (not .cse28))) (or (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse2 ~token~0) .cse12 .cse13)) (and .cse0 .cse14 .cse4 .cse15 .cse16 .cse17 .cse18 .cse7 .cse19 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse22 .cse14 .cse4 .cse15 .cse17 .cse18 .cse7 .cse19 .cse8 .cse10 .cse11 .cse20 .cse12 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse6 .cse8 .cse23 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse22 .cse8 .cse1 .cse9 .cse4 .cse10 .cse11 .cse5 .cse18 .cse12 .cse7 .cse19) (and .cse0 .cse3 .cse4 .cse15 .cse16 .cse17 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse22 .cse14 .cse4 .cse15 .cse18 .cse6 .cse7 .cse19 .cse8 .cse10 .cse11 .cse24 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse4 .cse5 .cse18 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse4 .cse16 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse21) (and .cse0 .cse1 .cse4 .cse18 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20 .cse24 .cse12 .cse13 .cse21) (and .cse22 .cse8 .cse1 .cse23 .cse9 .cse3 .cse4 .cse10 .cse11 .cse5 .cse12 .cse7) (and .cse22 .cse14 .cse3 .cse4 .cse15 .cse17 .cse7 .cse25 .cse8 .cse10 .cse11 .cse20 .cse12 .cse21) (and .cse22 .cse14 .cse3 .cse4 .cse15 .cse6 .cse7 .cse25 .cse8 .cse10 .cse11 .cse24 .cse12) (and .cse22 .cse8 .cse1 .cse9 .cse3 .cse4 .cse10 .cse11 .cse12 .cse7 .cse6) (and .cse22 .cse8 .cse1 .cse9 .cse3 .cse4 .cse26 .cse11 .cse12 .cse7 .cse6) (let ((.cse27 (+ ~local~0 2))) (and .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse23 .cse9 .cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse27 ~token~0) .cse12 (<= ~token~0 .cse27))) (and .cse22 .cse8 .cse1 .cse9 .cse4 .cse10 .cse11 .cse18 .cse12 .cse7 .cse6 .cse19)))) [2019-12-07 14:25:28,621 INFO L242 CegarLoopResult]: At program point L101-1(lines 89 120) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0)) (.cse26 (+ ~local~0 1))) (let ((.cse13 (<= 2 ~m_st~0)) (.cse20 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse21 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse24 (<= ~token~0 .cse26)) (.cse10 (= 0 ~t3_st~0)) (.cse5 (<= ~t3_pc~0 0)) (.cse25 (<= .cse26 ~token~0)) (.cse11 (= ~m_pc~0 1)) (.cse19 (= 1 ~t1_pc~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= ~m_pc~0 0)) (.cse4 (= 1 ~t2_pc~0)) (.cse22 (<= 2 ~t3_st~0)) (.cse6 (<= 2 ~E_3~0)) (.cse23 (= 1 ~t3_pc~0)) (.cse12 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~E_M~0)) (.cse2 (not .cse15)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse8 (<= 2 ~E_1~0)) (.cse18 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse6 .cse12 .cse13 .cse14 .cse10 .cse15 .cse0 .cse3 .cse5 .cse7 .cse16 .cse8 .cse17 .cse18) (and .cse11 .cse19 .cse6 .cse14 .cse9 .cse10 .cse15 .cse0 .cse3 .cse5 .cse7 .cse8 .cse17) (and .cse11 .cse19 .cse4 .cse6 .cse20 .cse9 .cse10 .cse0 .cse2 .cse3 .cse5 .cse21 .cse7 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse6 .cse23 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse6 .cse22 .cse12 .cse23 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse0 .cse3 .cse6 .cse5 .cse12 .cse7 .cse14 .cse8 .cse10 .cse15) (and .cse11 .cse6 .cse22 .cse12 .cse23 .cse13 .cse14 .cse15 .cse0 .cse3 .cse7 .cse16 .cse8 .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse6 .cse23 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse6 .cse22 .cse23 .cse7 .cse14 .cse8 .cse9 .cse15) (and .cse1 .cse4 .cse6 .cse12 .cse10 .cse0 .cse2 .cse3 .cse5 .cse7 .cse16 .cse8 .cse18) (and .cse11 .cse4 .cse22 .cse6 .cse23 .cse12 .cse13 .cse0 .cse2 .cse3 .cse7 .cse16 .cse8 .cse17 .cse18) (and .cse1 .cse0 .cse3 .cse6 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse15) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse4 .cse6 .cse12 .cse13 .cse10 .cse0 .cse2 .cse3 .cse5 .cse7 .cse16 .cse8 .cse17 .cse18) (and .cse11 .cse4 .cse6 .cse22 .cse23 .cse20 .cse9 .cse0 .cse2 .cse3 .cse21 .cse7 .cse8) (and .cse0 .cse11 .cse3 .cse24 .cse4 .cse6 .cse22 .cse23 .cse7 .cse25 .cse8 .cse9) (and .cse11 .cse19 .cse24 .cse4 .cse6 .cse9 .cse10 .cse0 .cse3 .cse5 .cse7 .cse25 .cse8 .cse17) (and .cse11 .cse19 .cse6 .cse22 .cse23 .cse14 .cse9 .cse15 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) .cse0 .cse3 .cse7 .cse8 .cse17) (and .cse1 .cse4 .cse22 .cse6 .cse23 .cse12 .cse0 .cse2 .cse3 .cse7 .cse16 .cse8 .cse18)))) [2019-12-07 14:25:28,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:25:28 BoogieIcfgContainer [2019-12-07 14:25:28,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:25:28,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:25:28,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:25:28,714 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:25:28,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:22:53" (3/4) ... [2019-12-07 14:25:28,717 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:25:28,734 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2019-12-07 14:25:28,735 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-12-07 14:25:28,737 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 14:25:28,738 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 14:25:28,849 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_58ab7312-fbd6-474d-bde7-36f9a28ba8ee/bin/utaipan/witness.graphml [2019-12-07 14:25:28,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:25:28,850 INFO L168 Benchmark]: Toolchain (without parser) took 156670.96 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 942.4 MB in the beginning and 1.6 GB in the end (delta: -643.3 MB). Peak memory consumption was 788.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:28,850 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:28,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:28,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:28,851 INFO L168 Benchmark]: Boogie Preprocessor took 35.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:28,851 INFO L168 Benchmark]: RCFGBuilder took 1109.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.3 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:28,851 INFO L168 Benchmark]: TraceAbstraction took 155101.97 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 883.3 MB in the beginning and 1.6 GB in the end (delta: -745.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 14:25:28,852 INFO L168 Benchmark]: Witness Printer took 135.09 ms. Allocated memory is still 2.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:28,853 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1109.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.3 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 155101.97 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 883.3 MB in the beginning and 1.6 GB in the end (delta: -745.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 135.09 ms. Allocated memory is still 2.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= E_M && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && !(m_st == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || ((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1)) || ((((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1)) || ((((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1)) || ((((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(0 == t1_st)) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && !(0 == t1_st)) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && !(0 == t1_st)) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 0 == t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((((m_pc == 1 && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_st) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((2 <= E_M && m_pc <= 0) && tmp == 1) && !(0 == t2_st)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 0 == t1_pc) && 0 == t1_st) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) && !(m_st == 0))) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st)) || ((((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && 1 == t1_pc) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((m_pc == 1 && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1)) || (((((((((((2 <= E_M && m_pc <= 0) && tmp == 1) && !(0 == t2_st)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 0 == t1_pc) && 0 == t1_st) && 2 <= E_1) && !(m_st == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || (((token <= local && __retres1 == 0) && local <= token) && (((((((((((((((m_pc == 1 && tmp == 1) && !(1 == t1_pc)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && 2 <= E_1) || (((((((((((((((m_pc == 1 && !(1 == t1_pc)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1)))) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) && __retres1 == 0)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || ((token <= local && (((((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= E_M) && __retres1 == 0) && !(tmp == 0)) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) || (((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0))) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 2 <= E_3) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 1 <= tmp) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && !(0 == t3_st)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((m_pc <= 0 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1) && 0 == t3_st) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && 2 <= E_M) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token) || (((((((((m_pc <= 0 && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1) && !(0 == t3_st))) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && 2 <= E_1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1) && 0 == t3_st)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(0 == t3_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && 2 <= E_1)) && 2 <= t1_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st)) && __retres1 == 0)) && 2 <= t1_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st))) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) && !(m_st == 0))) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && !(0 == t3_st)) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st)) && __retres1 == 0)) && token <= local) && local <= token)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && !(0 == t3_st)) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && !(0 == t3_st)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && !(0 == t3_st)) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && 2 <= E_3) && 2 <= E_2) && 0 == t1_pc) && (m_st == 0 || 0 == t1_st)) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= E_2) && 0 == t1_pc) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st))) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) && __retres1 == 0)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && !(0 == t1_st)) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_1) && __retres1 == 0) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && !(0 == t1_st)) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && !(0 == t2_st)) && t3_pc <= 0) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && !(0 == t1_st)) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(0 == t1_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && local <= token) && __retres1 == 0) || (((((((((((((1 == t2_pc && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t1_pc && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((tmp == 1 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((2 <= E_3 && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t2_pc && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && local <= token) && __retres1 == 0)) || (((((((((((((1 == t1_pc && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && !(0 == t1_st)) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && !(0 == t1_st)) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && !(0 == t1_st)) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && !(0 == t1_st)) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && !(0 == t3_st)) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((m_pc == 1 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && !(0 == t3_st)) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 2 <= m_st) && 0 == t1_st) && !(0 == t3_st)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 2 <= E_3) && 0 == t1_pc) && t2_pc <= 0) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(0 == t3_st)) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= m_st) && t2_pc <= 0) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && !(0 == t3_st)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && !(0 == t3_st))) || (((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && !(0 == t3_st)) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((m_pc <= 0 && tmp == 1) && 1 == t2_pc) && 2 <= E_3) && 0 == t1_pc) && !(m_st == 0)) && !(0 == t3_st)) && 2 <= t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && (m_st == 0 || 0 == t1_st)) && 2 <= E_1)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(0 == t3_st)) && !(m_st == 0))) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(0 == t3_st)) && !(m_st == 0))) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && !(0 == t3_st)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(0 == t3_st)) && !(m_st == 0)) && 0 == t2_st) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && __retres1 == 0) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || (((((((((((((1 == t1_pc && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t2_pc && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((tmp == 1 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t1_pc && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((2 <= E_3 && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t2_pc && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1) || ((((((((((m_pc <= 0 && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && !(0 == t3_st)) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_1) && __retres1 == 0) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1) && 0 == t3_st) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || (!(m_st == 0) && __retres1 == 0))) && __retres1 == 0) && 2 <= E_1) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && !(0 == t2_st)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((((2 <= E_3 && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((tmp == 1 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((1 == t1_pc && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((((((1 == t1_pc && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((((((((((1 == t2_pc && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((((1 == t2_pc && 2 <= E_3) && __retres1 <= 0) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && !(0 == t2_st)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && !(0 == t2_st)) && t3_pc <= 0) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 == t2_pc && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || (((((((((((((((1 == t2_pc && 2 <= E_3) && __retres1 <= 0) && 0 == t1_pc) && 0 == t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= t2_st) && 2 <= E_M) && !(tmp == 0)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((tmp == 1 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((((2 <= E_3 && 2 <= t3_st) && 1 == t3_pc) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((((((1 == t1_pc && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((((((1 == t1_pc && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && token <= local) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && 0 == t3_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || ((((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && token <= local + 3) && 2 <= t1_st) && !(0 == t3_st)) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && local + 2 < token) || ((((((((((m_pc <= 0 && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) && !(m_st == 0)) && !(0 == t3_st))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= t1_st) && !(0 == t3_st)) && !(m_st == 0)) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((m_pc <= 0 && 2 <= E_3) && 0 == t1_pc) && 0 == t1_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0) && !(m_st == 0))) || (((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && t3_pc <= 0) && 2 <= E_3) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) || ((((((((((((((m_pc == 1 && 2 <= E_3) && !(0 == t1_st)) && 2 <= m_st) && t2_pc <= 0) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 0 <= __retres1) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || ((((((((((2 <= E_M && m_pc <= 0) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && 0 == t2_st)) || ((((((((((m_pc <= 0 && 2 <= E_M) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && !(0 == t1_st)) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((m_pc == 1 && 2 <= E_3) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0))) || ((((((((((2 <= E_M && m_pc <= 0) && !(tmp == 0)) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t2_st)) || ((((((((((((m_pc <= 0 && 1 == t2_pc) && 2 <= E_3) && !(0 == t1_st)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token)) || ((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(0 == t1_st)) && 2 <= m_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((m_pc <= 0 && 2 <= E_M) && !(tmp == 0)) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st)) || ((((((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && !(0 == t1_st)) && 2 <= m_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 0 <= __retres1) && 2 <= E_2) && 2 <= E_1)) || (((((((((((2 <= E_M && m_pc == 1) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && !(m_st == 0))) || (((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(tmp == 0)) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && __retres1 == 0) && 2 <= E_M) && !(tmp == 0)) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((m_pc <= 0 && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_3) && 1 == t3_pc) && !(0 == t1_st)) && 2 <= E_M) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && local <= token) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || ((((((((((((m_pc <= 0 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && 2 <= E_1) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && 0 == t3_st) && 0 == t2_st)) || (((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 1 == t3_pc) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0))) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && token <= local + 3) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 < token) && 2 <= E_1)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && token <= local) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && local + 1 <= token) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_3) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 0 == t2_st) && 2 <= E_M) && t3_pc <= 0) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && 2 <= t1_st) && t2_pc <= 0) && !(m_st == 0)) && 0 == t2_st) && 2 <= E_M) && __retres1 == 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((m_pc <= 0 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1)) || (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && 0 == t3_st) && 0 == t2_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && token <= local) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && local <= token)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 0 == t3_st) && 2 <= E_M) && !(0 == t2_st)) && 0 <= __retres1) && t3_pc <= 0) && 2 <= E_2) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && t3_pc <= 0) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && 2 <= E_1) && !(m_st == 0)) && 0 == t3_st)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_3) && 2 <= t3_st) && 1 == t3_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && 2 <= E_M) && __retres1 == 0) && !(0 == t2_st)) && 0 <= __retres1) && 2 <= E_2) && (E_2 == 1 || __retres1 == 0)) && __retres1 == 0) && 2 <= E_1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: SAFE, OverallTime: 13.5s, OverallIterations: 28, TraceHistogramMax: 4, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 141.3s, HoareTripleCheckerStatistics: 7290 SDtfs, 6293 SDslu, 9597 SDs, 0 SdLazy, 1289 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 727 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7489occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 21400 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 1792 NumberOfFragments, 26054 HoareAnnotationTreeSize, 46 FomulaSimplifications, 7764928 FormulaSimplificationTreeSizeReduction, 12.8s HoareSimplificationTime, 46 FomulaSimplificationsInter, 2066649 FormulaSimplificationTreeSizeReductionInter, 128.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2328 NumberOfCodeBlocks, 2328 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2630 ConstructedInterpolants, 0 QuantifiedInterpolants, 461142 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1550 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 486/502 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...