./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d58fadf54daed6107b58402b79d250d23d0301 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 16:39:40,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:39:40,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:39:40,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:39:40,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:39:40,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:39:40,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:39:40,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:39:40,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:39:40,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:39:40,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:39:40,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:39:40,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:39:40,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:39:40,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:39:40,072 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:39:40,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:39:40,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:39:40,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:39:40,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:39:40,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:39:40,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:39:40,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:39:40,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:39:40,078 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:39:40,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:39:40,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:39:40,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:39:40,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:39:40,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:39:40,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:39:40,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:39:40,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:39:40,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:39:40,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:39:40,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:39:40,081 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 16:39:40,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:39:40,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:39:40,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 16:39:40,089 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 16:39:40,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:39:40,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 16:39:40,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 16:39:40,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 16:39:40,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 16:39:40,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:39:40,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 16:39:40,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 16:39:40,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:39:40,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 16:39:40,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3d58fadf54daed6107b58402b79d250d23d0301 [2018-12-01 16:39:40,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:39:40,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:39:40,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:39:40,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:39:40,124 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:39:40,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-01 16:39:40,171 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/data/e8d1a2935/8bbda29505ff43d19ab73871c9e1a548/FLAGbca535546 [2018-12-01 16:39:40,463 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:39:40,464 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-01 16:39:40,468 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/data/e8d1a2935/8bbda29505ff43d19ab73871c9e1a548/FLAGbca535546 [2018-12-01 16:39:40,477 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/data/e8d1a2935/8bbda29505ff43d19ab73871c9e1a548 [2018-12-01 16:39:40,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:39:40,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:39:40,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:39:40,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:39:40,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:39:40,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71739fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40, skipping insertion in model container [2018-12-01 16:39:40,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:39:40,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:39:40,610 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:39:40,614 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:39:40,636 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:39:40,689 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:39:40,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40 WrapperNode [2018-12-01 16:39:40,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:39:40,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:39:40,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:39:40,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:39:40,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:39:40,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:39:40,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:39:40,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:39:40,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... [2018-12-01 16:39:40,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:39:40,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:39:40,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:39:40,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:39:40,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/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 [2018-12-01 16:39:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-01 16:39:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-01 16:39:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-01 16:39:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-01 16:39:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 16:39:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 16:39:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-01 16:39:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-01 16:39:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-01 16:39:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 16:39:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 16:39:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-01 16:39:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-01 16:39:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-01 16:39:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-01 16:39:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-01 16:39:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-01 16:39:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:39:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:39:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-01 16:39:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-01 16:39:41,027 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:39:41,027 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 16:39:41,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:39:41 BoogieIcfgContainer [2018-12-01 16:39:41,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:39:41,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 16:39:41,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 16:39:41,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 16:39:41,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 04:39:40" (1/3) ... [2018-12-01 16:39:41,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6bf487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:39:41, skipping insertion in model container [2018-12-01 16:39:41,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:40" (2/3) ... [2018-12-01 16:39:41,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6bf487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:39:41, skipping insertion in model container [2018-12-01 16:39:41,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:39:41" (3/3) ... [2018-12-01 16:39:41,033 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-01 16:39:41,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 16:39:41,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 16:39:41,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 16:39:41,068 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 16:39:41,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 16:39:41,068 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 16:39:41,069 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 16:39:41,069 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 16:39:41,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 16:39:41,069 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 16:39:41,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 16:39:41,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 16:39:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-12-01 16:39:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:41,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:41,090 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:41,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:41,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-12-01 16:39:41,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:41,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:41,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:41,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:41,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:41,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:41,296 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-12-01 16:39:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:41,617 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-12-01 16:39:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:41,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 16:39:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:41,630 INFO L225 Difference]: With dead ends: 361 [2018-12-01 16:39:41,630 INFO L226 Difference]: Without dead ends: 195 [2018-12-01 16:39:41,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-01 16:39:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-01 16:39:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-01 16:39:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-12-01 16:39:41,676 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-12-01 16:39:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:41,676 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-12-01 16:39:41,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-12-01 16:39:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:41,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:41,678 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:41,678 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:41,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-12-01 16:39:41,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:41,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:41,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:41,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:41,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:41,760 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-12-01 16:39:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:41,988 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-12-01 16:39:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:41,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 16:39:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:41,990 INFO L225 Difference]: With dead ends: 340 [2018-12-01 16:39:41,990 INFO L226 Difference]: Without dead ends: 195 [2018-12-01 16:39:41,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-01 16:39:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-01 16:39:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-01 16:39:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-12-01 16:39:42,006 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-12-01 16:39:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:42,007 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-12-01 16:39:42,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-12-01 16:39:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:42,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:42,008 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:42,008 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:42,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-12-01 16:39:42,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:42,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:42,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:42,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:42,075 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-12-01 16:39:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:42,256 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-12-01 16:39:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:42,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 16:39:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:42,258 INFO L225 Difference]: With dead ends: 338 [2018-12-01 16:39:42,258 INFO L226 Difference]: Without dead ends: 193 [2018-12-01 16:39:42,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-01 16:39:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-12-01 16:39:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-01 16:39:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-12-01 16:39:42,269 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-12-01 16:39:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:42,269 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-12-01 16:39:42,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-12-01 16:39:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:42,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:42,270 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:42,270 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:42,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-12-01 16:39:42,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:42,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:42,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:42,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:42,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:42,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:42,328 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-12-01 16:39:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:42,546 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-12-01 16:39:42,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:42,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 16:39:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:42,547 INFO L225 Difference]: With dead ends: 355 [2018-12-01 16:39:42,547 INFO L226 Difference]: Without dead ends: 210 [2018-12-01 16:39:42,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-01 16:39:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-12-01 16:39:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-01 16:39:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-12-01 16:39:42,559 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-12-01 16:39:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:42,559 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-12-01 16:39:42,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-12-01 16:39:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:42,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:42,560 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:42,560 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:42,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-12-01 16:39:42,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:42,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:42,601 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-12-01 16:39:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:42,796 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-12-01 16:39:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:42,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 16:39:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:42,797 INFO L225 Difference]: With dead ends: 349 [2018-12-01 16:39:42,797 INFO L226 Difference]: Without dead ends: 204 [2018-12-01 16:39:42,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-01 16:39:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-12-01 16:39:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-01 16:39:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-12-01 16:39:42,808 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-12-01 16:39:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:42,808 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-12-01 16:39:42,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-12-01 16:39:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:42,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:42,809 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:42,809 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:42,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-12-01 16:39:42,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:42,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:42,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:42,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:42,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:42,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:42,864 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-12-01 16:39:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:43,086 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-12-01 16:39:43,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:43,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 16:39:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:43,088 INFO L225 Difference]: With dead ends: 351 [2018-12-01 16:39:43,089 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 16:39:43,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 16:39:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-12-01 16:39:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-01 16:39:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-12-01 16:39:43,105 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-12-01 16:39:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:43,105 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-12-01 16:39:43,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-12-01 16:39:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 16:39:43,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:43,106 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:43,107 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:43,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-12-01 16:39:43,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:43,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:43,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:43,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 16:39:43,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:39:43,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:39:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:43,159 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-12-01 16:39:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:43,285 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-12-01 16:39:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:39:43,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 16:39:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:43,286 INFO L225 Difference]: With dead ends: 445 [2018-12-01 16:39:43,287 INFO L226 Difference]: Without dead ends: 301 [2018-12-01 16:39:43,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-01 16:39:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-12-01 16:39:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-01 16:39:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-12-01 16:39:43,306 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-12-01 16:39:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:43,306 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-12-01 16:39:43,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:39:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-12-01 16:39:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-01 16:39:43,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:43,308 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:43,308 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:43,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-12-01 16:39:43,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:43,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:43,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:43,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-01 16:39:43,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:43,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:43,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:43,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 16:39:43,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:43,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-01 16:39:43,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 16:39:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 16:39:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:43,476 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 7 states. [2018-12-01 16:39:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:43,581 INFO L93 Difference]: Finished difference Result 871 states and 1227 transitions. [2018-12-01 16:39:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 16:39:43,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-12-01 16:39:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:43,584 INFO L225 Difference]: With dead ends: 871 [2018-12-01 16:39:43,585 INFO L226 Difference]: Without dead ends: 592 [2018-12-01 16:39:43,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-01 16:39:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-12-01 16:39:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 567. [2018-12-01 16:39:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-01 16:39:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 766 transitions. [2018-12-01 16:39:43,630 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 766 transitions. Word has length 145 [2018-12-01 16:39:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:43,630 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 766 transitions. [2018-12-01 16:39:43,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 16:39:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 766 transitions. [2018-12-01 16:39:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-01 16:39:43,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:43,633 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2018-12-01 16:39:43,633 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:43,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:43,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2045120242, now seen corresponding path program 1 times [2018-12-01 16:39:43,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:43,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:43,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:43,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-01 16:39:43,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:43,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 16:39:43,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:39:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:39:43,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:43,678 INFO L87 Difference]: Start difference. First operand 567 states and 766 transitions. Second operand 4 states. [2018-12-01 16:39:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:43,790 INFO L93 Difference]: Finished difference Result 1107 states and 1494 transitions. [2018-12-01 16:39:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:39:43,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-01 16:39:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:43,793 INFO L225 Difference]: With dead ends: 1107 [2018-12-01 16:39:43,793 INFO L226 Difference]: Without dead ends: 561 [2018-12-01 16:39:43,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-01 16:39:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2018-12-01 16:39:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-12-01 16:39:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 754 transitions. [2018-12-01 16:39:43,838 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 754 transitions. Word has length 164 [2018-12-01 16:39:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:43,838 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 754 transitions. [2018-12-01 16:39:43,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:39:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 754 transitions. [2018-12-01 16:39:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 16:39:43,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:43,840 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:43,840 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:43,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2046681584, now seen corresponding path program 1 times [2018-12-01 16:39:43,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:43,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:43,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-01 16:39:43,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:43,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:43,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 16:39:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-01 16:39:43,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:43,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:43,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:43,990 INFO L87 Difference]: Start difference. First operand 561 states and 754 transitions. Second operand 5 states. [2018-12-01 16:39:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:44,347 INFO L93 Difference]: Finished difference Result 2135 states and 3119 transitions. [2018-12-01 16:39:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:39:44,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-12-01 16:39:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:44,351 INFO L225 Difference]: With dead ends: 2135 [2018-12-01 16:39:44,351 INFO L226 Difference]: Without dead ends: 1595 [2018-12-01 16:39:44,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-12-01 16:39:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1560. [2018-12-01 16:39:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-12-01 16:39:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2157 transitions. [2018-12-01 16:39:44,425 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2157 transitions. Word has length 146 [2018-12-01 16:39:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:44,425 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 2157 transitions. [2018-12-01 16:39:44,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2157 transitions. [2018-12-01 16:39:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-01 16:39:44,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:44,427 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2018-12-01 16:39:44,427 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:44,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1779269911, now seen corresponding path program 1 times [2018-12-01 16:39:44,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:44,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:44,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:44,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:44,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-01 16:39:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:44,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:44,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:44,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-01 16:39:44,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:44,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-01 16:39:44,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 16:39:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 16:39:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:44,584 INFO L87 Difference]: Start difference. First operand 1560 states and 2157 transitions. Second operand 7 states. [2018-12-01 16:39:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:44,784 INFO L93 Difference]: Finished difference Result 4635 states and 7087 transitions. [2018-12-01 16:39:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 16:39:44,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 166 [2018-12-01 16:39:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:44,795 INFO L225 Difference]: With dead ends: 4635 [2018-12-01 16:39:44,795 INFO L226 Difference]: Without dead ends: 3100 [2018-12-01 16:39:44,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-01 16:39:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-01 16:39:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3092. [2018-12-01 16:39:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2018-12-01 16:39:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4461 transitions. [2018-12-01 16:39:44,983 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4461 transitions. Word has length 166 [2018-12-01 16:39:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:44,983 INFO L480 AbstractCegarLoop]: Abstraction has 3092 states and 4461 transitions. [2018-12-01 16:39:44,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 16:39:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4461 transitions. [2018-12-01 16:39:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-01 16:39:44,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:44,986 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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] [2018-12-01 16:39:44,986 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:44,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1059764100, now seen corresponding path program 1 times [2018-12-01 16:39:44,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:44,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-01 16:39:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:45,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 16:39:45,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:39:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:39:45,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:45,021 INFO L87 Difference]: Start difference. First operand 3092 states and 4461 transitions. Second operand 4 states. [2018-12-01 16:39:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:45,247 INFO L93 Difference]: Finished difference Result 5660 states and 8053 transitions. [2018-12-01 16:39:45,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:39:45,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-01 16:39:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:45,260 INFO L225 Difference]: With dead ends: 5660 [2018-12-01 16:39:45,260 INFO L226 Difference]: Without dead ends: 2595 [2018-12-01 16:39:45,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2018-12-01 16:39:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2595. [2018-12-01 16:39:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-12-01 16:39:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3628 transitions. [2018-12-01 16:39:45,396 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3628 transitions. Word has length 167 [2018-12-01 16:39:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:45,396 INFO L480 AbstractCegarLoop]: Abstraction has 2595 states and 3628 transitions. [2018-12-01 16:39:45,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:39:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3628 transitions. [2018-12-01 16:39:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-01 16:39:45,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:45,399 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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] [2018-12-01 16:39:45,399 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:45,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1788622330, now seen corresponding path program 1 times [2018-12-01 16:39:45,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:45,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-01 16:39:45,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:45,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:45,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:45,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:45,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:45,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-01 16:39:45,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 16:39:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 16:39:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:45,585 INFO L87 Difference]: Start difference. First operand 2595 states and 3628 transitions. Second operand 7 states. [2018-12-01 16:39:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:45,866 INFO L93 Difference]: Finished difference Result 7827 states and 12348 transitions. [2018-12-01 16:39:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 16:39:45,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2018-12-01 16:39:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:45,883 INFO L225 Difference]: With dead ends: 7827 [2018-12-01 16:39:45,884 INFO L226 Difference]: Without dead ends: 5258 [2018-12-01 16:39:45,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-01 16:39:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-01 16:39:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5229. [2018-12-01 16:39:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5229 states. [2018-12-01 16:39:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 7664 transitions. [2018-12-01 16:39:46,177 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 7664 transitions. Word has length 167 [2018-12-01 16:39:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:46,177 INFO L480 AbstractCegarLoop]: Abstraction has 5229 states and 7664 transitions. [2018-12-01 16:39:46,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 16:39:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 7664 transitions. [2018-12-01 16:39:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 16:39:46,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:46,182 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:46,182 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:46,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:46,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2137289136, now seen corresponding path program 1 times [2018-12-01 16:39:46,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:46,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:46,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:46,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:46,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:46,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:46,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 16:39:46,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:39:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:39:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:46,208 INFO L87 Difference]: Start difference. First operand 5229 states and 7664 transitions. Second operand 4 states. [2018-12-01 16:39:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:46,420 INFO L93 Difference]: Finished difference Result 9216 states and 13353 transitions. [2018-12-01 16:39:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:39:46,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-01 16:39:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:46,432 INFO L225 Difference]: With dead ends: 9216 [2018-12-01 16:39:46,432 INFO L226 Difference]: Without dead ends: 4009 [2018-12-01 16:39:46,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-12-01 16:39:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4009. [2018-12-01 16:39:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2018-12-01 16:39:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5717 transitions. [2018-12-01 16:39:46,629 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5717 transitions. Word has length 146 [2018-12-01 16:39:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:46,629 INFO L480 AbstractCegarLoop]: Abstraction has 4009 states and 5717 transitions. [2018-12-01 16:39:46,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:39:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5717 transitions. [2018-12-01 16:39:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:46,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:46,632 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:46,632 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:46,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 4256015, now seen corresponding path program 1 times [2018-12-01 16:39:46,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:46,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:46,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:46,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:46,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:46,681 INFO L87 Difference]: Start difference. First operand 4009 states and 5717 transitions. Second operand 5 states. [2018-12-01 16:39:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:47,118 INFO L93 Difference]: Finished difference Result 9831 states and 14243 transitions. [2018-12-01 16:39:47,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:39:47,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 16:39:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:47,133 INFO L225 Difference]: With dead ends: 9831 [2018-12-01 16:39:47,133 INFO L226 Difference]: Without dead ends: 5845 [2018-12-01 16:39:47,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2018-12-01 16:39:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5224. [2018-12-01 16:39:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-01 16:39:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7019 transitions. [2018-12-01 16:39:47,390 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7019 transitions. Word has length 147 [2018-12-01 16:39:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:47,391 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 7019 transitions. [2018-12-01 16:39:47,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7019 transitions. [2018-12-01 16:39:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:47,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:47,393 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:47,393 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:47,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1880738833, now seen corresponding path program 1 times [2018-12-01 16:39:47,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:47,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:47,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:47,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:47,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:47,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:47,446 INFO L87 Difference]: Start difference. First operand 5224 states and 7019 transitions. Second operand 5 states. [2018-12-01 16:39:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:47,816 INFO L93 Difference]: Finished difference Result 10425 states and 14064 transitions. [2018-12-01 16:39:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:47,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 16:39:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:47,828 INFO L225 Difference]: With dead ends: 10425 [2018-12-01 16:39:47,828 INFO L226 Difference]: Without dead ends: 5224 [2018-12-01 16:39:47,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2018-12-01 16:39:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2018-12-01 16:39:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-01 16:39:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 6965 transitions. [2018-12-01 16:39:48,051 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 6965 transitions. Word has length 147 [2018-12-01 16:39:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:48,051 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 6965 transitions. [2018-12-01 16:39:48,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 6965 transitions. [2018-12-01 16:39:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:48,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:48,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:48,053 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:48,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1607887, now seen corresponding path program 1 times [2018-12-01 16:39:48,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:48,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:48,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:48,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:48,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:48,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:48,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:48,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:48,099 INFO L87 Difference]: Start difference. First operand 5224 states and 6965 transitions. Second operand 5 states. [2018-12-01 16:39:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:48,511 INFO L93 Difference]: Finished difference Result 10425 states and 13956 transitions. [2018-12-01 16:39:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:48,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 16:39:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:48,522 INFO L225 Difference]: With dead ends: 10425 [2018-12-01 16:39:48,522 INFO L226 Difference]: Without dead ends: 5224 [2018-12-01 16:39:48,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2018-12-01 16:39:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2018-12-01 16:39:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-01 16:39:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 6911 transitions. [2018-12-01 16:39:48,739 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 6911 transitions. Word has length 147 [2018-12-01 16:39:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:48,739 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 6911 transitions. [2018-12-01 16:39:48,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 6911 transitions. [2018-12-01 16:39:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:48,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:48,742 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:48,742 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:48,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1326464081, now seen corresponding path program 1 times [2018-12-01 16:39:48,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:48,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:48,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:48,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:48,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:48,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:48,803 INFO L87 Difference]: Start difference. First operand 5224 states and 6911 transitions. Second operand 5 states. [2018-12-01 16:39:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:49,344 INFO L93 Difference]: Finished difference Result 11281 states and 16689 transitions. [2018-12-01 16:39:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:39:49,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 16:39:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:49,361 INFO L225 Difference]: With dead ends: 11281 [2018-12-01 16:39:49,361 INFO L226 Difference]: Without dead ends: 6080 [2018-12-01 16:39:49,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2018-12-01 16:39:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 5579. [2018-12-01 16:39:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2018-12-01 16:39:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 7229 transitions. [2018-12-01 16:39:49,611 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 7229 transitions. Word has length 147 [2018-12-01 16:39:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 5579 states and 7229 transitions. [2018-12-01 16:39:49,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 7229 transitions. [2018-12-01 16:39:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:49,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:49,613 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:49,613 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:49,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1401745265, now seen corresponding path program 1 times [2018-12-01 16:39:49,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:49,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:49,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:49,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:49,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:49,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:49,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:49,657 INFO L87 Difference]: Start difference. First operand 5579 states and 7229 transitions. Second operand 5 states. [2018-12-01 16:39:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:50,171 INFO L93 Difference]: Finished difference Result 11547 states and 15922 transitions. [2018-12-01 16:39:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:39:50,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 16:39:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:50,187 INFO L225 Difference]: With dead ends: 11547 [2018-12-01 16:39:50,188 INFO L226 Difference]: Without dead ends: 5991 [2018-12-01 16:39:50,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-12-01 16:39:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 5914. [2018-12-01 16:39:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5914 states. [2018-12-01 16:39:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 7667 transitions. [2018-12-01 16:39:50,464 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 7667 transitions. Word has length 147 [2018-12-01 16:39:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:50,464 INFO L480 AbstractCegarLoop]: Abstraction has 5914 states and 7667 transitions. [2018-12-01 16:39:50,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 7667 transitions. [2018-12-01 16:39:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:50,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:50,466 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:50,466 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:50,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1835383953, now seen corresponding path program 1 times [2018-12-01 16:39:50,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:50,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:50,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 16:39:50,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:50,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:50,509 INFO L87 Difference]: Start difference. First operand 5914 states and 7667 transitions. Second operand 5 states. [2018-12-01 16:39:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:51,140 INFO L93 Difference]: Finished difference Result 12600 states and 18979 transitions. [2018-12-01 16:39:51,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:39:51,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 16:39:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:51,159 INFO L225 Difference]: With dead ends: 12600 [2018-12-01 16:39:51,159 INFO L226 Difference]: Without dead ends: 6708 [2018-12-01 16:39:51,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2018-12-01 16:39:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6114. [2018-12-01 16:39:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6114 states. [2018-12-01 16:39:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 7893 transitions. [2018-12-01 16:39:51,468 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 7893 transitions. Word has length 147 [2018-12-01 16:39:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:51,469 INFO L480 AbstractCegarLoop]: Abstraction has 6114 states and 7893 transitions. [2018-12-01 16:39:51,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 7893 transitions. [2018-12-01 16:39:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 16:39:51,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:51,471 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 16:39:51,471 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:51,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 692881487, now seen corresponding path program 1 times [2018-12-01 16:39:51,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:51,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:51,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-01 16:39:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 16:39:51,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:39:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:39:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:51,499 INFO L87 Difference]: Start difference. First operand 6114 states and 7893 transitions. Second operand 4 states. [2018-12-01 16:39:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:51,867 INFO L93 Difference]: Finished difference Result 9514 states and 12687 transitions. [2018-12-01 16:39:51,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:39:51,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-01 16:39:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:51,876 INFO L225 Difference]: With dead ends: 9514 [2018-12-01 16:39:51,876 INFO L226 Difference]: Without dead ends: 5475 [2018-12-01 16:39:51,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:39:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2018-12-01 16:39:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5445. [2018-12-01 16:39:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5445 states. [2018-12-01 16:39:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 6729 transitions. [2018-12-01 16:39:52,128 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 6729 transitions. Word has length 147 [2018-12-01 16:39:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:52,128 INFO L480 AbstractCegarLoop]: Abstraction has 5445 states and 6729 transitions. [2018-12-01 16:39:52,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:39:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 6729 transitions. [2018-12-01 16:39:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-01 16:39:52,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:52,132 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-12-01 16:39:52,132 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:52,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash -198318960, now seen corresponding path program 1 times [2018-12-01 16:39:52,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:52,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:52,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:52,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:52,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-01 16:39:52,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:52,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:52,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:52,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 16:39:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:52,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-01 16:39:52,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:39:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:52,301 INFO L87 Difference]: Start difference. First operand 5445 states and 6729 transitions. Second operand 5 states. [2018-12-01 16:39:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:52,921 INFO L93 Difference]: Finished difference Result 9689 states and 11989 transitions. [2018-12-01 16:39:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:39:52,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2018-12-01 16:39:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:52,937 INFO L225 Difference]: With dead ends: 9689 [2018-12-01 16:39:52,937 INFO L226 Difference]: Without dead ends: 5444 [2018-12-01 16:39:52,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2018-12-01 16:39:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 5444. [2018-12-01 16:39:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5444 states. [2018-12-01 16:39:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 6619 transitions. [2018-12-01 16:39:53,316 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 6619 transitions. Word has length 192 [2018-12-01 16:39:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:53,316 INFO L480 AbstractCegarLoop]: Abstraction has 5444 states and 6619 transitions. [2018-12-01 16:39:53,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:39:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 6619 transitions. [2018-12-01 16:39:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-01 16:39:53,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:53,321 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-01 16:39:53,321 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:53,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1598654101, now seen corresponding path program 1 times [2018-12-01 16:39:53,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:53,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:53,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:53,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-01 16:39:53,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:53,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:53,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 16:39:53,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:53,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-12-01 16:39:53,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:39:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:39:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:39:53,477 INFO L87 Difference]: Start difference. First operand 5444 states and 6619 transitions. Second operand 3 states. [2018-12-01 16:39:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:53,766 INFO L93 Difference]: Finished difference Result 8878 states and 11013 transitions. [2018-12-01 16:39:53,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:39:53,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-01 16:39:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:53,778 INFO L225 Difference]: With dead ends: 8878 [2018-12-01 16:39:53,778 INFO L226 Difference]: Without dead ends: 4634 [2018-12-01 16:39:53,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:39:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2018-12-01 16:39:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4581. [2018-12-01 16:39:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4581 states. [2018-12-01 16:39:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 5403 transitions. [2018-12-01 16:39:54,014 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 5403 transitions. Word has length 212 [2018-12-01 16:39:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:54,015 INFO L480 AbstractCegarLoop]: Abstraction has 4581 states and 5403 transitions. [2018-12-01 16:39:54,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:39:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 5403 transitions. [2018-12-01 16:39:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-12-01 16:39:54,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:54,020 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:54,020 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:54,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1041409111, now seen corresponding path program 1 times [2018-12-01 16:39:54,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:54,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:54,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:54,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-12-01 16:39:54,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:39:54,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:39:54,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:54,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-12-01 16:39:54,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 16:39:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-12-01 16:39:54,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 16:39:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:39:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:39:54,290 INFO L87 Difference]: Start difference. First operand 4581 states and 5403 transitions. Second operand 6 states. [2018-12-01 16:39:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:54,632 INFO L93 Difference]: Finished difference Result 6320 states and 7548 transitions. [2018-12-01 16:39:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 16:39:54,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 373 [2018-12-01 16:39:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:54,636 INFO L225 Difference]: With dead ends: 6320 [2018-12-01 16:39:54,636 INFO L226 Difference]: Without dead ends: 1468 [2018-12-01 16:39:54,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-01 16:39:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-01 16:39:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1464. [2018-12-01 16:39:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-12-01 16:39:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1603 transitions. [2018-12-01 16:39:54,739 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1603 transitions. Word has length 373 [2018-12-01 16:39:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:54,739 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 1603 transitions. [2018-12-01 16:39:54,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 16:39:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1603 transitions. [2018-12-01 16:39:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-01 16:39:54,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:39:54,741 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:54,741 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:39:54,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 1 times [2018-12-01 16:39:54,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:54,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:54,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:54,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:54,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-01 16:39:54,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 16:39:54,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 16:39:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 16:39:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:39:54,850 INFO L87 Difference]: Start difference. First operand 1464 states and 1603 transitions. Second operand 7 states. [2018-12-01 16:39:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:55,587 INFO L93 Difference]: Finished difference Result 1465 states and 1605 transitions. [2018-12-01 16:39:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 16:39:55,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-12-01 16:39:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:39:55,588 INFO L225 Difference]: With dead ends: 1465 [2018-12-01 16:39:55,588 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 16:39:55,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-01 16:39:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 16:39:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 16:39:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 16:39:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 16:39:55,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-12-01 16:39:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:39:55,591 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:39:55,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 16:39:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 16:39:55,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 16:39:55,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 16:39:55,727 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 188 [2018-12-01 16:39:56,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:56,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:39:58,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 16:40:00,202 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:01,347 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:03,865 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 209 DAG size of output: 102 [2018-12-01 16:40:04,424 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2018-12-01 16:40:05,835 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 144 DAG size of output: 103 [2018-12-01 16:40:06,295 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2018-12-01 16:40:06,407 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2018-12-01 16:40:08,971 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:09,075 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-12-01 16:40:09,189 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-12-01 16:40:10,256 WARN L180 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 142 [2018-12-01 16:40:13,677 WARN L180 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:14,187 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 88 [2018-12-01 16:40:14,543 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2018-12-01 16:40:16,021 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:16,800 WARN L180 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2018-12-01 16:40:17,636 WARN L180 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-12-01 16:40:17,865 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2018-12-01 16:40:18,626 WARN L180 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 93 [2018-12-01 16:40:20,415 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 187 DAG size of output: 119 [2018-12-01 16:40:20,803 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2018-12-01 16:40:23,739 WARN L180 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 201 DAG size of output: 125 [2018-12-01 16:40:25,866 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 181 DAG size of output: 114 [2018-12-01 16:40:27,655 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:29,023 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 142 DAG size of output: 98 [2018-12-01 16:40:29,608 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 97 [2018-12-01 16:40:29,933 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2018-12-01 16:40:30,124 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-01 16:40:31,593 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 169 DAG size of output: 151 [2018-12-01 16:40:35,716 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 175 DAG size of output: 94 [2018-12-01 16:40:35,822 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2018-12-01 16:40:37,648 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 170 DAG size of output: 153 [2018-12-01 16:40:39,458 WARN L180 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:40:40,878 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 142 DAG size of output: 98 [2018-12-01 16:40:41,334 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2018-12-01 16:40:42,192 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 93 [2018-12-01 16:40:43,374 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 160 DAG size of output: 134 [2018-12-01 16:40:44,650 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 139 DAG size of output: 97 [2018-12-01 16:40:44,945 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-12-01 16:40:48,781 WARN L180 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 181 DAG size of output: 114 [2018-12-01 16:40:49,009 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 1 [2018-12-01 16:40:49,157 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 1 [2018-12-01 16:40:52,179 WARN L180 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 206 DAG size of output: 171 [2018-12-01 16:40:52,303 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2018-12-01 16:40:57,147 WARN L180 SmtUtils]: Spent 4.75 s on a formula simplification. DAG size of input: 206 DAG size of output: 171 [2018-12-01 16:40:57,872 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2018-12-01 16:40:59,189 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2018-12-01 16:41:00,210 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:41:02,279 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 186 DAG size of output: 97 [2018-12-01 16:41:05,140 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 182 DAG size of output: 142 [2018-12-01 16:41:06,461 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-01 16:41:10,210 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2018-12-01 16:41:10,912 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2018-12-01 16:41:16,131 WARN L180 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 206 DAG size of output: 171 [2018-12-01 16:41:16,136 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse37 (= 1 ~m_pc~0))) (let ((.cse27 (and (not .cse0) (not .cse4) .cse37 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse35 (= 0 ~t2_st~0))) (let ((.cse22 (not (= ~E_2~0 1))) (.cse23 (and .cse27 (= ~t1_i~0 1) .cse35)) (.cse3 (< |old(~m_st~0)| 2)) (.cse20 (<= 2 ~m_st~0)) (.cse13 (not .cse37)) (.cse2 (< 0 ~t2_pc~0)) (.cse11 (not (= 0 |old(~t2_st~0)|))) (.cse29 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse33 (= ~m_st~0 0)) (.cse24 (= |old(~E_2~0)| ~E_2~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (<= 2 ~t2_st~0)) (.cse34 (<= ~token~0 ~local~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse26 (< ~local~0 |old(~token~0)|)) (.cse30 (< |old(~token~0)| ~local~0)) (.cse25 (= |old(~t1_pc~0)| 1)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse31 (not (= 1 ~t2_pc~0))) (.cse8 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_1~0)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 |old(~E_2~0)|)) (.cse19 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse20 .cse21 .cse22 .cse23)) (or .cse0 .cse24 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse10 .cse12 .cse15 .cse18 .cse19 (and .cse27 .cse20 .cse21 .cse28 .cse22) .cse29 .cse30 .cse7 .cse31 .cse8 .cse9 .cse13 (and .cse20 .cse21 .cse22 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse23) .cse14 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 (and .cse20 .cse24 .cse21 .cse28) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse26 .cse30 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse33 .cse24 .cse21 .cse34 .cse35 .cse36) .cse37) (or .cse0 .cse29 .cse1 (and .cse33 .cse24 .cse21 .cse28 .cse34 .cse36) .cse26 .cse30 .cse25 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse32 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37))))) [2018-12-01 16:41:16,136 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-12-01 16:41:16,137 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse26 (= |old(~t1_pc~0)| 1))) (let ((.cse7 (< 0 ~t2_pc~0)) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse5 (= 0 ~t2_st~0)) (.cse8 (not .cse26)) (.cse9 (< |old(~m_st~0)| 2)) (.cse19 (not .cse33)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse6 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse27 (not (= ~t1_pc~0 1))) (.cse31 (= ~m_st~0 0)) (.cse32 (= ~token~0 |old(~token~0)|)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse35 (<= 2 ~t2_st~0)) (.cse10 (= ~T2_E~0 0)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse36 (not (= 1 ~t2_pc~0))) (.cse14 (= ~T1_E~0 1)) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse15 (not (= ~m_i~0 1))) (.cse16 (= 1 ~E_1~0)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse20 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0)) (.cse24 (= 0 |old(~E_2~0)|)) (.cse25 (= |old(~t1_st~0)| 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse6 .cse7 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse27 .cse2 .cse3 .cse4 .cse5)) (or .cse0 .cse6 .cse7 .cse28 .cse29 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 (and .cse27 .cse31 .cse32 .cse3 .cse4 .cse5) .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse33) (or .cse0 .cse34 .cse6 (and .cse27 .cse2 .cse3 .cse4 .cse35) .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse34 .cse6 .cse28 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse1 .cse2 .cse32 .cse3 .cse4 .cse35) .cse25) (or .cse0 .cse34 .cse6 .cse28 .cse29 (and .cse27 .cse31 .cse32 .cse3 .cse4 .cse35) .cse26 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse30 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse33)))) [2018-12-01 16:41:16,137 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-01 16:41:16,137 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0))) (let ((.cse12 (not (= 0 |old(~m_st~0)|))) (.cse25 (< 0 ~t2_pc~0)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse23 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 |old(~E_2~0)|)) (.cse24 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (= |old(~E_2~0)| ~E_2~0)) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 (and .cse27 .cse28 .cse29 .cse30 (= 0 ~t2_st~0)) .cse2 .cse25 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse27 .cse28 (= ~token~0 |old(~token~0)|) .cse29 .cse30 (<= 2 ~t2_st~0)) .cse21)))) [2018-12-01 16:41:16,137 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-12-01 16:41:16,138 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0))) (let ((.cse17 (not (= ~E_2~0 1))) (.cse18 (not (= ~E_2~0 0))) (.cse12 (< |old(~t2_st~0)| 2)) (.cse3 (< |old(~m_st~0)| 2)) (.cse22 (not (= 1 ~t2_pc~0))) (.cse25 (not .cse36)) (.cse15 (<= 2 ~m_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse29 (< 0 ~t2_pc~0)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse31 (= |old(~t1_pc~0)| 1)) (.cse4 (= ~T2_E~0 0)) (.cse14 (= 1 ~t1_pc~0)) (.cse33 (= ~m_st~0 0)) (.cse16 (<= 2 ~t1_st~0)) (.cse34 (= ~token~0 |old(~token~0)|)) (.cse35 (= |old(~E_2~0)| ~E_2~0)) (.cse19 (= 0 ~t2_st~0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse21 (= 1 ~E_M~0)) (.cse23 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse24 (not (= ~m_i~0 1))) (.cse7 (= 1 ~E_1~0)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse8 (= 1 |old(~E_2~0)|)) (.cse26 (= 0 ~E_1~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse27 (not (= 1 ~t2_i~0))) (.cse28 (= 0 ~E_M~0)) (.cse10 (= 0 |old(~E_2~0)|)) (.cse11 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17 (<= ~token~0 (+ |old(~token~0)| 1)) .cse18 .cse19 (<= (+ ~local~0 1) ~token~0)) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse21 .cse23 .cse24 .cse7 .cse30 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse8 .cse25 .cse26 .cse9 .cse27 .cse28 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse13 .cse31 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse32 .cse24 .cse7 .cse8 (and .cse14 .cse33 .cse16 .cse34 .cse35 .cse20) .cse26 .cse9 .cse27 .cse28 .cse10 .cse11 .cse36) (or .cse0 .cse1 .cse29 .cse31 .cse35 .cse3 .cse4 .cse5 .cse6 .cse21 .cse23 .cse24 .cse7 .cse30 .cse8 .cse25 .cse26 .cse9 .cse27 .cse28 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse31 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse24 .cse7 .cse8 .cse25 .cse26 (and .cse14 .cse15 .cse16 .cse35 .cse20) .cse9 .cse27 .cse28 .cse10 .cse11) (or .cse0 .cse1 .cse29 .cse2 .cse13 .cse31 .cse4 (and .cse14 .cse33 .cse16 .cse34 .cse35 .cse19) .cse5 .cse6 .cse21 .cse23 .cse32 .cse24 .cse7 .cse30 .cse8 .cse26 .cse9 .cse27 .cse28 .cse10 .cse11 .cse36)))) [2018-12-01 16:41:16,138 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0))) (let ((.cse12 (not (= 0 |old(~m_st~0)|))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (not (= ~E_2~0 0))) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse25 (< 0 ~t2_pc~0)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse23 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 |old(~E_2~0)|)) (.cse24 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse25 .cse23 .cse6 (and .cse27 .cse28 .cse29 .cse30 (= 0 ~t2_st~0)) .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 (and .cse27 .cse28 (<= ~token~0 (+ |old(~token~0)| 1)) .cse29 .cse30 (<= 2 ~t2_st~0) (<= (+ ~local~0 1) ~token~0)) .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-12-01 16:41:16,138 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-12-01 16:41:16,138 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-12-01 16:41:16,139 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse25 (= |old(~t1_st~0)| 0)) (.cse37 (= 1 ~m_pc~0)) (.cse36 (= ~t1_pc~0 1)) (.cse45 (+ ~local~0 2)) (.cse39 (= ~m_st~0 0)) (.cse35 (= 0 ~t1_st~0)) (.cse38 (= 0 ~t2_st~0)) (.cse46 (+ ~local~0 1)) (.cse44 (<= 2 ~m_st~0)) (.cse33 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (<= 2 ~t2_st~0))) (let ((.cse27 (and .cse44 .cse33 .cse34)) (.cse11 (< ~token~0 .cse46)) (.cse20 (< .cse46 ~token~0)) (.cse32 (and .cse44 .cse35 .cse38)) (.cse0 (and .cse44 .cse33 .cse38)) (.cse31 (and .cse44 .cse35 .cse34)) (.cse41 (and .cse39 .cse33 .cse34)) (.cse42 (< .cse45 ~token~0)) (.cse3 (not .cse36)) (.cse4 (< |old(~m_st~0)| 2)) (.cse24 (= 1 ~M_E~0)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse16 (not .cse37)) (.cse43 (< ~token~0 .cse45)) (.cse23 (< 0 ~t2_pc~0)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse1 (= ~T1_E~0 0)) (.cse26 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse30 (not .cse25)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (= ~T1_E~0 1)) (.cse40 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25 .cse0) (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse28 .cse29 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse31) (or .cse1 .cse2 .cse23 .cse28 .cse29 .cse32 .cse4 .cse5 .cse6 .cse30 .cse7 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse28 (and .cse33 .cse34) .cse3 .cse29 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25) (or (and .cse35 .cse34) .cse1 .cse26 .cse2 .cse36 .cse5 .cse6 .cse24 .cse30 .cse7 .cse8 .cse10 .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse2 .cse23 (and .cse35 .cse38) .cse36 .cse5 .cse6 .cse24 .cse30 .cse7 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or (and .cse39 .cse33 .cse38) .cse1 .cse2 .cse23 .cse28 .cse3 .cse29 .cse5 .cse6 .cse7 .cse9 .cse10 .cse40 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse2 .cse23 .cse36 .cse4 .cse5 .cse6 .cse30 .cse7 .cse10 .cse12 .cse13 .cse14 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse2 .cse23 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse2 .cse23 .cse28 .cse3 .cse29 .cse5 .cse6 (and .cse33 .cse38) .cse24 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse26 .cse2 .cse36 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse10 .cse31 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse28 .cse41 .cse3 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse40 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse26 .cse2 .cse42 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse40 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse41 .cse43) (or .cse1 .cse2 .cse42 .cse3 .cse4 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse43 (and .cse44 .cse33)) (or .cse1 (and .cse39 .cse35 .cse38) .cse2 .cse23 .cse28 .cse29 .cse36 .cse5 .cse6 .cse30 .cse7 .cse10 .cse40 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse26 .cse2 .cse28 .cse29 .cse36 .cse5 (and .cse39 .cse35 .cse34) .cse6 .cse30 .cse7 .cse8 .cse10 .cse40 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37)))) [2018-12-01 16:41:16,139 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0)) (.cse25 (= |old(~t1_st~0)| 0)) (.cse32 (= ~t1_pc~0 1)) (.cse45 (+ ~local~0 2)) (.cse34 (= 0 ~t1_st~0)) (.cse30 (<= 2 ~t2_st~0)) (.cse42 (<= 2 ~m_st~0)) (.cse29 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse40 (= 0 ~t2_st~0)) (.cse46 (+ ~local~0 1))) (let ((.cse11 (< ~token~0 .cse46)) (.cse20 (< .cse46 ~token~0)) (.cse1 (and .cse42 .cse29 .cse40)) (.cse31 (and .cse42 .cse34 .cse30)) (.cse37 (and .cse42 .cse29 .cse30)) (.cse38 (= ~m_st~0 0)) (.cse41 (< .cse45 ~token~0)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse43 (< ~token~0 .cse45)) (.cse26 (< |old(~t2_st~0)| 2)) (.cse3 (not .cse32)) (.cse24 (= 1 ~M_E~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse35 (= activate_threads_~tmp~1 0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse23 (< 0 ~t2_pc~0)) (.cse44 (and .cse42 .cse34 .cse40)) (.cse27 (< ~local~0 ~token~0)) (.cse28 (< ~token~0 ~local~0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse33 (not .cse25)) (.cse7 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 ~E_2~0)) (.cse16 (not .cse36)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse23 .cse3 .cse1 .cse4 .cse5 .cse6 .cse24 .cse7 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25) (or .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 (and .cse29 .cse30) .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse26 .cse31 .cse2 .cse32 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse26 .cse2 .cse32 .cse5 (and .cse34 .cse35 .cse30) .cse6 .cse24 .cse33 .cse7 .cse8 .cse10 .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or .cse0 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse37 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25) (or .cse0 .cse2 .cse23 .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or (and .cse38 .cse29 .cse35 .cse30) .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse39 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or .cse0 .cse26 .cse2 .cse27 .cse28 (and .cse38 .cse34 .cse35 .cse30) .cse32 .cse5 .cse6 .cse33 .cse7 .cse8 .cse10 .cse39 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or .cse0 (and .cse38 .cse34 .cse35 .cse40) .cse2 .cse23 .cse27 .cse28 .cse32 .cse5 .cse6 .cse33 .cse7 .cse10 .cse39 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or (and .cse38 .cse29 .cse7) .cse0 .cse2 .cse41 .cse3 .cse4 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 (and .cse42 .cse29) .cse43) (or .cse31 .cse0 .cse26 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse37 .cse19 .cse21 .cse22) (or .cse0 .cse44 .cse2 .cse23 .cse32 .cse4 .cse5 .cse6 .cse33 .cse7 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse2 .cse23 .cse32 .cse5 .cse6 (and .cse34 .cse35 .cse40) .cse24 .cse33 .cse7 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or .cse0 .cse2 .cse23 (and .cse38 .cse29 .cse35 .cse40) .cse27 .cse3 .cse28 .cse5 .cse6 .cse7 .cse9 .cse10 .cse39 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or .cse0 .cse26 .cse2 (and .cse38 .cse29 .cse30) .cse41 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse39 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse43) (or (and .cse29 .cse35 .cse40) .cse0 .cse2 .cse23 .cse27 .cse3 .cse28 .cse5 .cse6 .cse24 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36) (or .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse36 .cse35) (or .cse0 .cse2 .cse23 .cse44 .cse27 .cse28 .cse4 .cse5 .cse6 .cse33 .cse7 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22)))) [2018-12-01 16:41:16,139 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-01 16:41:16,140 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-12-01 16:41:16,140 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse25 (= |old(~t1_st~0)| 0)) (.cse37 (= 1 ~m_pc~0)) (.cse36 (= ~t1_pc~0 1)) (.cse45 (+ ~local~0 2)) (.cse39 (= ~m_st~0 0)) (.cse35 (= 0 ~t1_st~0)) (.cse38 (= 0 ~t2_st~0)) (.cse46 (+ ~local~0 1)) (.cse44 (<= 2 ~m_st~0)) (.cse33 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (<= 2 ~t2_st~0))) (let ((.cse27 (and .cse44 .cse33 .cse34)) (.cse11 (< ~token~0 .cse46)) (.cse20 (< .cse46 ~token~0)) (.cse32 (and .cse44 .cse35 .cse38)) (.cse0 (and .cse44 .cse33 .cse38)) (.cse31 (and .cse44 .cse35 .cse34)) (.cse41 (and .cse39 .cse33 .cse34)) (.cse42 (< .cse45 ~token~0)) (.cse3 (not .cse36)) (.cse4 (< |old(~m_st~0)| 2)) (.cse24 (= 1 ~M_E~0)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse16 (not .cse37)) (.cse43 (< ~token~0 .cse45)) (.cse23 (< 0 ~t2_pc~0)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse1 (= ~T1_E~0 0)) (.cse26 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse30 (not .cse25)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (= ~T1_E~0 1)) (.cse40 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25 .cse0) (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse28 .cse29 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse31) (or .cse1 .cse2 .cse23 .cse28 .cse29 .cse32 .cse4 .cse5 .cse6 .cse30 .cse7 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse28 (and .cse33 .cse34) .cse3 .cse29 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25) (or (and .cse35 .cse34) .cse1 .cse26 .cse2 .cse36 .cse5 .cse6 .cse24 .cse30 .cse7 .cse8 .cse10 .cse12 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse2 .cse23 (and .cse35 .cse38) .cse36 .cse5 .cse6 .cse24 .cse30 .cse7 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or (and .cse39 .cse33 .cse38) .cse1 .cse2 .cse23 .cse28 .cse3 .cse29 .cse5 .cse6 .cse7 .cse9 .cse10 .cse40 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse2 .cse23 .cse36 .cse4 .cse5 .cse6 .cse30 .cse7 .cse10 .cse12 .cse13 .cse14 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse2 .cse23 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse2 .cse23 .cse28 .cse3 .cse29 .cse5 .cse6 (and .cse33 .cse38) .cse24 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse26 .cse2 .cse36 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse10 .cse31 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse1 .cse26 .cse2 .cse28 .cse41 .cse3 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse40 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse26 .cse2 .cse42 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse40 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse41 .cse43) (or .cse1 .cse2 .cse42 .cse3 .cse4 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse43 (and .cse44 .cse33)) (or .cse1 (and .cse39 .cse35 .cse38) .cse2 .cse23 .cse28 .cse29 .cse36 .cse5 .cse6 .cse30 .cse7 .cse10 .cse40 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37) (or .cse1 .cse26 .cse2 .cse28 .cse29 .cse36 .cse5 (and .cse39 .cse35 .cse34) .cse6 .cse30 .cse7 .cse8 .cse10 .cse40 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse37)))) [2018-12-01 16:41:16,140 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-12-01 16:41:16,140 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-12-01 16:41:16,140 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-12-01 16:41:16,141 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-12-01 16:41:16,141 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-01 16:41:16,141 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse22 (= 1 ~m_pc~0)) (.cse41 (= |old(~t1_st~0)| 0)) (.cse13 (= 0 ~t1_st~0)) (.cse25 (= 0 ~t2_st~0)) (.cse46 (+ ~local~0 2)) (.cse45 (<= 2 ~m_st~0)) (.cse12 (= activate_threads_~tmp___0~0 0)) (.cse24 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (<= 2 ~t2_st~0)) (.cse47 (+ ~local~0 1))) (let ((.cse39 (< ~token~0 .cse47)) (.cse42 (and .cse45 .cse12 .cse24 .cse15)) (.cse40 (< .cse47 ~token~0)) (.cse34 (< .cse46 ~token~0)) (.cse36 (< ~token~0 .cse46)) (.cse38 (and .cse45 .cse12 .cse24 .cse25)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse23 (= ~m_st~0 0)) (.cse43 (and .cse45 .cse12 .cse13 .cse25)) (.cse26 (< 0 ~t2_pc~0)) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse37 (< |old(~m_st~0)| 2)) (.cse7 (not .cse41)) (.cse32 (= 1 ~E_1~0)) (.cse35 (not .cse22)) (.cse44 (and .cse45 .cse12 .cse13 .cse15)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse14 (= activate_threads_~tmp~1 0)) (.cse27 (< ~local~0 ~token~0)) (.cse28 (not .cse3)) (.cse29 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse30 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse16 (= 1 ~E_2~0)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 (and .cse23 .cse12 .cse24 .cse14 .cse25) .cse2 .cse26 .cse27 .cse28 .cse29 .cse4 .cse5 .cse8 .cse30 .cse10 .cse31 .cse11 .cse32 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 (and .cse23 .cse12 .cse24 .cse15) .cse34 .cse28 .cse4 .cse5 .cse8 .cse9 .cse30 .cse10 .cse31 .cse11 .cse32 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36) (or .cse0 .cse1 .cse2 .cse27 .cse29 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse31 .cse11 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse23 .cse12 .cse13 .cse14 .cse15) .cse22) (or .cse0 .cse2 .cse28 .cse37 .cse4 .cse5 .cse38 .cse8 .cse9 .cse30 .cse10 .cse39 .cse11 .cse32 .cse33 .cse16 .cse35 .cse17 .cse18 .cse19 .cse40 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse27 .cse28 .cse29 (and .cse32 .cse13 .cse15) .cse4 .cse5 .cse6 .cse8 .cse9 .cse30 .cse10 .cse11 .cse16 (and .cse15 .cse12 .cse24) .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse26 .cse28 .cse37 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse32 .cse33 .cse35 .cse38 .cse17 .cse18 .cse19 .cse20 .cse21 .cse41) (or .cse0 .cse1 .cse2 .cse27 .cse28 .cse29 .cse4 .cse5 .cse8 .cse9 .cse30 .cse10 .cse31 .cse11 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse23 .cse12 .cse24 .cse14 .cse15) .cse22) (or .cse0 .cse1 .cse42 .cse2 .cse28 .cse37 .cse4 .cse5 .cse8 .cse9 .cse30 .cse10 .cse11 .cse32 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse26 .cse27 .cse28 .cse29 .cse4 .cse5 .cse6 .cse8 .cse30 .cse10 (and .cse32 .cse13 .cse14 .cse25) .cse11 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse24 (and .cse12 .cse14 .cse25)) .cse22) (or .cse0 .cse2 .cse26 .cse27 .cse29 .cse37 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse32 .cse33 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21 .cse43) (or .cse0 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse12 .cse13 .cse14 .cse25) .cse8 .cse10 .cse11 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse28 .cse37 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse39 .cse11 .cse32 .cse35 .cse42 .cse17 .cse18 .cse19 .cse40 .cse20 .cse21 .cse41) (or .cse0 .cse1 .cse2 .cse27 .cse29 .cse37 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse32 .cse16 .cse35 .cse44 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse34 .cse28 (and .cse24 (and .cse45 .cse12)) .cse37 .cse4 .cse5 .cse6 .cse9 .cse30 .cse10 .cse11 .cse32 (and .cse23 .cse12 .cse24 .cse8) .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36) (or .cse0 .cse2 .cse26 .cse28 .cse37 .cse4 .cse5 .cse8 .cse30 .cse10 .cse11 .cse32 .cse38 .cse33 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse26 .cse27 .cse29 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse31 .cse11 .cse32 (and .cse23 .cse12 .cse13 .cse14 .cse25) .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse43 .cse0 .cse2 .cse26 .cse3 .cse37 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse32 .cse33 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse37 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse32 .cse16 .cse35 .cse44 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse14 .cse27 .cse28 .cse29 .cse4 .cse5 .cse6 .cse8 .cse9 .cse30 .cse10 .cse11 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-12-01 16:41:16,141 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-12-01 16:41:16,142 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse23 (= |old(~t1_st~0)| 0))) (let ((.cse24 (= 0 ~t1_st~0)) (.cse26 (not .cse23)) (.cse29 (< 0 ~t2_pc~0)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse30 (= 0 ~t2_st~0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse16 (= 1 ~E_1~0)) (.cse17 (not .cse28)) (.cse5 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse32 (< ~local~0 ~token~0)) (.cse6 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse7 (<= 2 ~t2_st~0)) (.cse3 (not .cse25)) (.cse33 (< ~token~0 ~local~0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse34 (< |old(~t1_st~0)| 2)) (.cse13 (= ~T1_E~0 1)) (.cse15 (not (= ~m_i~0 1))) (.cse27 (= 1 ~E_2~0)) (.cse18 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~token~0 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse14 ~token~0) .cse21 .cse22 .cse23)) (or (and .cse24 .cse7) .cse0 .cse1 .cse2 .cse25 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse2 .cse29 (and .cse24 .cse30) .cse25 .cse8 .cse9 .cse10 .cse26 .cse11 .cse13 .cse15 .cse31 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse2 .cse29 .cse32 .cse3 .cse33 .cse8 .cse9 (and .cse6 .cse30) .cse10 .cse11 .cse34 .cse13 .cse15 .cse31 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse2 .cse29 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse5 .cse6 .cse30)) (let ((.cse35 (+ ~local~0 2))) (or .cse0 .cse2 (< .cse35 ~token~0) .cse3 .cse4 .cse8 .cse9 .cse10 .cse12 .cse34 .cse13 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse35) (and .cse5 .cse6))) (or .cse0 .cse1 .cse2 .cse32 (and .cse6 .cse7) .cse3 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse13 .cse15 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-12-01 16:41:16,142 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-12-01 16:41:16,142 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse25 (= 1 ~m_pc~0))) (let ((.cse8 (not (= |old(~t1_st~0)| 0))) (.cse4 (< |old(~m_st~0)| 2)) (.cse14 (not .cse25)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse22 (< ~local~0 |old(~token~0)|)) (.cse20 (not .cse3)) (.cse23 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse23 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse22 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse20 (and (<= 2 ~m_st~0) (= |old(~E_M~0)| ~E_M~0) (= 1 ~t2_pc~0) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse9 (not (= 1 |old(~t2_pc~0)|)) .cse21 .cse10 (< |old(~token~0)| .cse26) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse26 |old(~token~0)|) .cse18 .cse19)) (or .cse0 .cse1 .cse2 .cse22 .cse20 .cse23 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse24 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25)))) [2018-12-01 16:41:16,143 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse18 (not (= 0 |old(~m_st~0)|))) (.cse10 (= ~m_st~0 0)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse28 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse37 (<= 2 ~m_st~0)) (.cse11 (= |old(~E_M~0)| ~E_M~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= 2 ~t2_st~0)) (.cse29 (not .cse5)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse31 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse16 (= 1 |old(~E_M~0)|)) (.cse17 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 1 ~E_1~0)) (.cse21 (= 1 ~E_2~0)) (.cse33 (not .cse27)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|)) (.cse26 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or (and .cse10 .cse11 .cse12 .cse13 .cse28 .cse15) .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse6 .cse7 .cse8 .cse16 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (let ((.cse32 (+ ~local~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse35 (not (= ~E_M~0 1)))) (or .cse0 .cse1 .cse29 .cse31 .cse6 .cse7 .cse8 .cse16 (not (= 1 |old(~t2_pc~0)|)) .cse30 .cse17 (< |old(~token~0)| .cse32) .cse19 .cse20 .cse21 .cse33 (let ((.cse36 (+ ~local~0 2))) (and .cse10 .cse34 .cse35 (<= ~token~0 .cse36) .cse12 .cse28 .cse15 (<= .cse36 ~token~0))) .cse22 .cse23 .cse24 (< .cse32 |old(~token~0)|) .cse25 .cse26 (and .cse37 .cse34 .cse35 .cse12 .cse28 .cse15))) (or .cse0 .cse1 .cse2 .cse29 .cse31 .cse6 .cse7 .cse8 .cse16 .cse30 .cse17 (and .cse37 .cse11 .cse12 .cse28 .cse15) .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 (and .cse37 .cse11 .cse12 .cse14 .cse15) .cse1 .cse2 .cse5 .cse31 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 (and .cse37 .cse11 .cse12 .cse13 .cse14 .cse15) .cse29 .cse4 .cse31 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-12-01 16:41:16,143 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-12-01 16:41:16,143 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse27 (= 1 ~m_pc~0))) (let ((.cse4 (< |old(~m_st~0)| 2)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse14 (not .cse27)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse20 (not .cse3)) (.cse25 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 (let ((.cse22 (+ ~local~0 2))) (and (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse22) (= 1 ~t2_pc~0) (= ~t1_st~0 |old(~t1_st~0)|) (<= .cse22 ~token~0))) .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 (not (= 1 |old(~t2_pc~0)|)) .cse21 .cse10 (< |old(~token~0)| .cse23) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse23 |old(~token~0)|) .cse18 .cse19)) (or .cse0 .cse1 .cse2 .cse24 .cse25 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27) (or .cse0 .cse1 .cse2 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse24 .cse20 .cse25 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27)))) [2018-12-01 16:41:16,143 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-01 16:41:16,144 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse3 (= ~t1_pc~0 1))) (let ((.cse26 (not (= 0 |old(~m_st~0)|))) (.cse28 (= ~token~0 |old(~token~0)|)) (.cse23 (= 0 ~t1_st~0)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse25 (< |old(~token~0)| ~local~0)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse21 (<= ~t2_pc~0 0)) (.cse22 (= |old(~E_M~0)| ~E_M~0)) (.cse27 (= ~m_st~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse31 (not .cse3)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse32 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse14 (not .cse30)) (.cse20 (<= 2 ~m_st~0)) (.cse29 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse20 .cse21 .cse22 .cse23)) (or .cse0 .cse1 .cse2 .cse24 .cse25 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse27 .cse21 .cse22 .cse28 .cse29) .cse30) (or .cse0 .cse1 .cse2 .cse24 .cse31 .cse25 .cse5 .cse6 .cse7 .cse9 .cse32 .cse10 .cse26 .cse11 .cse12 .cse13 (and .cse27 .cse29 .cse21 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse22) .cse15 .cse16 .cse17 .cse18 .cse19 .cse30) (or .cse0 (and .cse20 .cse21 .cse22 .cse28 .cse23) .cse1 .cse2 .cse24 .cse31 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse31 .cse4 .cse5 .cse6 .cse7 .cse9 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse20 .cse21 .cse22 .cse29) .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse33 (not (= ~E_M~0 0))) (.cse34 (not (= ~E_M~0 1))) (.cse36 (= 1 ~t2_pc~0)) (.cse37 (+ ~local~0 1))) (or (let ((.cse35 (+ ~local~0 2))) (and .cse27 .cse33 .cse34 (<= ~token~0 .cse35) .cse36 .cse29 (<= .cse35 ~token~0))) .cse0 .cse1 .cse31 .cse4 .cse5 .cse6 .cse7 .cse9 (not (= 1 |old(~t2_pc~0)|)) .cse32 .cse10 (< |old(~token~0)| .cse37) .cse11 .cse12 .cse13 .cse14 (and .cse20 .cse33 .cse34 .cse36 .cse29) .cse15 .cse16 .cse17 (< .cse37 |old(~token~0)|) .cse18 .cse19))))) [2018-12-01 16:41:16,144 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-12-01 16:41:16,144 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse26 (= 1 ~m_pc~0)) (.cse33 (= ~t1_pc~0 1))) (let ((.cse4 (not .cse33)) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse29 (< |old(~m_st~0)| 2)) (.cse31 (not .cse26)) (.cse27 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse5 (< |old(~token~0)| ~local~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= ~t2_pc~0 0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse28 (= 0 ~t1_st~0)) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse14 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 1 ~E_2~0)) (.cse21 (= 0 ~E_1~0)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 |old(~E_M~0)|)) (.cse25 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse27 .cse7 .cse8 .cse9 .cse28) .cse29 .cse11 .cse12 .cse13 .cse30 .cse14 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 (and .cse27 .cse7 .cse8 .cse10) .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse32 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 (and .cse27 .cse8 (= 1 ~t2_pc~0) .cse9 .cse10) .cse29 .cse11 .cse12 .cse13 .cse14 (not (= 1 |old(~t2_pc~0)|)) .cse15 .cse16 (< |old(~token~0)| .cse32) .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 (< .cse32 |old(~token~0)|) .cse24 .cse25)) (or .cse0 .cse1 .cse2 .cse33 .cse29 .cse11 .cse12 .cse13 .cse30 .cse14 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 (and .cse27 .cse7 .cse8 .cse28) .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse28) .cse33 .cse11 .cse12 .cse13 .cse30 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-12-01 16:41:16,144 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-01 16:41:16,144 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-12-01 16:41:16,144 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-12-01 16:41:16,144 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-12-01 16:41:16,144 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-12-01 16:41:16,145 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-12-01 16:41:16,145 INFO L451 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: true [2018-12-01 16:41:16,145 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-12-01 16:41:16,145 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-12-01 16:41:16,145 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse23 (< 0 ~t2_pc~0)) (.cse5 (not .cse24)) (.cse11 (< ~t1_st~0 2)) (.cse27 (not (= 0 ~t2_st~0))) (.cse13 (not (= 0 ~m_st~0))) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (= |old(~T2_E~0)| 1)) (.cse25 (< ~m_st~0 2)) (.cse6 (= |old(~T2_E~0)| 0)) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse26 (not (= ~t1_st~0 0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse12 (= |old(~T1_E~0)| 1)) (.cse0 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse14 (not (= ~m_i~0 1))) (.cse15 (= 1 |old(~E_1~0)|)) (.cse16 (= 1 |old(~E_2~0)|)) (.cse17 (not .cse30)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 |old(~E_M~0)|)) (.cse22 (= 0 |old(~E_2~0)|))) (and (let ((.cse4 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 (< .cse4 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse4))) (or .cse1 .cse3 .cse23 .cse24 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse12 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse28 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse30) (let ((.cse31 (+ ~local~0 1))) (or .cse1 .cse3 .cse5 .cse0 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 .cse31) .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse31 ~token~0) .cse21 .cse22)) (or .cse1 .cse3 .cse23 .cse28 .cse29 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse12 .cse0 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse0) (or .cse1 .cse3 .cse23 .cse5 .cse25 .cse6 .cse7 .cse0 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse3 .cse23 .cse28 .cse29 .cse24 .cse6 .cse7 .cse8 .cse26 .cse9 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse0 .cse1 .cse3 .cse23 .cse28 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse1 .cse2 .cse3 .cse28 .cse29 .cse24 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse1 .cse2 .cse0 .cse3 .cse28 .cse29 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse24 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse0 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-12-01 16:41:16,145 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-12-01 16:41:16,145 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-12-01 16:41:16,145 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-12-01 16:41:16,146 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-12-01 16:41:16,146 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-12-01 16:41:16,146 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-12-01 16:41:16,146 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-12-01 16:41:16,146 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse34 (= 1 ~m_pc~0)) (.cse27 (= ~t1_st~0 0)) (.cse28 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 2)) (.cse36 (+ ~local~0 1))) (let ((.cse32 (< ~token~0 .cse36)) (.cse33 (< .cse36 ~token~0)) (.cse8 (= 1 ~M_E~0)) (.cse29 (< .cse35 ~token~0)) (.cse30 (not (= 0 ~m_st~0))) (.cse31 (< ~token~0 .cse35)) (.cse22 (< 0 ~t2_pc~0)) (.cse25 (not (= 0 ~t2_st~0))) (.cse4 (not .cse28)) (.cse11 (< ~t1_st~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse23 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse24 (not .cse27)) (.cse15 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse16 (= 1 ~E_1~0)) (.cse14 (= 1 ~E_2~0)) (.cse26 (not .cse34)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse22 .cse3 .cse5 .cse23 .cse6 .cse7 .cse24 .cse9 .cse12 .cse13 .cse16 .cse25 .cse14 .cse26 .cse17 .cse15 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse22 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse16 .cse25 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse15) (or .cse0 .cse15 .cse2 .cse22 .cse28 .cse23 .cse6 .cse7 .cse24 .cse9 .cse12 .cse13 .cse16 .cse25 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse11 (or .cse0 .cse2 .cse4 .cse23 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse16 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21) .cse15) (or (not .cse9) .cse0 .cse2 .cse29 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse13 .cse16 .cse14 .cse26 .cse17 .cse18 .cse19 .cse21 .cse15 .cse31) (or .cse0 .cse1 .cse2 .cse15 .cse28 .cse23 .cse6 .cse7 .cse24 .cse9 .cse10 .cse12 .cse13 .cse16 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse32 .cse13 .cse16 .cse26 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21 .cse27) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse16 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse5 .cse28 .cse6 .cse7 .cse24 .cse9 .cse10 .cse12 .cse30 .cse13 .cse16 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34) (or .cse0 .cse2 .cse22 .cse3 .cse5 .cse28 .cse6 .cse7 .cse24 .cse9 .cse12 .cse30 .cse13 .cse16 .cse25 .cse15 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34) (or .cse0 .cse2 .cse4 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse16 .cse25 .cse14 .cse26 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21 .cse15) (or .cse0 .cse1 .cse2 .cse28 .cse6 .cse15 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34) (or .cse0 .cse2 .cse22 .cse3 .cse16 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34) (or .cse0 .cse15 .cse2 .cse22 .cse28 .cse6 .cse7 .cse8 .cse24 .cse9 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34) (or .cse0 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse30 .cse13 .cse16 .cse25 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 .cse34) (or .cse0 .cse1 .cse2 .cse29 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse16 .cse14 .cse26 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31) (or .cse0 .cse2 .cse22 .cse4 .cse23 .cse6 .cse15 .cse7 .cse9 .cse11 .cse12 .cse13 .cse16 .cse25 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse24 .cse15 .cse9 .cse10 .cse12 .cse13 .cse16 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-12-01 16:41:16,148 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-12-01 16:41:16,153 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< 0 ~t2_pc~0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~E_1~0) (not (= 0 |old(~t2_st~0)|)) (= 1 ~E_2~0) (= 0 ~E_1~0) (and (= ~m_st~0 0) (= 0 ~t1_st~0) (= 0 ~t2_st~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0)) [2018-12-01 16:41:16,153 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-12-01 16:41:16,154 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-12-01 16:41:16,154 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,154 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (= ~m_i~0 1) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_i~0 1) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,154 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-01 16:41:16,157 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-12-01 16:41:16,157 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-01 16:41:16,158 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse20 (< 0 ~t2_pc~0)) (.cse26 (< |old(~local~0)| |old(~token~0)|)) (.cse24 (not .cse3)) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse13 (= 1 ~E_2~0)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse23 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (let ((.cse22 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse22) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0) (<= .cse22 ~token~0))) (< .cse23 |old(~token~0)|) .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 (not .cse19) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse23))) (or .cse0 .cse1 .cse2 .cse26 .cse24 .cse27 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 .cse26 .cse24 .cse27 .cse4 .cse5 .cse6 .cse8 .cse25 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-12-01 16:41:16,158 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse11 (= ~T1_E~0 1)) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0))) (let ((.cse26 (= ~t1_pc~0 1)) (.cse36 (<= ~token~0 ~local~0)) (.cse30 (= 0 ~t1_st~0)) (.cse37 (<= ~local~0 ~token~0)) (.cse41 (= 1 ~t1_pc~0)) (.cse42 (not .cse5)) (.cse43 (not .cse2)) (.cse44 (not (= ~M_E~0 0))) (.cse39 (= ~m_i~0 1)) (.cse29 (<= 2 ~m_st~0)) (.cse45 (not (= ~E_2~0 1))) (.cse46 (not (= ~M_E~0 1))) (.cse47 (not (= ~E_M~0 1))) (.cse48 (not .cse11)) (.cse40 (= 1 ~t2_pc~0)) (.cse38 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse31 (not (= ~E_1~0 1))) (.cse35 (<= 2 ~t2_st~0)) (.cse49 (not .cse0)) (.cse33 (= 1 ~m_pc~0)) (.cse34 (not (= ~E_1~0 0)))) (let ((.cse16 (and .cse41 .cse42 .cse43 .cse44 .cse39 .cse29 (<= 2 ~t1_st~0) .cse45 .cse46 .cse47 .cse48 .cse40 .cse38 .cse31 .cse35 .cse49 .cse33 .cse34)) (.cse22 (and .cse41 .cse42 .cse43 .cse44 .cse39 .cse29 (not (= ~E_M~0 0)) .cse45 .cse46 .cse36 (= ~t2_i~0 1) (not (= ~E_2~0 0)) .cse47 .cse48 .cse40 (= ~t1_i~0 1) .cse30 .cse31 .cse35 .cse49 .cse33 .cse34 .cse37)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse9 (not .cse40)) (.cse25 (< 0 ~t2_pc~0)) (.cse23 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse26)) (.cse24 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse12 (not .cse39)) (.cse13 (= 1 |old(~E_1~0)|)) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0)) (.cse15 (= 1 |old(~m_pc~0)|)) (.cse32 (= 0 ~t2_st~0))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< |old(~token~0)| .cse3))) (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse15) (or .cse0 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse27 .cse8 .cse11 .cse12 .cse13 .cse28 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) (or .cse0 .cse1 .cse2 .cse26 .cse5 (and .cse29 .cse30 .cse31 .cse35 .cse33 .cse34) .cse6 .cse7 .cse27 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15) (or .cse0 .cse2 .cse25 .cse23 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (and .cse29 .cse36 .cse30 .cse31 .cse32 .cse33 .cse34 .cse37) .cse28 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 (and .cse29 .cse38 .cse31 .cse32 .cse33 .cse34)))))) [2018-12-01 16:41:16,161 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse20 (< 0 ~t2_pc~0)) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse23 (not .cse3)) (.cse24 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse13 (= 1 ~E_2~0)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse26 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse26 |old(~token~0)|) .cse23 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 (not .cse19) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse26))) (or .cse0 .cse2 .cse20 .cse22 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse25 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-12-01 16:41:16,163 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse20 (<= 2 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse29 (< 0 ~t2_pc~0)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse30)) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 1 ~E_2~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse23 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0)) (.cse28 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse2 .cse29 .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 (and .cse15 .cse16 .cse32 .cse33) .cse12 .cse13 .cse14 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse32 .cse20) .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse36 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (let ((.cse35 (+ ~local~0 2))) (and .cse15 (<= ~token~0 .cse35) .cse18 .cse19 .cse20 (= 1 ~m_pc~0) (<= .cse35 ~token~0))) (< .cse36 |old(~token~0)|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 (not .cse28) .cse23 .cse24 .cse25 .cse26 .cse27 (< |old(~token~0)| .cse36))) (or .cse0 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse34 .cse22 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse21) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)))) [2018-12-01 16:41:16,163 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1))) (let ((.cse1 (< |old(~t2_st~0)| 2)) (.cse21 (<= 2 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse29 (= 0 ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse32 (< 0 ~t2_pc~0)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse30)) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse18 (not (= ~m_pc~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (= 0 ~t2_st~0)) (.cse22 (not (= ~E_1~0 0))) (.cse23 (<= ~local~0 ~token~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 ~E_2~0)) (.cse27 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 .cse27) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse28 |old(~token~0)|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse19 .cse20 .cse21 (= 1 ~m_pc~0) .cse22 .cse23) .cse15 (not .cse27) .cse16 .cse17 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse28))) (or .cse0 .cse1 .cse2 (and .cse18 .cse29 .cse21 .cse22) .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse32 .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse12 .cse13 .cse14 .cse33 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 (and .cse18 .cse29 .cse34 .cse22) .cse27) (or .cse0 .cse2 .cse32 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse33 .cse15 .cse16 (and .cse18 .cse19 .cse20 .cse34 .cse22 .cse23) .cse17 .cse24 .cse25 .cse26 .cse27)))) [2018-12-01 16:41:16,165 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-12-01 16:41:16,165 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-01 16:41:16,165 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse20 (<= 2 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse29 (< 0 ~t2_pc~0)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse30)) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 1 ~E_2~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse23 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0)) (.cse28 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse2 .cse29 .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 (and .cse15 .cse16 .cse32 .cse33) .cse12 .cse13 .cse14 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse32 .cse20) .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse36 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (let ((.cse35 (+ ~local~0 2))) (and .cse15 (<= ~token~0 .cse35) .cse18 .cse19 .cse20 (= 1 ~m_pc~0) (<= .cse35 ~token~0))) (< .cse36 |old(~token~0)|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 (not .cse28) .cse23 .cse24 .cse25 .cse26 .cse27 (< |old(~token~0)| .cse36))) (or .cse0 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse34 .cse22 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse21) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)))) [2018-12-01 16:41:16,167 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-12-01 16:41:16,167 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse29 (= 1 ~m_pc~0)) (.cse31 (= ~t1_pc~0 1))) (let ((.cse23 (< ~t2_st~0 2)) (.cse24 (< ~local~0 ~token~0)) (.cse2 (not .cse31)) (.cse25 (< ~token~0 ~local~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (< ~t1_st~0 2)) (.cse28 (not (= 0 ~m_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse27 (< 0 ~t2_pc~0)) (.cse4 (< ~m_st~0 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 |old(~M_E~0)|)) (.cse26 (not (= ~t1_st~0 0))) (.cse8 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse15 (not (= 0 ~t2_st~0))) (.cse16 (= 1 ~E_2~0)) (.cse17 (not .cse29)) (.cse18 (= 0 ~E_1~0)) (.cse3 (= |old(~M_E~0)| ~M_E~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse12 ~token~0) .cse21 .cse22)) (or .cse0 .cse23 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse3) (or .cse0 .cse23 .cse3 .cse1 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse3 .cse0 .cse1 .cse27 .cse24 .cse2 .cse25 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29) (let ((.cse30 (+ ~local~0 2))) (or .cse3 .cse0 .cse23 .cse1 (< .cse30 ~token~0) .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse30))) (or .cse0 .cse1 .cse27 .cse24 .cse25 .cse31 .cse5 .cse6 .cse7 .cse26 .cse8 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse18 .cse3 .cse19 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse1 .cse27 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse11 .cse3 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse31 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse11 .cse3 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse24 .cse25 .cse31 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse11 .cse28 .cse13 .cse14 .cse3 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse23 .cse1 .cse24 .cse2 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse13 .cse14 .cse16 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse1 .cse27 .cse31 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 .cse20 .cse21 .cse22)))) [2018-12-01 16:41:16,169 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-12-01 16:41:16,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-01 16:41:16,169 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= ~t1_st~0 |old(~t1_st~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0)) [2018-12-01 16:41:16,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 16:41:16,169 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-12-01 16:41:16,169 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-12-01 16:41:16,169 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-01 16:41:16,170 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-12-01 16:41:16,170 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-12-01 16:41:16,170 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-12-01 16:41:16,170 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-12-01 16:41:16,171 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0))) (let ((.cse32 (= 1 |old(~m_pc~0)|)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse44 (not (= ~E_2~0 1))) (.cse51 (not (= ~E_2~0 0))) (.cse49 (not (= ~E_1~0 1))) (.cse53 (= ~token~0 |old(~token~0)|)) (.cse54 (<= ~token~0 ~local~0)) (.cse46 (= 1 ~t1_pc~0)) (.cse57 (not (= ~M_E~0 0))) (.cse45 (<= 2 ~t1_st~0)) (.cse36 (<= ~t2_pc~0 0)) (.cse58 (not (= ~M_E~0 1))) (.cse41 (= 0 ~t2_st~0)) (.cse55 (<= ~local~0 ~token~0)) (.cse34 (not (= ~t1_pc~0 1))) (.cse35 (= |old(~E_1~0)| ~E_1~0)) (.cse56 (not .cse5)) (.cse48 (not .cse1)) (.cse37 (not (= ~m_pc~0 1))) (.cse38 (= |old(~E_M~0)| ~E_M~0)) (.cse47 (= 1 ~t2_pc~0)) (.cse39 (= |old(~E_2~0)| ~E_2~0)) (.cse40 (= 0 ~t1_st~0)) (.cse43 (<= 2 ~t2_st~0)) (.cse50 (not .cse0))) (let ((.cse27 (and .cse34 .cse35 .cse56 .cse48 .cse37 .cse38 .cse47 .cse39 .cse40 .cse43 .cse50)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse26 (< |old(~local~0)| |old(~token~0)|)) (.cse33 (and .cse53 .cse54 (and .cse46 .cse35 .cse56 .cse48 .cse57 .cse45 .cse36 .cse37 .cse58 .cse38 .cse39 .cse41 .cse50) .cse55)) (.cse29 (< |old(~token~0)| |old(~local~0)|)) (.cse30 (and .cse53 .cse54 .cse55 (and .cse46 .cse35 .cse56 .cse48 .cse57 .cse45 .cse37 .cse44 .cse58 .cse38 .cse51 .cse47 (= ~t1_i~0 1) .cse39 .cse49 .cse43 .cse50))) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse21 (let ((.cse52 (+ ~local~0 2))) (and (and .cse43 .cse44 .cse45 (and .cse46 .cse47 .cse48 (not (= ~E_M~0 0)) .cse49 .cse50 (= 1 ~m_pc~0) (not (= ~E_1~0 0)) .cse51 (not (= ~E_M~0 1)))) (<= .cse52 ~token~0) (<= ~token~0 .cse52)))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse22 (< |old(~t1_st~0)| 2)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse14 (= 1 |old(~E_2~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse20 (= 0 |old(~E_2~0)|)) (.cse28 (< |old(~t2_st~0)| 2)) (.cse24 (not .cse3)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse25 (not (= 1 |old(~t2_pc~0)|))) (.cse10 (= ~T1_E~0 1)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse15 (not .cse32)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse21 .cse4 .cse5 .cse6 .cse7 .cse22 (< |old(~token~0)| .cse23) .cse12 .cse14 .cse17 .cse20 .cse24 .cse9 .cse25 .cse10 .cse11 .cse13 .cse15 .cse16 .cse18 (< .cse23 |old(~token~0)|) .cse19)) (or .cse0 .cse1 .cse26 .cse21 .cse5 .cse27 .cse6 .cse7 .cse8 .cse12 .cse14 .cse17 .cse20 .cse28 .cse29 .cse30 .cse3 .cse9 .cse25 .cse10 .cse31 .cse11 .cse16 .cse18 .cse19 .cse32) (or .cse0 .cse28 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse25 .cse22 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse28 .cse1 .cse26 .cse29 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse26 .cse21 .cse5 .cse6 .cse7 .cse22 .cse12 .cse14 .cse17 .cse20 .cse28 .cse24 .cse29 .cse30 .cse9 .cse25 .cse10 .cse31 .cse11 .cse16 .cse18 .cse19 .cse32) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse5 .cse27 .cse6 .cse7 .cse8 .cse33 .cse12 .cse14 .cse17 .cse20 .cse29 .cse30 .cse3 .cse9 .cse10 .cse31 .cse11 .cse13 .cse16 .cse18 .cse19 .cse32 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)) (or .cse0 .cse28 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse26 .cse29 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse5 .cse6 .cse7 .cse33 .cse22 .cse12 .cse14 .cse17 .cse20 .cse24 .cse29 .cse30 .cse9 .cse10 .cse31 .cse11 .cse13 .cse16 .cse18 .cse19 .cse32) (or .cse0 .cse1 .cse2 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse42 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse7 .cse22 .cse12 .cse14 .cse17 .cse20 .cse28 (< .cse42 |old(~token~0)|) .cse24 .cse9 .cse25 .cse10 .cse31 .cse11 .cse15 .cse16 .cse18 .cse19 (< |old(~token~0)| .cse42))))))) [2018-12-01 16:41:16,171 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-12-01 16:41:16,173 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-12-01 16:41:16,173 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-12-01 16:41:16,173 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse34 (= ~T1_E~0 1))) (let ((.cse49 (= 1 |old(~m_pc~0)|)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse14 (<= ~t2_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse70 (= ~m_i~0 1)) (.cse44 (<= 2 ~m_st~0)) (.cse73 (not (= ~E_M~0 0))) (.cse66 (not .cse34)) (.cse46 (= 1 ~m_pc~0)) (.cse47 (not (= ~E_1~0 0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse68 (not .cse6)) (.cse69 (not .cse3)) (.cse71 (not (= ~M_E~0 0))) (.cse63 (not (= ~E_2~0 1))) (.cse75 (not (= ~M_E~0 1))) (.cse64 (not (= ~E_2~0 0))) (.cse76 (not (= ~E_M~0 1))) (.cse72 (= ~t1_i~0 1)) (.cse61 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse45 (not (= ~E_1~0 1))) (.cse74 (not .cse1)) (.cse38 (= 1 ~t1_pc~0)) (.cse12 (= |old(~E_1~0)| ~E_1~0)) (.cse13 (= ~m_st~0 0)) (.cse39 (<= 2 ~t1_st~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= |old(~E_M~0)| ~E_M~0)) (.cse67 (= 1 ~t2_pc~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= |old(~E_2~0)| ~E_2~0)) (.cse65 (<= 2 ~t2_st~0)) (.cse22 (<= ~local~0 ~token~0))) (let ((.cse0 (and .cse38 .cse12 .cse13 .cse39 .cse15 .cse16 .cse17 .cse67 .cse18 .cse19 .cse65 .cse22)) (.cse33 (and .cse11 .cse12 .cse68 .cse13 .cse69 .cse71 .cse15 .cse63 .cse75 .cse16 .cse17 .cse64 .cse76 .cse67 .cse18 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse22)) (.cse48 (and .cse11 .cse68 .cse69 .cse70 .cse44 .cse71 .cse73 .cse63 .cse75 (= ~t2_i~0 1) .cse17 .cse64 .cse76 .cse66 .cse67 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse46 .cse47)) (.cse60 (and .cse38 .cse12 .cse68 .cse69 .cse44 .cse17 .cse67 .cse19 .cse61 .cse65 .cse74 .cse46)) (.cse2 (and .cse38 .cse69 .cse44 .cse39 .cse14 .cse63 .cse17 .cse64 .cse45 .cse21 .cse74 .cse46 .cse47)) (.cse51 (and .cse38 .cse12 .cse68 .cse13 .cse69 .cse71 .cse39 .cse15 .cse63 .cse75 .cse16 .cse17 .cse64 .cse67 .cse18 .cse72 .cse19 .cse61 .cse45 .cse65 .cse74 .cse22)) (.cse27 (and (and .cse38 .cse68 .cse69 .cse71 .cse72 .cse20 .cse45 .cse21 .cse63 .cse74 .cse75 .cse46 .cse47 .cse17 .cse64) .cse16 .cse44 .cse14 .cse22)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse50 (< |old(~t1_st~0)| 2)) (.cse4 (< 0 |old(~t2_pc~0)|)) (.cse55 (and .cse38 .cse12 .cse69 .cse44 .cse39 .cse17 .cse67 .cse19 .cse65 .cse74 .cse46)) (.cse58 (and .cse11 .cse12 .cse68 .cse69 .cse70 .cse44 .cse71 .cse63 .cse75 .cse17 .cse76 .cse66 .cse67 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse46 .cse47)) (.cse37 (not (= 0 |old(~t2_st~0)|))) (.cse5 (< |old(~local~0)| |old(~token~0)|)) (.cse56 (< |old(~m_st~0)| 2)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse10 (let ((.cse78 (+ ~local~0 1))) (and .cse63 (<= ~token~0 .cse78) (<= .cse78 ~token~0) .cse44 .cse39 (and .cse38 .cse67 .cse68 .cse69 .cse71 .cse73 .cse21 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76) .cse45))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse24 (= 1 |old(~E_2~0)|)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (= 0 |old(~E_2~0)|)) (.cse52 (< |old(~t2_st~0)| 2)) (.cse53 (not .cse29)) (.cse28 (< |old(~token~0)| |old(~local~0)|)) (.cse30 (let ((.cse77 (+ ~local~0 2))) (and .cse38 .cse68 .cse13 .cse69 .cse71 .cse73 .cse39 .cse63 .cse75 .cse64 .cse76 (<= ~token~0 .cse77) .cse67 .cse72 .cse45 .cse65 .cse74 .cse46 .cse47 (<= .cse77 ~token~0)))) (.cse31 (and .cse38 .cse67 .cse68 .cse69 .cse44 .cse71 .cse72 .cse73 .cse39 .cse45 .cse65 .cse63 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76)) (.cse32 (= 1 |old(~E_M~0)|)) (.cse54 (not (= 1 |old(~t2_pc~0)|))) (.cse36 (not .cse70)) (.cse57 (not .cse49)) (.cse40 (and .cse65 (and .cse38 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse20 .cse45 .cse63 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76) .cse16 .cse44 .cse22)) (.cse41 (= 0 |old(~E_1~0)|)) (.cse42 (not (= 1 ~t2_i~0))) (.cse43 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (and .cse38 .cse12 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) .cse40 .cse41 .cse42 .cse43 (and .cse11 .cse44 .cse14 .cse17 .cse19 .cse20 .cse45 .cse21 .cse46 .cse47) .cse48 .cse49) (or .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse51 .cse52 .cse53 .cse28 .cse30 .cse31 .cse32 .cse54 .cse34 .cse35 .cse36 .cse40 .cse41 .cse42 .cse43 .cse49) (or .cse1 .cse52 .cse3 .cse29 .cse55 .cse56 .cse6 .cse7 .cse8 .cse9 .cse32 .cse54 .cse34 .cse36 .cse23 .cse24 .cse57 .cse41 .cse25 .cse58 .cse42 .cse43 .cse26) (let ((.cse59 (+ |old(~local~0)| 2))) (or .cse1 .cse3 .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse52 (< .cse59 |old(~token~0)|) .cse53 .cse30 .cse31 .cse32 .cse54 .cse34 .cse35 .cse36 .cse57 .cse40 .cse41 .cse42 .cse43 (< |old(~token~0)| .cse59))) (or .cse1 .cse52 .cse3 .cse53 .cse56 .cse6 .cse60 .cse7 .cse8 .cse32 .cse54 .cse50 .cse34 .cse36 .cse23 .cse24 .cse57 .cse41 .cse25 .cse42 .cse43 .cse26) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26 .cse52 .cse28 .cse29 .cse30 .cse31 .cse32 .cse54 .cse33 .cse34 .cse35 .cse36 .cse40 .cse41 .cse42 .cse43 .cse48 .cse49) (or .cse1 .cse3 .cse4 .cse53 .cse56 .cse6 .cse60 .cse7 .cse8 .cse32 .cse50 .cse34 (and .cse38 .cse12 .cse44 .cse14 .cse17 .cse19 .cse61 .cse21 .cse46) .cse36 .cse23 .cse37 .cse24 .cse57 .cse41 .cse25 .cse42 .cse43 .cse26) (or .cse1 .cse3 .cse4 .cse2 .cse5 (and .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse61 .cse21 .cse22) .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse51 .cse27 .cse53 .cse28 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse40 .cse41 .cse42 .cse43 .cse49) (let ((.cse62 (+ |old(~local~0)| 1))) (or .cse1 .cse3 .cse56 .cse6 .cse7 .cse8 .cse10 .cse50 (< |old(~token~0)| .cse62) .cse23 .cse24 .cse25 .cse26 .cse53 .cse30 .cse31 .cse32 .cse54 .cse34 .cse36 .cse37 .cse57 .cse40 .cse41 .cse42 (< .cse62 |old(~token~0)|) .cse43)) (or .cse1 .cse3 .cse4 .cse5 .cse56 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 (and .cse38 .cse12 .cse44 .cse39 .cse14 .cse63 .cse17 .cse64 .cse21 .cse46) .cse26 (and (and .cse38 .cse12 .cse21 .cse63 .cse46 .cse17 .cse64) .cse18 .cse16 .cse44 .cse61 .cse14 .cse22) .cse53 .cse28 .cse30 .cse31 .cse32 .cse34 .cse36 .cse37 .cse57 .cse40 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse4 .cse55 .cse56 .cse6 .cse7 .cse8 .cse9 (and .cse38 .cse12 .cse44 .cse39 .cse14 .cse17 .cse19 .cse21 .cse46) .cse23 .cse24 .cse25 (and .cse11 .cse12 .cse44 .cse14 .cse17 .cse19 .cse20 .cse21 .cse46) .cse58 .cse26 .cse29 .cse32 .cse34 .cse36 .cse37 .cse57 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse5 .cse56 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26 .cse52 .cse53 .cse28 .cse30 .cse31 .cse32 .cse54 .cse34 .cse36 .cse57 .cse40 .cse41 .cse42 .cse43))))) [2018-12-01 16:41:16,174 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-12-01 16:41:16,176 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-12-01 16:41:16,176 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse34 (= ~T1_E~0 1))) (let ((.cse49 (= 1 |old(~m_pc~0)|)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse14 (<= ~t2_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse70 (= ~m_i~0 1)) (.cse44 (<= 2 ~m_st~0)) (.cse73 (not (= ~E_M~0 0))) (.cse66 (not .cse34)) (.cse46 (= 1 ~m_pc~0)) (.cse47 (not (= ~E_1~0 0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse68 (not .cse6)) (.cse69 (not .cse3)) (.cse71 (not (= ~M_E~0 0))) (.cse63 (not (= ~E_2~0 1))) (.cse75 (not (= ~M_E~0 1))) (.cse64 (not (= ~E_2~0 0))) (.cse76 (not (= ~E_M~0 1))) (.cse72 (= ~t1_i~0 1)) (.cse61 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse45 (not (= ~E_1~0 1))) (.cse74 (not .cse1)) (.cse38 (= 1 ~t1_pc~0)) (.cse12 (= |old(~E_1~0)| ~E_1~0)) (.cse13 (= ~m_st~0 0)) (.cse39 (<= 2 ~t1_st~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= |old(~E_M~0)| ~E_M~0)) (.cse67 (= 1 ~t2_pc~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= |old(~E_2~0)| ~E_2~0)) (.cse65 (<= 2 ~t2_st~0)) (.cse22 (<= ~local~0 ~token~0))) (let ((.cse0 (and .cse38 .cse12 .cse13 .cse39 .cse15 .cse16 .cse17 .cse67 .cse18 .cse19 .cse65 .cse22)) (.cse33 (and .cse11 .cse12 .cse68 .cse13 .cse69 .cse71 .cse15 .cse63 .cse75 .cse16 .cse17 .cse64 .cse76 .cse67 .cse18 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse22)) (.cse48 (and .cse11 .cse68 .cse69 .cse70 .cse44 .cse71 .cse73 .cse63 .cse75 (= ~t2_i~0 1) .cse17 .cse64 .cse76 .cse66 .cse67 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse46 .cse47)) (.cse60 (and .cse38 .cse12 .cse68 .cse69 .cse44 .cse17 .cse67 .cse19 .cse61 .cse65 .cse74 .cse46)) (.cse2 (and .cse38 .cse69 .cse44 .cse39 .cse14 .cse63 .cse17 .cse64 .cse45 .cse21 .cse74 .cse46 .cse47)) (.cse51 (and .cse38 .cse12 .cse68 .cse13 .cse69 .cse71 .cse39 .cse15 .cse63 .cse75 .cse16 .cse17 .cse64 .cse67 .cse18 .cse72 .cse19 .cse61 .cse45 .cse65 .cse74 .cse22)) (.cse27 (and (and .cse38 .cse68 .cse69 .cse71 .cse72 .cse20 .cse45 .cse21 .cse63 .cse74 .cse75 .cse46 .cse47 .cse17 .cse64) .cse16 .cse44 .cse14 .cse22)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse50 (< |old(~t1_st~0)| 2)) (.cse4 (< 0 |old(~t2_pc~0)|)) (.cse55 (and .cse38 .cse12 .cse69 .cse44 .cse39 .cse17 .cse67 .cse19 .cse65 .cse74 .cse46)) (.cse58 (and .cse11 .cse12 .cse68 .cse69 .cse70 .cse44 .cse71 .cse63 .cse75 .cse17 .cse76 .cse66 .cse67 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse46 .cse47)) (.cse37 (not (= 0 |old(~t2_st~0)|))) (.cse5 (< |old(~local~0)| |old(~token~0)|)) (.cse56 (< |old(~m_st~0)| 2)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse10 (let ((.cse78 (+ ~local~0 1))) (and .cse63 (<= ~token~0 .cse78) (<= .cse78 ~token~0) .cse44 .cse39 (and .cse38 .cse67 .cse68 .cse69 .cse71 .cse73 .cse21 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76) .cse45))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse24 (= 1 |old(~E_2~0)|)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (= 0 |old(~E_2~0)|)) (.cse52 (< |old(~t2_st~0)| 2)) (.cse53 (not .cse29)) (.cse28 (< |old(~token~0)| |old(~local~0)|)) (.cse30 (let ((.cse77 (+ ~local~0 2))) (and .cse38 .cse68 .cse13 .cse69 .cse71 .cse73 .cse39 .cse63 .cse75 .cse64 .cse76 (<= ~token~0 .cse77) .cse67 .cse72 .cse45 .cse65 .cse74 .cse46 .cse47 (<= .cse77 ~token~0)))) (.cse31 (and .cse38 .cse67 .cse68 .cse69 .cse44 .cse71 .cse72 .cse73 .cse39 .cse45 .cse65 .cse63 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76)) (.cse32 (= 1 |old(~E_M~0)|)) (.cse54 (not (= 1 |old(~t2_pc~0)|))) (.cse36 (not .cse70)) (.cse57 (not .cse49)) (.cse40 (and .cse65 (and .cse38 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse20 .cse45 .cse63 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76) .cse16 .cse44 .cse22)) (.cse41 (= 0 |old(~E_1~0)|)) (.cse42 (not (= 1 ~t2_i~0))) (.cse43 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (and .cse38 .cse12 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) .cse40 .cse41 .cse42 .cse43 (and .cse11 .cse44 .cse14 .cse17 .cse19 .cse20 .cse45 .cse21 .cse46 .cse47) .cse48 .cse49) (or .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse51 .cse52 .cse53 .cse28 .cse30 .cse31 .cse32 .cse54 .cse34 .cse35 .cse36 .cse40 .cse41 .cse42 .cse43 .cse49) (or .cse1 .cse52 .cse3 .cse29 .cse55 .cse56 .cse6 .cse7 .cse8 .cse9 .cse32 .cse54 .cse34 .cse36 .cse23 .cse24 .cse57 .cse41 .cse25 .cse58 .cse42 .cse43 .cse26) (let ((.cse59 (+ |old(~local~0)| 2))) (or .cse1 .cse3 .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse52 (< .cse59 |old(~token~0)|) .cse53 .cse30 .cse31 .cse32 .cse54 .cse34 .cse35 .cse36 .cse57 .cse40 .cse41 .cse42 .cse43 (< |old(~token~0)| .cse59))) (or .cse1 .cse52 .cse3 .cse53 .cse56 .cse6 .cse60 .cse7 .cse8 .cse32 .cse54 .cse50 .cse34 .cse36 .cse23 .cse24 .cse57 .cse41 .cse25 .cse42 .cse43 .cse26) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26 .cse52 .cse28 .cse29 .cse30 .cse31 .cse32 .cse54 .cse33 .cse34 .cse35 .cse36 .cse40 .cse41 .cse42 .cse43 .cse48 .cse49) (or .cse1 .cse3 .cse4 .cse53 .cse56 .cse6 .cse60 .cse7 .cse8 .cse32 .cse50 .cse34 (and .cse38 .cse12 .cse44 .cse14 .cse17 .cse19 .cse61 .cse21 .cse46) .cse36 .cse23 .cse37 .cse24 .cse57 .cse41 .cse25 .cse42 .cse43 .cse26) (or .cse1 .cse3 .cse4 .cse2 .cse5 (and .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse61 .cse21 .cse22) .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse51 .cse27 .cse53 .cse28 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse40 .cse41 .cse42 .cse43 .cse49) (let ((.cse62 (+ |old(~local~0)| 1))) (or .cse1 .cse3 .cse56 .cse6 .cse7 .cse8 .cse10 .cse50 (< |old(~token~0)| .cse62) .cse23 .cse24 .cse25 .cse26 .cse53 .cse30 .cse31 .cse32 .cse54 .cse34 .cse36 .cse37 .cse57 .cse40 .cse41 .cse42 (< .cse62 |old(~token~0)|) .cse43)) (or .cse1 .cse3 .cse4 .cse5 .cse56 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 (and .cse38 .cse12 .cse44 .cse39 .cse14 .cse63 .cse17 .cse64 .cse21 .cse46) .cse26 (and (and .cse38 .cse12 .cse21 .cse63 .cse46 .cse17 .cse64) .cse18 .cse16 .cse44 .cse61 .cse14 .cse22) .cse53 .cse28 .cse30 .cse31 .cse32 .cse34 .cse36 .cse37 .cse57 .cse40 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse4 .cse55 .cse56 .cse6 .cse7 .cse8 .cse9 (and .cse38 .cse12 .cse44 .cse39 .cse14 .cse17 .cse19 .cse21 .cse46) .cse23 .cse24 .cse25 (and .cse11 .cse12 .cse44 .cse14 .cse17 .cse19 .cse20 .cse21 .cse46) .cse58 .cse26 .cse29 .cse32 .cse34 .cse36 .cse37 .cse57 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse5 .cse56 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26 .cse52 .cse53 .cse28 .cse30 .cse31 .cse32 .cse54 .cse34 .cse36 .cse57 .cse40 .cse41 .cse42 .cse43))))) [2018-12-01 16:41:16,180 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse18 (= ~T1_E~0 1))) (let ((.cse25 (= 1 |old(~m_pc~0)|)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse49 (= 1 ~t1_pc~0)) (.cse35 (= 0 ~t2_st~0)) (.cse30 (<= ~t2_pc~0 0)) (.cse60 (= ~m_i~0 1)) (.cse29 (<= 2 ~m_st~0)) (.cse65 (not (= ~E_M~0 1))) (.cse56 (not .cse18)) (.cse36 (= 1 ~m_pc~0)) (.cse37 (not (= ~E_1~0 0))) (.cse38 (not (= ~t1_pc~0 1))) (.cse39 (= |old(~E_1~0)| ~E_1~0)) (.cse58 (not .cse3)) (.cse40 (= ~m_st~0 0)) (.cse59 (not .cse1)) (.cse61 (not (= ~M_E~0 0))) (.cse41 (not (= ~m_pc~0 1))) (.cse50 (not (= ~E_2~0 1))) (.cse64 (not (= ~M_E~0 1))) (.cse42 (<= ~token~0 ~local~0)) (.cse31 (= |old(~E_M~0)| ~E_M~0)) (.cse51 (not (= ~E_2~0 0))) (.cse32 (not (= ~t1_st~0 0))) (.cse57 (= 1 ~t2_pc~0)) (.cse43 (= ~token~0 |old(~token~0)|)) (.cse62 (= ~t1_i~0 1)) (.cse33 (= |old(~E_2~0)| ~E_2~0)) (.cse34 (not (= ~E_1~0 1))) (.cse55 (<= 2 ~t2_st~0)) (.cse63 (not .cse0)) (.cse44 (<= ~local~0 ~token~0))) (let ((.cse12 (and .cse38 .cse39 .cse58 .cse40 .cse59 .cse61 .cse41 .cse50 .cse64 .cse42 .cse31 .cse51 .cse32 .cse57 .cse43 .cse62 .cse33 .cse34 .cse55 .cse63 .cse44)) (.cse21 (and .cse38 .cse58 .cse59 .cse60 .cse29 .cse61 .cse50 .cse64 .cse31 .cse51 .cse65 .cse32 .cse56 .cse57 .cse62 .cse33 .cse34 .cse55 .cse63 .cse36 .cse37)) (.cse46 (and .cse29 (and .cse49 .cse56 .cse58 .cse59 .cse60 .cse61 .cse62 .cse34 .cse35 .cse50 .cse63 .cse64 .cse36 .cse37 .cse31 .cse51 .cse65) .cse30 .cse32)) (.cse52 (and .cse38 .cse39 .cse29 .cse31 .cse32 .cse57 .cse33 .cse55 .cse63 .cse36)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse14 (< |old(~token~0)| |old(~local~0)|)) (.cse28 (< 0 |old(~t2_pc~0)|)) (.cse47 (< |old(~m_st~0)| 2)) (.cse45 (not (= 0 |old(~t2_st~0)|))) (.cse13 (< |old(~t2_st~0)| 2)) (.cse26 (not .cse15)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse16 (= 1 |old(~E_M~0)|)) (.cse17 (not (= 1 |old(~t2_pc~0)|))) (.cse27 (< |old(~t1_st~0)| 2)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse20 (not .cse60)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse48 (not .cse25)) (.cse22 (= 0 |old(~E_1~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 |old(~E_M~0)|)) (.cse11 (= 0 |old(~E_2~0)|)) (.cse10 (and .cse42 .cse44 (and .cse55 (and .cse49 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 (not (= ~E_M~0 0)) .cse34 .cse50 .cse63 .cse64 .cse36 .cse37 (= ~t2_i~0 1) .cse51 .cse65) .cse29 .cse32)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse13 .cse1 .cse2 .cse26 .cse14 .cse3 .cse4 .cse5 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse24 .cse11 .cse25) (or .cse0 .cse1 .cse28 .cse2 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10 (and .cse38 .cse39 .cse40 .cse30 .cse41 .cse42 .cse31 .cse32 .cse43 .cse33 .cse35 .cse44) .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse45 .cse46 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse28 .cse2 .cse47 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse14 .cse16 .cse18 .cse20 .cse45 .cse48 (and .cse29 .cse30 (and .cse49 .cse39 .cse35 .cse50 .cse36 .cse31 .cse51) .cse32) .cse22 .cse23 .cse24) (or .cse0 .cse13 .cse52 .cse1 .cse15 .cse47 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse18 .cse20 .cse7 .cse8 .cse48 .cse22 .cse9 .cse23 .cse24 .cse11) (or .cse0 .cse13 .cse1 .cse26 .cse47 .cse3 .cse4 .cse5 .cse16 .cse17 .cse27 .cse18 .cse20 .cse7 .cse8 .cse48 .cse22 .cse9 .cse23 .cse24 .cse11) (let ((.cse53 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse26 .cse47 .cse3 .cse4 .cse5 .cse16 .cse17 .cse27 .cse18 (< |old(~token~0)| .cse53) .cse20 .cse7 .cse45 .cse8 .cse48 .cse22 .cse9 .cse23 (< .cse53 |old(~token~0)|) .cse24 .cse11 .cse10)) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse11 .cse10 .cse26 .cse14 .cse16 .cse18 .cse19 .cse20 .cse45 .cse46 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse52 .cse1 .cse28 (and .cse38 .cse39 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36) .cse15 .cse47 .cse3 .cse4 .cse5 .cse6 .cse16 .cse18 .cse20 .cse7 .cse45 .cse8 .cse48 .cse22 .cse9 .cse23 .cse24 .cse11) (or .cse0 .cse1 .cse2 .cse47 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse26 .cse14 .cse16 .cse17 .cse18 .cse20 .cse48 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse28 .cse26 .cse47 .cse3 .cse4 .cse5 .cse16 .cse27 .cse18 .cse20 .cse7 .cse45 .cse8 .cse48 .cse22 .cse9 .cse23 .cse24 .cse11) (let ((.cse54 (+ |old(~local~0)| 2))) (or .cse0 .cse13 .cse1 (< .cse54 |old(~token~0)|) .cse26 .cse3 .cse4 .cse5 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse7 .cse8 .cse48 .cse22 .cse9 .cse23 .cse24 .cse11 .cse10 (< |old(~token~0)| .cse54))))))) [2018-12-01 16:41:16,183 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse50 (= 1 |old(~m_pc~0)|)) (.cse33 (= |old(~t1_pc~0)| 1))) (let ((.cse36 (not (= ~t1_pc~0 1))) (.cse2 (= ~m_st~0 0)) (.cse46 (<= ~t2_pc~0 0)) (.cse47 (not (= ~m_pc~0 1))) (.cse8 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse40 (= 0 ~t2_st~0)) (.cse43 (< 0 |old(~t2_pc~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse23 (not (= 0 |old(~m_st~0)|))) (.cse42 (not (= 0 |old(~t2_st~0)|))) (.cse11 (= ~T1_E~0 0)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse0 (= 1 ~t1_pc~0)) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse37 (<= 2 ~m_st~0)) (.cse48 (<= ~token~0 ~local~0)) (.cse3 (= |old(~E_M~0)| ~E_M~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (= ~token~0 |old(~token~0)|)) (.cse7 (= |old(~E_2~0)| ~E_2~0)) (.cse38 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse10 (= 1 ~m_pc~0)) (.cse49 (<= ~local~0 ~token~0)) (.cse13 (= ~T2_E~0 1)) (.cse44 (< |old(~local~0)| |old(~token~0)|)) (.cse15 (not .cse33)) (.cse45 (< |old(~token~0)| |old(~local~0)|)) (.cse34 (< |old(~m_st~0)| 2)) (.cse16 (= ~T2_E~0 0)) (.cse17 (= 0 ~M_E~0)) (.cse18 (= 1 ~M_E~0)) (.cse35 (not (= |old(~t1_st~0)| 0))) (.cse19 (= 1 |old(~E_M~0)|)) (.cse20 (not (= 1 |old(~t2_pc~0)|))) (.cse22 (= ~T1_E~0 1)) (.cse24 (not (= ~m_i~0 1))) (.cse25 (= 1 |old(~E_1~0)|)) (.cse26 (= 1 |old(~E_2~0)|)) (.cse27 (not .cse50)) (.cse28 (= 0 |old(~E_1~0)|)) (.cse29 (not (= 1 ~t1_i~0))) (.cse30 (not (= 1 ~t2_i~0))) (.cse31 (= 0 |old(~E_M~0)|)) (.cse32 (= 0 |old(~E_2~0)|))) (and (let ((.cse14 (+ |old(~local~0)| 2))) (or (let ((.cse4 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse4 ~token~0))) .cse11 .cse12 .cse13 (< .cse14 |old(~token~0)|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (< |old(~token~0)| .cse14))) (or .cse11 .cse12 .cse13 .cse33 .cse34 .cse16 .cse17 .cse18 .cse35 .cse19 .cse20 .cse22 (and .cse36 .cse1 .cse37 .cse3 .cse5 .cse7 .cse38 .cse9 .cse10) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (or .cse11 .cse12 .cse13 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (and .cse0 .cse1 .cse37 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10)) (let ((.cse41 (+ |old(~local~0)| 1))) (or .cse11 .cse13 .cse15 (let ((.cse39 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse39) .cse1 .cse37 .cse3 .cse5 .cse6 .cse7 .cse8 .cse40 (<= .cse39 ~token~0) .cse10)) .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< |old(~token~0)| .cse41) .cse24 .cse25 .cse42 .cse26 .cse27 .cse28 .cse29 .cse30 (< .cse41 |old(~token~0)|) .cse31 .cse32)) (or .cse11 .cse13 .cse43 .cse44 .cse45 .cse33 .cse16 .cse17 .cse18 .cse35 .cse19 .cse22 .cse23 .cse24 .cse25 .cse42 .cse26 .cse28 (and .cse36 .cse1 .cse2 .cse46 .cse47 .cse48 .cse3 .cse6 .cse7 .cse38 .cse40 .cse49) .cse29 .cse30 .cse31 .cse32 .cse50) (or .cse11 .cse12 .cse13 .cse44 .cse45 .cse33 .cse16 .cse17 .cse18 .cse35 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 (and .cse36 .cse1 .cse2 .cse47 .cse48 .cse3 .cse5 .cse6 .cse7 .cse38 .cse9 .cse49) .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse50) (or .cse11 .cse13 .cse43 .cse44 .cse15 .cse45 .cse34 .cse16 .cse17 .cse18 .cse35 .cse19 .cse22 (and .cse0 .cse1 .cse37 .cse46 .cse48 .cse3 .cse6 .cse7 .cse38 .cse40 .cse10 .cse49) .cse24 .cse25 .cse42 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (or .cse11 .cse13 .cse43 .cse15 .cse34 .cse16 .cse17 (and .cse0 .cse1 .cse37 .cse46 .cse3 .cse7 .cse8 .cse40 .cse10) .cse18 .cse19 .cse21 .cse22 .cse24 .cse25 .cse42 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (or .cse11 .cse12 .cse13 .cse44 .cse15 .cse45 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 (and .cse0 .cse1 .cse2 .cse47 .cse48 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse49) .cse30 .cse31 .cse32 .cse50) (or .cse11 .cse13 .cse43 .cse33 .cse34 .cse16 .cse17 .cse18 .cse35 .cse19 .cse22 .cse24 .cse25 .cse42 .cse26 .cse27 .cse28 (and .cse36 .cse1 .cse37 .cse46 .cse3 .cse7 .cse38 .cse40 .cse10) .cse29 .cse30 .cse31 .cse32) (or (and .cse0 .cse1 .cse2 .cse46 .cse47 .cse48 .cse3 .cse6 .cse7 .cse8 .cse40 .cse49) .cse11 .cse13 .cse43 .cse44 .cse15 .cse45 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse42 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse50) (or .cse11 .cse12 (and .cse0 .cse1 .cse37 .cse48 .cse3 .cse5 .cse6 .cse7 .cse38 .cse9 .cse10 .cse49) .cse13 .cse44 .cse15 .cse45 .cse34 .cse16 .cse17 .cse18 .cse35 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)))) [2018-12-01 16:41:16,185 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-12-01 16:41:16,189 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-12-01 16:41:16,189 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= ~T2_E~0 0))) (let ((.cse44 (= |old(~t1_pc~0)| 1)) (.cse50 (= 1 |old(~m_pc~0)|)) (.cse18 (= ~T1_E~0 1)) (.cse56 (not .cse13)) (.cse54 (= ~m_i~0 1)) (.cse58 (not (= ~M_E~0 0))) (.cse59 (= ~t1_i~0 1)) (.cse30 (<= 2 ~t1_st~0)) (.cse61 (not (= ~M_E~0 1))) (.cse62 (not (= ~E_M~0 1))) (.cse4 (= 1 ~t1_pc~0)) (.cse57 (not .cse1)) (.cse43 (= 0 ~t1_st~0)) (.cse52 (not (= ~E_1~0 1))) (.cse31 (not (= ~E_2~0 1))) (.cse60 (not .cse0)) (.cse11 (= 1 ~m_pc~0)) (.cse53 (not (= ~E_1~0 0))) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse32 (not (= ~E_2~0 0))) (.cse35 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (<= ~t2_pc~0 0)) (.cse36 (<= ~local~0 ~token~0))) (let ((.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse45 (and (and .cse4 .cse57 .cse43 .cse52 .cse31 .cse60 .cse11 .cse53 .cse8 .cse32) .cse35 .cse6 .cse7 .cse36)) (.cse5 (= |old(~E_1~0)| ~E_1~0)) (.cse46 (= ~m_st~0 0)) (.cse47 (not (= ~m_pc~0 1))) (.cse34 (= ~token~0 |old(~token~0)|)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse42 (not (= ~t1_pc~0 1))) (.cse9 (= |old(~E_2~0)| ~E_2~0)) (.cse49 (and .cse4 (not .cse18) .cse56 .cse57 .cse54 .cse6 .cse58 .cse59 .cse30 .cse7 .cse52 .cse31 .cse60 .cse61 .cse11 .cse53 .cse8 .cse32 .cse62)) (.cse12 (< |old(~m_st~0)| 2)) (.cse23 (not .cse50)) (.cse3 (not .cse44)) (.cse17 (< |old(~t1_st~0)| 2)) (.cse41 (< |old(~t2_st~0)| 2)) (.cse29 (< |old(~local~0)| |old(~token~0)|)) (.cse37 (< |old(~token~0)| |old(~local~0)|)) (.cse38 (let ((.cse55 (+ ~local~0 1))) (and .cse31 (<= ~token~0 .cse55) (= 1 ~t2_pc~0) (<= .cse55 ~token~0) .cse6 (and .cse4 .cse56 .cse57 .cse58 .cse59 (not (= ~E_M~0 0)) .cse60 .cse61 .cse11 .cse53 .cse32 .cse62) .cse30 .cse52))) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse33 (not (= |old(~t1_st~0)| 0))) (.cse16 (= 1 |old(~E_M~0)|)) (.cse40 (not (= 1 |old(~t2_pc~0)|))) (.cse48 (not (= 0 |old(~m_st~0)|))) (.cse19 (not .cse54)) (.cse20 (= 1 |old(~E_1~0)|)) (.cse22 (= 1 |old(~E_2~0)|)) (.cse24 (= 0 |old(~E_1~0)|)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 |old(~E_M~0)|)) (.cse28 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse29 (and .cse4 .cse5 .cse6 .cse30 .cse7 .cse31 .cse8 .cse32 .cse11) .cse12 .cse13 .cse14 .cse15 .cse33 .cse20 .cse22 .cse25 .cse28 (and (and .cse4 .cse5 .cse31 .cse11 .cse8 .cse32) .cse34 .cse35 .cse6 .cse10 .cse7 .cse36) .cse3 .cse37 .cse38 .cse16 .cse18 .cse19 .cse21 .cse23 .cse24 .cse26 .cse27) (let ((.cse39 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 .cse17 (< |old(~token~0)| .cse39) .cse20 .cse22 .cse25 .cse28 .cse3 .cse38 .cse16 .cse40 .cse18 .cse19 .cse21 .cse23 .cse24 .cse26 (< .cse39 |old(~token~0)|) .cse27)) (or .cse0 .cse1 .cse29 .cse12 .cse13 .cse14 .cse15 .cse33 .cse20 .cse22 .cse25 .cse28 .cse41 .cse37 .cse38 .cse16 .cse40 .cse18 .cse19 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse41 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 (and .cse42 .cse5 .cse6 .cse7 .cse8 .cse9 .cse43 .cse11) (and .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse9 .cse11) .cse44 .cse12 .cse13 .cse14 .cse15 .cse33 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse29 .cse45 .cse13 .cse14 .cse15 .cse17 .cse20 .cse22 .cse25 .cse28 (and .cse4 .cse5 .cse46 .cse7 .cse47 .cse35 .cse8 .cse34 .cse9 .cse10 .cse36) .cse3 .cse37 .cse38 .cse16 .cse18 .cse48 .cse19 .cse21 .cse49 .cse24 .cse26 .cse27 .cse50) (let ((.cse51 (+ |old(~local~0)| 2))) (or .cse0 .cse41 .cse1 (< .cse51 |old(~token~0)|) .cse3 .cse38 .cse13 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18 .cse48 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (< |old(~token~0)| .cse51))) (or .cse0 (and .cse42 .cse5 .cse46 .cse7 .cse47 .cse35 .cse8 .cse34 .cse9 .cse43 .cse36) .cse1 .cse2 .cse29 .cse45 .cse13 .cse14 .cse15 .cse33 .cse20 .cse22 .cse25 .cse28 (and .cse4 .cse5 .cse46 .cse30 .cse7 .cse47 .cse35 .cse8 .cse34 .cse9 .cse36) .cse37 .cse38 .cse44 .cse16 .cse18 .cse48 .cse19 .cse21 (and .cse42 .cse6 .cse7 .cse8 .cse9 .cse43 .cse52 .cse11 .cse53) .cse49 .cse24 .cse26 .cse27 .cse50) (or .cse0 .cse41 .cse1 .cse44 .cse12 .cse13 .cse14 .cse15 .cse33 .cse16 .cse40 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse41 .cse1 .cse29 .cse3 .cse37 .cse38 .cse13 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18 .cse48 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse50) (or .cse0 .cse41 .cse1 .cse29 .cse37 .cse38 .cse44 .cse13 .cse14 .cse15 .cse33 .cse16 .cse40 .cse18 .cse48 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse50))))) [2018-12-01 16:41:16,193 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-12-01 16:41:16,195 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-12-01 16:41:16,195 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse34 (= ~T1_E~0 1))) (let ((.cse49 (= 1 |old(~m_pc~0)|)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse14 (<= ~t2_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse70 (= ~m_i~0 1)) (.cse44 (<= 2 ~m_st~0)) (.cse73 (not (= ~E_M~0 0))) (.cse66 (not .cse34)) (.cse46 (= 1 ~m_pc~0)) (.cse47 (not (= ~E_1~0 0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse68 (not .cse6)) (.cse69 (not .cse3)) (.cse71 (not (= ~M_E~0 0))) (.cse63 (not (= ~E_2~0 1))) (.cse75 (not (= ~M_E~0 1))) (.cse64 (not (= ~E_2~0 0))) (.cse76 (not (= ~E_M~0 1))) (.cse72 (= ~t1_i~0 1)) (.cse61 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse45 (not (= ~E_1~0 1))) (.cse74 (not .cse1)) (.cse38 (= 1 ~t1_pc~0)) (.cse12 (= |old(~E_1~0)| ~E_1~0)) (.cse13 (= ~m_st~0 0)) (.cse39 (<= 2 ~t1_st~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= |old(~E_M~0)| ~E_M~0)) (.cse67 (= 1 ~t2_pc~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= |old(~E_2~0)| ~E_2~0)) (.cse65 (<= 2 ~t2_st~0)) (.cse22 (<= ~local~0 ~token~0))) (let ((.cse0 (and .cse38 .cse12 .cse13 .cse39 .cse15 .cse16 .cse17 .cse67 .cse18 .cse19 .cse65 .cse22)) (.cse33 (and .cse11 .cse12 .cse68 .cse13 .cse69 .cse71 .cse15 .cse63 .cse75 .cse16 .cse17 .cse64 .cse76 .cse67 .cse18 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse22)) (.cse48 (and .cse11 .cse68 .cse69 .cse70 .cse44 .cse71 .cse73 .cse63 .cse75 (= ~t2_i~0 1) .cse17 .cse64 .cse76 .cse66 .cse67 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse46 .cse47)) (.cse60 (and .cse38 .cse12 .cse68 .cse69 .cse44 .cse17 .cse67 .cse19 .cse61 .cse65 .cse74 .cse46)) (.cse2 (and .cse38 .cse69 .cse44 .cse39 .cse14 .cse63 .cse17 .cse64 .cse45 .cse21 .cse74 .cse46 .cse47)) (.cse51 (and .cse38 .cse12 .cse68 .cse13 .cse69 .cse71 .cse39 .cse15 .cse63 .cse75 .cse16 .cse17 .cse64 .cse67 .cse18 .cse72 .cse19 .cse61 .cse45 .cse65 .cse74 .cse22)) (.cse27 (and (and .cse38 .cse68 .cse69 .cse71 .cse72 .cse20 .cse45 .cse21 .cse63 .cse74 .cse75 .cse46 .cse47 .cse17 .cse64) .cse16 .cse44 .cse14 .cse22)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse50 (< |old(~t1_st~0)| 2)) (.cse4 (< 0 |old(~t2_pc~0)|)) (.cse55 (and .cse38 .cse12 .cse69 .cse44 .cse39 .cse17 .cse67 .cse19 .cse65 .cse74 .cse46)) (.cse58 (and .cse11 .cse12 .cse68 .cse69 .cse70 .cse44 .cse71 .cse63 .cse75 .cse17 .cse76 .cse66 .cse67 .cse72 .cse19 .cse61 .cse20 .cse45 .cse65 .cse74 .cse46 .cse47)) (.cse37 (not (= 0 |old(~t2_st~0)|))) (.cse5 (< |old(~local~0)| |old(~token~0)|)) (.cse56 (< |old(~m_st~0)| 2)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse10 (let ((.cse78 (+ ~local~0 1))) (and .cse63 (<= ~token~0 .cse78) (<= .cse78 ~token~0) .cse44 .cse39 (and .cse38 .cse67 .cse68 .cse69 .cse71 .cse73 .cse21 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76) .cse45))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse24 (= 1 |old(~E_2~0)|)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (= 0 |old(~E_2~0)|)) (.cse52 (< |old(~t2_st~0)| 2)) (.cse53 (not .cse29)) (.cse28 (< |old(~token~0)| |old(~local~0)|)) (.cse30 (let ((.cse77 (+ ~local~0 2))) (and .cse38 .cse68 .cse13 .cse69 .cse71 .cse73 .cse39 .cse63 .cse75 .cse64 .cse76 (<= ~token~0 .cse77) .cse67 .cse72 .cse45 .cse65 .cse74 .cse46 .cse47 (<= .cse77 ~token~0)))) (.cse31 (and .cse38 .cse67 .cse68 .cse69 .cse44 .cse71 .cse72 .cse73 .cse39 .cse45 .cse65 .cse63 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76)) (.cse32 (= 1 |old(~E_M~0)|)) (.cse54 (not (= 1 |old(~t2_pc~0)|))) (.cse36 (not .cse70)) (.cse57 (not .cse49)) (.cse40 (and .cse65 (and .cse38 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse20 .cse45 .cse63 .cse74 .cse75 .cse46 .cse47 .cse64 .cse76) .cse16 .cse44 .cse22)) (.cse41 (= 0 |old(~E_1~0)|)) (.cse42 (not (= 1 ~t2_i~0))) (.cse43 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (and .cse38 .cse12 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) .cse40 .cse41 .cse42 .cse43 (and .cse11 .cse44 .cse14 .cse17 .cse19 .cse20 .cse45 .cse21 .cse46 .cse47) .cse48 .cse49) (or .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse51 .cse52 .cse53 .cse28 .cse30 .cse31 .cse32 .cse54 .cse34 .cse35 .cse36 .cse40 .cse41 .cse42 .cse43 .cse49) (or .cse1 .cse52 .cse3 .cse29 .cse55 .cse56 .cse6 .cse7 .cse8 .cse9 .cse32 .cse54 .cse34 .cse36 .cse23 .cse24 .cse57 .cse41 .cse25 .cse58 .cse42 .cse43 .cse26) (let ((.cse59 (+ |old(~local~0)| 2))) (or .cse1 .cse3 .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse52 (< .cse59 |old(~token~0)|) .cse53 .cse30 .cse31 .cse32 .cse54 .cse34 .cse35 .cse36 .cse57 .cse40 .cse41 .cse42 .cse43 (< |old(~token~0)| .cse59))) (or .cse1 .cse52 .cse3 .cse53 .cse56 .cse6 .cse60 .cse7 .cse8 .cse32 .cse54 .cse50 .cse34 .cse36 .cse23 .cse24 .cse57 .cse41 .cse25 .cse42 .cse43 .cse26) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26 .cse52 .cse28 .cse29 .cse30 .cse31 .cse32 .cse54 .cse33 .cse34 .cse35 .cse36 .cse40 .cse41 .cse42 .cse43 .cse48 .cse49) (or .cse1 .cse3 .cse4 .cse53 .cse56 .cse6 .cse60 .cse7 .cse8 .cse32 .cse50 .cse34 (and .cse38 .cse12 .cse44 .cse14 .cse17 .cse19 .cse61 .cse21 .cse46) .cse36 .cse23 .cse37 .cse24 .cse57 .cse41 .cse25 .cse42 .cse43 .cse26) (or .cse1 .cse3 .cse4 .cse2 .cse5 (and .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse61 .cse21 .cse22) .cse6 .cse7 .cse8 .cse10 .cse50 .cse23 .cse24 .cse25 .cse26 .cse51 .cse27 .cse53 .cse28 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse40 .cse41 .cse42 .cse43 .cse49) (let ((.cse62 (+ |old(~local~0)| 1))) (or .cse1 .cse3 .cse56 .cse6 .cse7 .cse8 .cse10 .cse50 (< |old(~token~0)| .cse62) .cse23 .cse24 .cse25 .cse26 .cse53 .cse30 .cse31 .cse32 .cse54 .cse34 .cse36 .cse37 .cse57 .cse40 .cse41 .cse42 (< .cse62 |old(~token~0)|) .cse43)) (or .cse1 .cse3 .cse4 .cse5 .cse56 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 (and .cse38 .cse12 .cse44 .cse39 .cse14 .cse63 .cse17 .cse64 .cse21 .cse46) .cse26 (and (and .cse38 .cse12 .cse21 .cse63 .cse46 .cse17 .cse64) .cse18 .cse16 .cse44 .cse61 .cse14 .cse22) .cse53 .cse28 .cse30 .cse31 .cse32 .cse34 .cse36 .cse37 .cse57 .cse40 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse4 .cse55 .cse56 .cse6 .cse7 .cse8 .cse9 (and .cse38 .cse12 .cse44 .cse39 .cse14 .cse17 .cse19 .cse21 .cse46) .cse23 .cse24 .cse25 (and .cse11 .cse12 .cse44 .cse14 .cse17 .cse19 .cse20 .cse21 .cse46) .cse58 .cse26 .cse29 .cse32 .cse34 .cse36 .cse37 .cse57 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse5 .cse56 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26 .cse52 .cse53 .cse28 .cse30 .cse31 .cse32 .cse54 .cse34 .cse36 .cse57 .cse40 .cse41 .cse42 .cse43))))) [2018-12-01 16:41:16,197 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-12-01 16:41:16,199 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-12-01 16:41:16,199 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse35 (= ~t1_st~0 0)) (.cse13 (= 1 ~E_1~0)) (.cse36 (+ ~local~0 2)) (.cse37 (+ ~local~0 1))) (let ((.cse31 (< ~token~0 .cse37)) (.cse32 (< .cse37 ~token~0)) (.cse33 (< .cse36 ~token~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse34 (< ~token~0 .cse36)) (.cse3 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse24 (not .cse13)) (.cse25 (< ~t2_st~0 2)) (.cse27 (not (= 1 ~t2_pc~0))) (.cse23 (= 1 ~M_E~0)) (.cse8 (not .cse35)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 ~t2_pc~0)) (.cse26 (not .cse5)) (.cse29 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse28 (< ~t1_st~0 2)) (.cse10 (= ~T1_E~0 1)) (.cse18 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse12 (not (= ~m_i~0 1))) (.cse14 (not (= 0 ~t2_st~0))) (.cse15 (= 1 ~E_2~0)) (.cse30 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse24 .cse12 .cse14 .cse15 .cse18 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse26 .cse4 .cse6 .cse7 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse18 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse18 .cse29 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse26 .cse29 .cse6 .cse7 .cse18 .cse9 .cse27 .cse28 .cse10 .cse31 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse32 .cse20 .cse21) (or .cse28 (or .cse0 .cse1 .cse26 .cse29 .cse6 .cse7 .cse23 .cse27 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21) .cse18) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse18 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21) (or (not .cse9) .cse0 .cse1 .cse33 .cse26 .cse6 .cse7 .cse23 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse21 .cse18 .cse34) (or .cse28 .cse18 .cse25 .cse15 (or .cse0 .cse1 .cse26 .cse6 .cse7 .cse23 .cse9 .cse27 .cse10 .cse12 .cse16 .cse17 .cse19 .cse20 .cse21)) (or .cse0 .cse25 .cse1 .cse26 .cse29 .cse6 .cse7 .cse15 .cse23 .cse9 .cse27 .cse10 .cse31 .cse12 .cse13 .cse30 .cse16 .cse17 .cse19 .cse32 .cse20 .cse21 .cse35 .cse18) (or .cse18 .cse0 .cse25 .cse1 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse26 .cse4 .cse6 .cse7 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse27 .cse18 .cse10 .cse12 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse18 .cse25 .cse1 .cse33 .cse26 .cse6 .cse7 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21 .cse34) (or .cse0 .cse25 .cse1 .cse3 .cse26 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 .cse27 .cse10 .cse24 .cse18 .cse12 .cse15 .cse17 .cse19 .cse20 .cse21) (or .cse18 .cse0 .cse25 .cse1 .cse26 .cse29 .cse6 .cse7 .cse9 .cse27 .cse28 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse28 .cse18 .cse15 .cse2 (or .cse0 .cse1 .cse26 .cse6 .cse7 .cse23 .cse9 .cse10 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22)) (or .cse0 .cse1 .cse2 .cse26 .cse18 .cse29 .cse6 .cse7 .cse23 .cse9 .cse10 .cse12 .cse13 .cse14 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse2 .cse18 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse26 .cse29 .cse6 .cse7 .cse9 .cse28 .cse10 .cse18 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21)))) [2018-12-01 16:41:16,200 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-12-01 16:41:16,203 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-12-01 16:41:16,203 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-12-01 16:41:16,203 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-12-01 16:41:16,204 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse23 (< 0 ~t2_pc~0)) (.cse5 (not .cse24)) (.cse11 (< ~t1_st~0 2)) (.cse27 (not (= 0 ~t2_st~0))) (.cse13 (not (= 0 ~m_st~0))) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (= |old(~T2_E~0)| 1)) (.cse25 (< ~m_st~0 2)) (.cse6 (= |old(~T2_E~0)| 0)) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse26 (not (= ~t1_st~0 0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse12 (= |old(~T1_E~0)| 1)) (.cse0 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse14 (not (= ~m_i~0 1))) (.cse15 (= 1 |old(~E_1~0)|)) (.cse16 (= 1 |old(~E_2~0)|)) (.cse17 (not .cse30)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 |old(~E_M~0)|)) (.cse22 (= 0 |old(~E_2~0)|))) (and (let ((.cse4 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 (< .cse4 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse4))) (or .cse1 .cse3 .cse23 .cse24 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse12 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse28 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse30) (let ((.cse31 (+ ~local~0 1))) (or .cse1 .cse3 .cse5 .cse0 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 .cse31) .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse31 ~token~0) .cse21 .cse22)) (or .cse1 .cse3 .cse23 .cse28 .cse29 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse12 .cse0 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse0) (or .cse1 .cse3 .cse23 .cse5 .cse25 .cse6 .cse7 .cse0 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse3 .cse23 .cse28 .cse29 .cse24 .cse6 .cse7 .cse8 .cse26 .cse9 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse0 .cse1 .cse3 .cse23 .cse28 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse1 .cse2 .cse3 .cse28 .cse29 .cse24 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse1 .cse2 .cse0 .cse3 .cse28 .cse29 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse24 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse0 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-12-01 16:41:16,204 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-12-01 16:41:16,204 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-12-01 16:41:16,204 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-12-01 16:41:16,205 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-12-01 16:41:16,205 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-12-01 16:41:16,205 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-12-01 16:41:16,205 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-12-01 16:41:16,205 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,205 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,206 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-12-01 16:41:16,207 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,207 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse21 (= |old(~E_1~0)| ~E_1~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse14 (= ~m_st~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse22 (not (= ~m_pc~0 1))) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse15 (<= 2 ~t1_st~0)) (.cse1 (not (= ~E_2~0 1))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse9 (not (= ~E_M~0 1))) (.cse23 (not (= ~t1_pc~0 1))) (.cse12 (<= 2 ~m_st~0)) (.cse24 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= 0 ~t1_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse17 (= 0 ~t2_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse18 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) .cse11 .cse12 .cse13) (let ((.cse16 (+ ~local~0 2))) (and .cse0 (and .cse1 (and .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) .cse15 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (and (and .cse2 .cse4 .cse10 .cse17 .cse5 .cse1 .cse6 .cse7 .cse8 .cse18) .cse11 .cse12 .cse19 .cse13) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse0 .cse20 (and .cse1 .cse21 (and .cse5 .cse2 .cse3 .cse6 .cse8 .cse22 .cse9)) .cse14 .cse11 .cse15 .cse13) (and (and .cse2 .cse21 .cse14 .cse22 .cse17 .cse5 .cse1 .cse6 .cse8 .cse18) .cse20 .cse11 .cse15 .cse19 .cse13) (and .cse23 .cse21 .cse20 .cse14 .cse24 .cse4 .cse19 .cse22 .cse17 .cse5 .cse6 .cse11 .cse13 .cse8 .cse18) (and .cse12 .cse15 .cse19 (and .cse2 .cse10 .cse17 .cse5 .cse1 .cse6 .cse7 .cse8 .cse18)) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse12 .cse24 (and .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (<= .cse25 ~token~0) .cse12 .cse15 (and .cse1 (and .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10))) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (and .cse0 .cse3 .cse21 .cse20 .cse14 .cse11 (and .cse5 .cse23 .cse6 .cse4 .cse8 .cse22 .cse9) .cse24 .cse13) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and .cse0 .cse12 .cse15 (and .cse1 .cse10 (and .cse5 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9))) (and .cse23 .cse12 .cse24 .cse4 .cse19 .cse10 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18) (= 1 |old(~m_pc~0)|))) [2018-12-01 16:41:16,209 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-12-01 16:41:16,209 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,210 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-01 16:41:16,211 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,212 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (not (= ~M_E~0 0)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,212 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,214 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-01 16:41:16,214 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-12-01 16:41:16,214 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-12-01 16:41:16,214 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,214 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,214 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-01 16:41:16,216 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,216 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse21 (= |old(~E_1~0)| ~E_1~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse14 (= ~m_st~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse22 (not (= ~m_pc~0 1))) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse15 (<= 2 ~t1_st~0)) (.cse1 (not (= ~E_2~0 1))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse9 (not (= ~E_M~0 1))) (.cse23 (not (= ~t1_pc~0 1))) (.cse12 (<= 2 ~m_st~0)) (.cse24 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= 0 ~t1_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse17 (= 0 ~t2_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse18 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) .cse11 .cse12 .cse13) (let ((.cse16 (+ ~local~0 2))) (and .cse0 (and .cse1 (and .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) .cse15 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (and (and .cse2 .cse4 .cse10 .cse17 .cse5 .cse1 .cse6 .cse7 .cse8 .cse18) .cse11 .cse12 .cse19 .cse13) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse0 .cse20 (and .cse1 .cse21 (and .cse5 .cse2 .cse3 .cse6 .cse8 .cse22 .cse9)) .cse14 .cse11 .cse15 .cse13) (and (and .cse2 .cse21 .cse14 .cse22 .cse17 .cse5 .cse1 .cse6 .cse8 .cse18) .cse20 .cse11 .cse15 .cse19 .cse13) (and .cse23 .cse21 .cse20 .cse14 .cse24 .cse4 .cse19 .cse22 .cse17 .cse5 .cse6 .cse11 .cse13 .cse8 .cse18) (and .cse12 .cse15 .cse19 (and .cse2 .cse10 .cse17 .cse5 .cse1 .cse6 .cse7 .cse8 .cse18)) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse12 .cse24 (and .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (<= .cse25 ~token~0) .cse12 .cse15 (and .cse1 (and .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10))) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (and .cse0 .cse3 .cse21 .cse20 .cse14 .cse11 (and .cse5 .cse23 .cse6 .cse4 .cse8 .cse22 .cse9) .cse24 .cse13) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and .cse0 .cse12 .cse15 (and .cse1 .cse10 (and .cse5 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9))) (and .cse23 .cse12 .cse24 .cse4 .cse19 .cse10 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18) (= 1 |old(~m_pc~0)|))) [2018-12-01 16:41:16,217 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,218 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,220 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,221 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,223 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-12-01 16:41:16,223 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse19 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_1~0 1))) (.cse11 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (not (= ~M_E~0 1))) (.cse18 (= 1 ~m_pc~0)) (.cse26 (= ~m_i~0 1)) (.cse6 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (not (= ~E_M~0 1)))) (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t2_pc~0 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (and .cse19 .cse17 (and .cse11 (not (= ~T1_E~0 1)) (and .cse20 .cse23 .cse5 .cse18 .cse26 .cse6 (= ~t1_i~0 1) (= ~t2_i~0 1)) .cse12 (not (= ~T2_E~0 1)) .cse24))) (.cse21 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 0 |old(~M_E~0)|) (and .cse11 .cse12 .cse16 .cse2 .cse10 .cse17 (and .cse3 .cse5 .cse18 .cse6 .cse7 .cse9) .cse15) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (and .cse11 .cse19 (and .cse20 .cse4 .cse5 .cse6 .cse8 .cse9) .cse0 .cse12 .cse15) .cse1 .cse13 .cse21 .cse10 .cse14) (and .cse22 .cse13 .cse16 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse7) .cse12 .cse24) .cse17) .cse14) (and .cse22 (and .cse11 .cse12 (and .cse3 .cse23 .cse5 .cse18 .cse6 .cse7) .cse24) .cse16 .cse2 .cse17) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (let ((.cse25 (+ ~local~0 1))) (and (<= ~token~0 .cse25) (and .cse19 (and .cse11 .cse12 (and .cse20 .cse23 .cse5 .cse18 .cse6 .cse9) .cse24) .cse17) (<= .cse25 ~token~0) .cse16 .cse21)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse22 (and .cse19 (and .cse11 (and .cse20 .cse23 .cse4 .cse5 .cse6 .cse8) .cse12 .cse24) .cse0) .cse1 .cse13 .cse21 .cse14) (not .cse26) (not (= 0 |old(~t2_st~0)|)) (and .cse13 .cse16 .cse10 (and .cse11 .cse19 .cse12 (and .cse20 .cse5 .cse18 .cse6 .cse7 .cse9) .cse17 .cse15) .cse14) (and .cse22 .cse0 .cse1 .cse13 .cse2 (and .cse11 (and .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8) .cse12 .cse24) .cse14) (let ((.cse28 (+ ~local~0 2))) (and .cse22 .cse4 .cse27 .cse21 (<= .cse28 ~token~0) (<= ~token~0 .cse28))) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse11 .cse19 .cse12 .cse17 (and .cse20 .cse5 .cse18 .cse6 .cse9) .cse15) .cse16 .cse21 .cse10) (= 1 |old(~m_pc~0)|) (and .cse22 .cse16 .cse27 .cse21)))) [2018-12-01 16:41:16,224 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-01 16:41:16,225 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-12-01 16:41:16,225 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-12-01 16:41:16,225 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-12-01 16:41:16,225 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-12-01 16:41:16,225 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-12-01 16:41:16,225 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-12-01 16:41:16,225 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-12-01 16:41:16,226 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse31 (= 1 ~m_pc~0)) (.cse4 (= ~t1_pc~0 1)) (.cse34 (= ~t1_st~0 0)) (.cse35 (+ ~local~0 2)) (.cse36 (+ ~local~0 1))) (let ((.cse32 (< ~token~0 .cse36)) (.cse33 (< .cse36 ~token~0)) (.cse28 (< .cse35 ~token~0)) (.cse29 (< ~token~0 .cse35)) (.cse27 (< ~t1_st~0 2)) (.cse30 (not (= 0 ~m_st~0))) (.cse21 (< ~t2_st~0 2)) (.cse22 (< ~local~0 ~token~0)) (.cse24 (< ~token~0 ~local~0)) (.cse8 (not .cse34)) (.cse26 (not (= 1 ~t2_pc~0))) (.cse14 (= 1 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< 0 ~t2_pc~0)) (.cse23 (not .cse4)) (.cse5 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse25 (= 1 ~M_E~0)) (.cse1 (= 0 is_master_triggered_~__retres1~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (not (= 0 ~t2_st~0))) (.cse15 (not .cse31)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse2 .cse22 .cse23 .cse24 .cse6 .cse7 .cse25 .cse9 .cse26 .cse27 .cse10 .cse1 .cse11 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse28 .cse23 .cse9 .cse5 .cse6 .cse7 .cse25 .cse26 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse21 .cse2 .cse22 .cse23 .cse24 .cse6 .cse7 .cse9 .cse26 .cse27 .cse10 .cse30 .cse11 .cse12 .cse1 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse2 .cse23 .cse1 .cse5 .cse6 .cse7 .cse9 .cse26 .cse27 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20) (or .cse0 .cse21 .cse2 .cse23 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse1 .cse32 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse34) (or .cse0 .cse21 .cse2 .cse4 .cse6 .cse7 .cse25 .cse8 .cse9 .cse26 .cse10 .cse11 .cse14 .cse1 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse1 .cse0 .cse2 .cse3 .cse22 .cse23 .cse24 .cse6 .cse7 .cse25 .cse9 .cse27 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse2 .cse3 .cse23 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse1 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse3 .cse22 .cse24 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse30 .cse11 .cse12 .cse13 .cse1 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse21 .cse2 .cse28 .cse23 .cse6 .cse7 .cse9 .cse26 .cse27 .cse10 .cse30 .cse1 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse21 .cse2 .cse23 .cse5 .cse6 .cse7 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse1 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse3 .cse22 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1) (or .cse0 .cse2 .cse3 .cse22 .cse23 .cse24 .cse6 .cse7 .cse9 .cse27 .cse10 .cse30 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1 .cse31) (or .cse0 .cse2 .cse3 .cse4 .cse1 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse21 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse2 .cse22 .cse24 .cse4 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse30 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1 .cse31) (or .cse0 .cse21 .cse1 .cse2 .cse22 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse3 .cse23 .cse5 .cse6 .cse7 .cse25 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34)))) [2018-12-01 16:41:16,227 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 16:41:16,231 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~T2_E~0 1)) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (= 0 ~t2_st~0) (not (= ~E_2~0 1)) (not (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) [2018-12-01 16:41:16,231 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-12-01 16:41:16,231 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-12-01 16:41:16,232 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse23 (< 0 ~t2_pc~0)) (.cse26 (< ~m_st~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse24 (not (= 0 ~t2_st~0))) (.cse3 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse25 (not .cse5)) (.cse6 (= |old(~T2_E~0)| 0)) (.cse8 (= 0 |old(~M_E~0)|)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse11 (not (= 1 ~t2_pc~0))) (.cse27 (< ~t1_st~0 2)) (.cse12 (= |old(~T1_E~0)| 1)) (.cse13 (not (= 0 ~m_st~0))) (.cse14 (not (= ~m_i~0 1))) (.cse15 (= 1 |old(~E_1~0)|)) (.cse16 (= 1 |old(~E_2~0)|)) (.cse28 (not .cse22)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse21 (= 0 |old(~E_2~0)|)) (.cse7 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse7 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse23 .cse7 .cse25 .cse26 .cse6 .cse8 .cse10 .cse27 .cse12 .cse14 .cse15 .cse24 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7) (or .cse0 .cse2 .cse23 .cse3 .cse4 .cse7 .cse26 .cse6 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse24 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse7 .cse0 .cse2 .cse23 .cse3 .cse25 .cse4 .cse6 .cse8 .cse10 .cse27 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse5 .cse26 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse25 .cse26 .cse6 .cse8 .cse7 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse29 (+ ~local~0 1))) (or .cse7 .cse0 .cse2 .cse25 .cse26 .cse6 .cse8 .cse10 .cse11 .cse27 .cse12 (< ~token~0 .cse29) .cse14 .cse15 .cse24 .cse16 .cse28 .cse17 .cse18 .cse19 (< .cse29 ~token~0) .cse20 .cse21)) (or .cse0 .cse2 .cse23 .cse5 .cse26 .cse6 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse24 .cse7 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse25 .cse4 .cse6 .cse8 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse30 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse30 ~token~0) .cse25 .cse6 .cse8 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7 (< ~token~0 .cse30)))))) [2018-12-01 16:41:16,234 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-12-01 16:41:16,234 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-12-01 16:41:16,234 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-12-01 16:41:16,235 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-12-01 16:41:16,235 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (= 1 |old(~t2_i~0)|) (= ~T2_E~0 1) (< 0 ~t2_pc~0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 1 ~E_1~0) (not (= 0 ~t2_st~0)) (= 1 ~E_2~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 0 ~E_2~0) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (= 1 ~m_pc~0)) [2018-12-01 16:41:16,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 04:41:16 BoogieIcfgContainer [2018-12-01 16:41:16,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 16:41:16,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:41:16,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:41:16,291 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:41:16,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:39:41" (3/4) ... [2018-12-01 16:41:16,293 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-01 16:41:16,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-12-01 16:41:16,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-12-01 16:41:16,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-01 16:41:16,304 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-01 16:41:16,304 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-01 16:41:16,323 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || \old(T2_E) == 0) || (((((((((\old(E_1) == E_1 && token == \old(token)) && \old(E_2) == E_2) && (((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(m_pc == 1)) && 0 == t2_st) && t2_pc <= 0) && \old(T2_E) == T2_E) && \old(T1_E) == T1_E) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == \old(M_E)) || (((((((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && 2 <= m_st) && \old(E_2) == E_2) && t2_pc <= 0) && !(E_1 == 1)) && ((((!(t1_pc == 1) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) && \old(E_M) == E_M)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((\old(T2_E) == T2_E && !(E_2 == 1)) && ((((1 == t1_pc && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(E_1) == E_1) && \old(T1_E) == T1_E) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 2 <= t1_st) && t2_pc <= 0) && local <= token)) || ((((2 <= t2_st && token <= local) && 2 <= m_st) && (!(E_2 == 1) && ((\old(T2_E) == T2_E && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && local <= token)) || ((((2 <= t2_st && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((!(t1_pc == 1) && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(E_M == 1)) && 2 <= m_st) && \old(E_2) == E_2) && !(E_1 == 1))) || \old(token) < \old(local)) || \old(t1_pc) == 1) || ((((token <= local + 1 && (!(E_2 == 1) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || (((((2 <= t2_st && (!(E_2 == 1) && ((\old(T2_E) == T2_E && ((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && \old(E_1) == E_1) && token == \old(token)) && token <= local) && 2 <= t1_st) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((token <= local && 2 <= m_st) && t2_pc <= 0) && ((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(T1_E) == T1_E) && ((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) && !(E_1 == 1)) && \old(E_M) == E_M) && local <= token)) || ((((((2 <= t2_st && \old(E_1) == E_1) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && ((\old(T2_E) == T2_E && (((((!(t1_pc == 1) && 1 == t2_pc) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(m_pc == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && local <= token)) || (((((2 <= t2_st && m_st == 0) && (!(E_2 == 1) && !(E_1 == 1)) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && ((((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && t2_i == 1) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && (((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t2_st) && \old(E_M) == E_M) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0)) || 1 == \old(m_pc)) || (((2 <= t2_st && 2 <= m_st) && (!(E_2 == 1) && !(E_1 == 1)) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && ((((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && t2_i == 1) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_M == 1)) && 2 <= t1_st) [2018-12-01 16:41:16,323 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || !(M_E == 0)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) [2018-12-01 16:41:16,324 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || (((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && local <= token)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st) && local <= token)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((!(t1_pc == 1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && 1 == m_pc)) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || \old(local) < \old(token)) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t2_st) && 1 == m_pc)) || 0 == \old(E_2)) || ((((((((((((1 == t1_pc && \old(E_1) == E_1) && 0 == t2_st) && !(E_2 == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_2 == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && t1_st == \old(t1_st)) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t2_st) && 1 == m_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((((((!(t1_pc == 1) && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_2)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-12-01 16:41:16,324 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || (((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && local <= token)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st) && local <= token)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((!(t1_pc == 1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && 1 == m_pc)) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || \old(local) < \old(token)) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t2_st) && 1 == m_pc)) || 0 == \old(E_2)) || ((((((((((((1 == t1_pc && \old(E_1) == E_1) && 0 == t2_st) && !(E_2 == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_2 == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && t1_st == \old(t1_st)) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t2_st) && 1 == m_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((((((!(t1_pc == 1) && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_2)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-12-01 16:41:16,325 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-12-01 16:41:16,325 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || \old(token) < \old(local) + 2) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) [2018-12-01 16:41:16,325 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-12-01 16:41:16,326 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && (((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st)) && (((((((((((((((((((((T1_E == 0 || \old(E_2) == E_2) || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1))) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && (((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && token <= local) && 0 == t2_st) && local <= token)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-12-01 16:41:16,326 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(E_2) == E_2) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-12-01 16:41:16,328 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || \old(t1_st) == 0) [2018-12-01 16:41:16,330 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && 0 == t1_st)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || ((((m_st == 0 && t2_pc <= 0) && \old(E_M) == E_M) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || (((((m_st == 0 && t1_st == \old(t1_st)) && t2_pc <= 0) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && token == \old(token)) && 0 == t1_st)) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && t1_st == \old(t1_st))) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((((((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && local + 2 <= token) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || ((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st))) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) [2018-12-01 16:41:16,331 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && (((((((((((((((((((((((((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) || T1_E == 0) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) [2018-12-01 16:41:16,333 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st))) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) [2018-12-01 16:41:16,377 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db873e03-7d7d-4a96-b176-3b64312c6541/bin-2019/uautomizer/witness.graphml [2018-12-01 16:41:16,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:41:16,377 INFO L168 Benchmark]: Toolchain (without parser) took 95898.44 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 952.2 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,378 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:41:16,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.53 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,378 INFO L168 Benchmark]: Boogie Preprocessor took 24.76 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,378 INFO L168 Benchmark]: RCFGBuilder took 295.38 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,378 INFO L168 Benchmark]: TraceAbstraction took 95262.57 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 758.1 MB in the end (delta: 315.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,379 INFO L168 Benchmark]: Witness Printer took 86.11 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -46.1 MB). Free memory was 758.1 MB in the beginning and 2.1 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-01 16:41:16,380 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 210.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.53 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.76 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.38 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95262.57 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 758.1 MB in the end (delta: 315.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 86.11 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -46.1 MB). Free memory was 758.1 MB in the beginning and 2.1 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.3 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: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && 0 == t1_st)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || ((((m_st == 0 && t2_pc <= 0) && \old(E_M) == E_M) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || (((((m_st == 0 && t1_st == \old(t1_st)) && t2_pc <= 0) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && token == \old(token)) && 0 == t1_st)) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && t1_st == \old(t1_st))) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((((((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && local + 2 <= token) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || ((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st))) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == __retres1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || 0 == __retres1) || token < local + 2)) && ((((t1_st < 2 || 0 == __retres1) || t2_st < 2) || 1 == E_2) || (((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_2) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && ((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || 0 == __retres1) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((t1_st < 2 || 0 == __retres1) || 1 == E_2) || 0 < t2_pc) || ((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == __retres1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == __retres1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(E_2) == E_2) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || \old(t1_st) == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && (((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st)) && (((((((((((((((((((((T1_E == 0 || \old(E_2) == E_2) || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1))) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && (((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && token <= local) && 0 == t2_st) && local <= token)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || !(M_E == 0)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 0 == __retres1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 0 == __retres1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == __retres1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 0 == __retres1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || 0 == __retres1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || (((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && local <= token)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st) && local <= token)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((!(t1_pc == 1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && 1 == m_pc)) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || \old(local) < \old(token)) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t2_st) && 1 == m_pc)) || 0 == \old(E_2)) || ((((((((((((1 == t1_pc && \old(E_1) == E_1) && 0 == t2_st) && !(E_2 == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_2 == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && t1_st == \old(t1_st)) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t2_st) && 1 == m_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((((((!(t1_pc == 1) && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_2)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || \old(token) < \old(local) + 2) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 0 == __retres1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || 1 == E_1) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && (((((((((((((((((((((((((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) || T1_E == 0) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st))) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || (((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && local <= token)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st) && local <= token)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((!(t1_pc == 1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((((((((((((((((((!(t1_pc == 1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && 1 == m_pc)) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || \old(local) < \old(token)) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(m_pc == 1)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && token == \old(token)) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && local <= token)) || ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && token <= local) && 2 <= m_st) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || !(\old(t1_pc) == 1)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t2_st) && 1 == m_pc)) || 0 == \old(E_2)) || ((((((((((((1 == t1_pc && \old(E_1) == E_1) && 0 == t2_st) && !(E_2 == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_2 == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && t1_st == \old(t1_st)) && t2_pc <= 0) && local <= token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || ((((((((((1 == t1_pc && \old(E_1) == E_1) && !(T2_E == 1)) && 2 <= m_st) && 2 <= t1_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t2_st) && 1 == m_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((((((!(t1_pc == 1) && \old(E_1) == E_1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc)) || (((((((((((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && !(E_2 == 1)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_2)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_2 == 1) && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && (((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || ((((2 <= t2_st && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(E_2 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || \old(T2_E) == 0) || (((((((((\old(E_1) == E_1 && token == \old(token)) && \old(E_2) == E_2) && (((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(m_pc == 1)) && 0 == t2_st) && t2_pc <= 0) && \old(T2_E) == T2_E) && \old(T1_E) == T1_E) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == \old(M_E)) || (((((((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && 2 <= m_st) && \old(E_2) == E_2) && t2_pc <= 0) && !(E_1 == 1)) && ((((!(t1_pc == 1) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) && \old(E_M) == E_M)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((\old(T2_E) == T2_E && !(E_2 == 1)) && ((((1 == t1_pc && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(E_1) == E_1) && \old(T1_E) == T1_E) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 2 <= t1_st) && t2_pc <= 0) && local <= token)) || ((((2 <= t2_st && token <= local) && 2 <= m_st) && (!(E_2 == 1) && ((\old(T2_E) == T2_E && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && local <= token)) || ((((2 <= t2_st && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((!(t1_pc == 1) && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(E_M == 1)) && 2 <= m_st) && \old(E_2) == E_2) && !(E_1 == 1))) || \old(token) < \old(local)) || \old(t1_pc) == 1) || ((((token <= local + 1 && (!(E_2 == 1) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || (((((2 <= t2_st && (!(E_2 == 1) && ((\old(T2_E) == T2_E && ((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && \old(E_1) == E_1) && token == \old(token)) && token <= local) && 2 <= t1_st) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((token <= local && 2 <= m_st) && t2_pc <= 0) && ((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(T1_E) == T1_E) && ((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) && !(E_1 == 1)) && \old(E_M) == E_M) && local <= token)) || ((((((2 <= t2_st && \old(E_1) == E_1) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && ((\old(T2_E) == T2_E && (((((!(t1_pc == 1) && 1 == t2_pc) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(m_pc == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && local <= token)) || (((((2 <= t2_st && m_st == 0) && (!(E_2 == 1) && !(E_1 == 1)) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && ((((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && t2_i == 1) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && (((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t2_st) && \old(E_M) == E_M) && 2 <= m_st) && 2 <= t1_st) && t2_pc <= 0)) || 1 == \old(m_pc)) || (((2 <= t2_st && 2 <= m_st) && (!(E_2 == 1) && !(E_1 == 1)) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && ((((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && t2_i == 1) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_M == 1)) && 2 <= t1_st) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 95.1s OverallTime, 25 OverallIterations, 7 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 80.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 6683 SDtfs, 8234 SDslu, 8263 SDs, 0 SdLazy, 5659 SolverSat, 2090 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1626 GetRequests, 1472 SyntacticMatches, 37 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6114occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 2191 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 22637 PreInvPairs, 23453 NumberOfFragments, 58883 HoareAnnotationTreeSize, 22637 FomulaSimplifications, 449184 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 71 FomulaSimplificationsInter, 327376 FormulaSimplificationTreeSizeReductionInter, 76.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 5210 NumberOfCodeBlocks, 5210 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 5178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1305772 SizeOfPredicates, 5 NumberOfNonLiveVariables, 6262 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 32 InterpolantComputations, 25 PerfectInterpolantSequences, 2582/2659 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...