./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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 460c5a2466ddacef0b654abb4130c31f8265660c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:48:56,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:48:56,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:48:56,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:48:56,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:48:56,407 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:48:56,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:48:56,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:48:56,411 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:48:56,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:48:56,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:48:56,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:48:56,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:48:56,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:48:56,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:48:56,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:48:56,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:48:56,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:48:56,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:48:56,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:48:56,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:48:56,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:48:56,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:48:56,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:48:56,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:48:56,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:48:56,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:48:56,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:48:56,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:48:56,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:48:56,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:48:56,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:48:56,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:48:56,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:48:56,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:48:56,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:48:56,429 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 08:48:56,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:48:56,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:48:56,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:48:56,441 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 08:48:56,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:48:56,441 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:48:56,441 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:48:56,442 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:48:56,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:48:56,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:48:56,442 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:48:56,442 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:48:56,442 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:48:56,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:48:56,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:48:56,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:48:56,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:48:56,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:48:56,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:48:56,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:48:56,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:48:56,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:48:56,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:48:56,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:48:56,445 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_6c39636d-b62c-4028-9133-4927f716d0f9/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 -> 460c5a2466ddacef0b654abb4130c31f8265660c [2018-11-18 08:48:56,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:48:56,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:48:56,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:48:56,477 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:48:56,477 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:48:56,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-18 08:48:56,513 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/data/b903c7e3e/b0440b3e77ab457fa23f445bda9d767a/FLAGc928fd990 [2018-11-18 08:48:56,938 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:48:56,938 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-18 08:48:56,946 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/data/b903c7e3e/b0440b3e77ab457fa23f445bda9d767a/FLAGc928fd990 [2018-11-18 08:48:56,956 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/data/b903c7e3e/b0440b3e77ab457fa23f445bda9d767a [2018-11-18 08:48:56,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:48:56,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:48:56,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:48:56,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:48:56,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:48:56,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:56" (1/1) ... [2018-11-18 08:48:56,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e3deec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:56, skipping insertion in model container [2018-11-18 08:48:56,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:56" (1/1) ... [2018-11-18 08:48:56,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:48:56,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:48:57,137 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:48:57,141 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:48:57,165 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:48:57,175 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:48:57,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57 WrapperNode [2018-11-18 08:48:57,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:48:57,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:48:57,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:48:57,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:48:57,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... [2018-11-18 08:48:57,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:48:57,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:48:57,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:48:57,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:48:57,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-18 08:48:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 08:48:57,278 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 08:48:57,279 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 08:48:57,279 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 08:48:57,279 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 08:48:57,279 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 08:48:57,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:48:57,279 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 08:48:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:48:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:48:57,681 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:48:57,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:57 BoogieIcfgContainer [2018-11-18 08:48:57,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:48:57,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:48:57,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:48:57,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:48:57,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:48:56" (1/3) ... [2018-11-18 08:48:57,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d926967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:57, skipping insertion in model container [2018-11-18 08:48:57,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:57" (2/3) ... [2018-11-18 08:48:57,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d926967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:57, skipping insertion in model container [2018-11-18 08:48:57,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:57" (3/3) ... [2018-11-18 08:48:57,687 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-18 08:48:57,692 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:48:57,698 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:48:57,706 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:48:57,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:48:57,727 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:48:57,727 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:48:57,727 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:48:57,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:48:57,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:48:57,728 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:48:57,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:48:57,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:48:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-11-18 08:48:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:48:57,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:57,751 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:57,752 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:48:57,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 520324493, now seen corresponding path program 1 times [2018-11-18 08:48:57,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:48:57,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:48:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:57,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:48:57,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:48:57,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:48:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:48:57,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:48:57,956 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-11-18 08:48:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:58,154 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2018-11-18 08:48:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:48:58,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-18 08:48:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:58,165 INFO L225 Difference]: With dead ends: 403 [2018-11-18 08:48:58,166 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 08:48:58,170 INFO L604 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-11-18 08:48:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 08:48:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-18 08:48:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:48:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2018-11-18 08:48:58,212 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 274 transitions. Word has length 107 [2018-11-18 08:48:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:58,214 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 274 transitions. [2018-11-18 08:48:58,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:48:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 274 transitions. [2018-11-18 08:48:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:48:58,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:58,217 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:58,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:48:58,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1834060789, now seen corresponding path program 1 times [2018-11-18 08:48:58,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:48:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:48:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:58,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:58,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:48:58,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:48:58,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:48:58,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:48:58,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:48:58,358 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. Second operand 5 states. [2018-11-18 08:48:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:58,709 INFO L93 Difference]: Finished difference Result 416 states and 586 transitions. [2018-11-18 08:48:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:48:58,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:48:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:58,712 INFO L225 Difference]: With dead ends: 416 [2018-11-18 08:48:58,712 INFO L226 Difference]: Without dead ends: 236 [2018-11-18 08:48:58,714 INFO L604 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-11-18 08:48:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-18 08:48:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2018-11-18 08:48:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:48:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2018-11-18 08:48:58,737 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 107 [2018-11-18 08:48:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:58,737 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2018-11-18 08:48:58,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:48:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2018-11-18 08:48:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:48:58,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:58,739 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:58,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:48:58,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -509204595, now seen corresponding path program 1 times [2018-11-18 08:48:58,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:48:58,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:48:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:58,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:48:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:48:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:48:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:48:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:48:58,817 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand 5 states. [2018-11-18 08:48:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:59,106 INFO L93 Difference]: Finished difference Result 414 states and 580 transitions. [2018-11-18 08:48:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:48:59,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:48:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:59,108 INFO L225 Difference]: With dead ends: 414 [2018-11-18 08:48:59,108 INFO L226 Difference]: Without dead ends: 234 [2018-11-18 08:48:59,109 INFO L604 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-11-18 08:48:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-18 08:48:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2018-11-18 08:48:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:48:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 272 transitions. [2018-11-18 08:48:59,139 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 272 transitions. Word has length 107 [2018-11-18 08:48:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:59,140 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 272 transitions. [2018-11-18 08:48:59,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:48:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 272 transitions. [2018-11-18 08:48:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:48:59,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:59,142 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:59,142 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:48:59,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1057553355, now seen corresponding path program 1 times [2018-11-18 08:48:59,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:48:59,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:48:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:59,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:48:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:48:59,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:48:59,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:48:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:48:59,230 INFO L87 Difference]: Start difference. First operand 201 states and 272 transitions. Second operand 5 states. [2018-11-18 08:48:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:59,552 INFO L93 Difference]: Finished difference Result 412 states and 574 transitions. [2018-11-18 08:48:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:48:59,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:48:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:59,559 INFO L225 Difference]: With dead ends: 412 [2018-11-18 08:48:59,559 INFO L226 Difference]: Without dead ends: 232 [2018-11-18 08:48:59,560 INFO L604 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-11-18 08:48:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-18 08:48:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2018-11-18 08:48:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:48:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2018-11-18 08:48:59,576 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 107 [2018-11-18 08:48:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:59,576 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2018-11-18 08:48:59,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:48:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2018-11-18 08:48:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:48:59,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:59,577 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:59,578 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:48:59,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash -284723, now seen corresponding path program 1 times [2018-11-18 08:48:59,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:48:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:48:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:59,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:48:59,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:48:59,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:48:59,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:48:59,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:48:59,638 INFO L87 Difference]: Start difference. First operand 201 states and 271 transitions. Second operand 5 states. [2018-11-18 08:48:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:59,888 INFO L93 Difference]: Finished difference Result 434 states and 608 transitions. [2018-11-18 08:48:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:48:59,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:48:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:59,890 INFO L225 Difference]: With dead ends: 434 [2018-11-18 08:48:59,890 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 08:48:59,891 INFO L604 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-11-18 08:48:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 08:48:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2018-11-18 08:48:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:48:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 270 transitions. [2018-11-18 08:48:59,908 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 270 transitions. Word has length 107 [2018-11-18 08:48:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:59,908 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 270 transitions. [2018-11-18 08:48:59,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:48:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 270 transitions. [2018-11-18 08:48:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:48:59,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:59,909 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:59,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:48:59,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1142787189, now seen corresponding path program 1 times [2018-11-18 08:48:59,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:48:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:48:59,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:59,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:59,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:48:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:59,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:48:59,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:48:59,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:48:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:48:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:48:59,973 INFO L87 Difference]: Start difference. First operand 201 states and 270 transitions. Second operand 5 states. [2018-11-18 08:49:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:00,223 INFO L93 Difference]: Finished difference Result 427 states and 596 transitions. [2018-11-18 08:49:00,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:49:00,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:49:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:00,225 INFO L225 Difference]: With dead ends: 427 [2018-11-18 08:49:00,225 INFO L226 Difference]: Without dead ends: 247 [2018-11-18 08:49:00,226 INFO L604 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-11-18 08:49:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-18 08:49:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 201. [2018-11-18 08:49:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:49:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 269 transitions. [2018-11-18 08:49:00,241 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 269 transitions. Word has length 107 [2018-11-18 08:49:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:00,241 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 269 transitions. [2018-11-18 08:49:00,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 269 transitions. [2018-11-18 08:49:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:49:00,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:00,242 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:00,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:00,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash -902547443, now seen corresponding path program 1 times [2018-11-18 08:49:00,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:00,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:00,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:00,303 INFO L87 Difference]: Start difference. First operand 201 states and 269 transitions. Second operand 5 states. [2018-11-18 08:49:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:00,557 INFO L93 Difference]: Finished difference Result 430 states and 596 transitions. [2018-11-18 08:49:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:49:00,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:49:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:00,559 INFO L225 Difference]: With dead ends: 430 [2018-11-18 08:49:00,559 INFO L226 Difference]: Without dead ends: 250 [2018-11-18 08:49:00,560 INFO L604 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-11-18 08:49:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-18 08:49:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 201. [2018-11-18 08:49:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:49:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 268 transitions. [2018-11-18 08:49:00,572 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 268 transitions. Word has length 107 [2018-11-18 08:49:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:00,572 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 268 transitions. [2018-11-18 08:49:00,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 268 transitions. [2018-11-18 08:49:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:49:00,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:00,574 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:00,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:00,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -63513781, now seen corresponding path program 1 times [2018-11-18 08:49:00,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:00,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:00,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:00,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:00,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:00,623 INFO L87 Difference]: Start difference. First operand 201 states and 268 transitions. Second operand 5 states. [2018-11-18 08:49:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:00,847 INFO L93 Difference]: Finished difference Result 428 states and 590 transitions. [2018-11-18 08:49:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:49:00,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 08:49:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:00,849 INFO L225 Difference]: With dead ends: 428 [2018-11-18 08:49:00,849 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 08:49:00,850 INFO L604 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-11-18 08:49:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 08:49:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 201. [2018-11-18 08:49:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 08:49:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2018-11-18 08:49:00,865 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 267 transitions. Word has length 107 [2018-11-18 08:49:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:00,865 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 267 transitions. [2018-11-18 08:49:00,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 267 transitions. [2018-11-18 08:49:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 08:49:00,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:00,867 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:00,867 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:00,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash -36448179, now seen corresponding path program 1 times [2018-11-18 08:49:00,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:00,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:00,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:00,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:00,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:00,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:00,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:00,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:00,916 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. Second operand 4 states. [2018-11-18 08:49:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:01,046 INFO L93 Difference]: Finished difference Result 551 states and 764 transitions. [2018-11-18 08:49:01,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:01,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-18 08:49:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:01,048 INFO L225 Difference]: With dead ends: 551 [2018-11-18 08:49:01,048 INFO L226 Difference]: Without dead ends: 372 [2018-11-18 08:49:01,049 INFO L604 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-11-18 08:49:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-18 08:49:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-18 08:49:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 08:49:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 492 transitions. [2018-11-18 08:49:01,071 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 492 transitions. Word has length 107 [2018-11-18 08:49:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:01,071 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 492 transitions. [2018-11-18 08:49:01,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 492 transitions. [2018-11-18 08:49:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 08:49:01,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:01,073 INFO L375 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, 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] [2018-11-18 08:49:01,074 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:01,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1931539683, now seen corresponding path program 1 times [2018-11-18 08:49:01,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:01,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:01,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 08:49:01,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:01,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:01,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:01,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 08:49:01,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:01,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-18 08:49:01,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 08:49:01,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:49:01,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:01,265 INFO L87 Difference]: Start difference. First operand 371 states and 492 transitions. Second operand 7 states. [2018-11-18 08:49:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:01,381 INFO L93 Difference]: Finished difference Result 1088 states and 1544 transitions. [2018-11-18 08:49:01,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:49:01,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2018-11-18 08:49:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:01,384 INFO L225 Difference]: With dead ends: 1088 [2018-11-18 08:49:01,384 INFO L226 Difference]: Without dead ends: 739 [2018-11-18 08:49:01,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 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-11-18 08:49:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-11-18 08:49:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 706. [2018-11-18 08:49:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-11-18 08:49:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 965 transitions. [2018-11-18 08:49:01,439 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 965 transitions. Word has length 173 [2018-11-18 08:49:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:01,439 INFO L480 AbstractCegarLoop]: Abstraction has 706 states and 965 transitions. [2018-11-18 08:49:01,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 08:49:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 965 transitions. [2018-11-18 08:49:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-18 08:49:01,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:01,442 INFO L375 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, 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] [2018-11-18 08:49:01,442 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:01,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1264114207, now seen corresponding path program 1 times [2018-11-18 08:49:01,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:01,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-18 08:49:01,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:01,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:01,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:01,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:01,504 INFO L87 Difference]: Start difference. First operand 706 states and 965 transitions. Second operand 4 states. [2018-11-18 08:49:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:01,627 INFO L93 Difference]: Finished difference Result 1384 states and 1891 transitions. [2018-11-18 08:49:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:01,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-11-18 08:49:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:01,631 INFO L225 Difference]: With dead ends: 1384 [2018-11-18 08:49:01,631 INFO L226 Difference]: Without dead ends: 700 [2018-11-18 08:49:01,632 INFO L604 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-11-18 08:49:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-11-18 08:49:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2018-11-18 08:49:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-11-18 08:49:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 953 transitions. [2018-11-18 08:49:01,672 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 953 transitions. Word has length 195 [2018-11-18 08:49:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:01,672 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 953 transitions. [2018-11-18 08:49:01,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 953 transitions. [2018-11-18 08:49:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 08:49:01,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:01,674 INFO L375 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, 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] [2018-11-18 08:49:01,675 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:01,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1195118043, now seen corresponding path program 1 times [2018-11-18 08:49:01,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:01,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 08:49:01,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:01,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:01,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 08:49:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:01,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-18 08:49:01,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:01,866 INFO L87 Difference]: Start difference. First operand 700 states and 953 transitions. Second operand 5 states. [2018-11-18 08:49:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:02,223 INFO L93 Difference]: Finished difference Result 2201 states and 3190 transitions. [2018-11-18 08:49:02,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:02,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-11-18 08:49:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:02,229 INFO L225 Difference]: With dead ends: 2201 [2018-11-18 08:49:02,229 INFO L226 Difference]: Without dead ends: 1523 [2018-11-18 08:49:02,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 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-11-18 08:49:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-11-18 08:49:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1511. [2018-11-18 08:49:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2018-11-18 08:49:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2071 transitions. [2018-11-18 08:49:02,311 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2071 transitions. Word has length 174 [2018-11-18 08:49:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:02,312 INFO L480 AbstractCegarLoop]: Abstraction has 1511 states and 2071 transitions. [2018-11-18 08:49:02,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2071 transitions. [2018-11-18 08:49:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-18 08:49:02,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:02,315 INFO L375 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, 3, 3, 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] [2018-11-18 08:49:02,315 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:02,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:02,316 INFO L82 PathProgramCache]: Analyzing trace with hash -900899551, now seen corresponding path program 1 times [2018-11-18 08:49:02,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:02,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:02,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-18 08:49:02,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:02,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:02,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:02,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:49:02,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:02,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-18 08:49:02,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 08:49:02,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:49:02,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:02,544 INFO L87 Difference]: Start difference. First operand 1511 states and 2071 transitions. Second operand 7 states. [2018-11-18 08:49:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:02,960 INFO L93 Difference]: Finished difference Result 4524 states and 6600 transitions. [2018-11-18 08:49:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:49:02,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2018-11-18 08:49:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:02,975 INFO L225 Difference]: With dead ends: 4524 [2018-11-18 08:49:02,975 INFO L226 Difference]: Without dead ends: 3035 [2018-11-18 08:49:02,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:49:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2018-11-18 08:49:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3005. [2018-11-18 08:49:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2018-11-18 08:49:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 4152 transitions. [2018-11-18 08:49:03,250 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 4152 transitions. Word has length 228 [2018-11-18 08:49:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:03,251 INFO L480 AbstractCegarLoop]: Abstraction has 3005 states and 4152 transitions. [2018-11-18 08:49:03,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 08:49:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 4152 transitions. [2018-11-18 08:49:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-18 08:49:03,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:03,258 INFO L375 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, 3, 3, 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] [2018-11-18 08:49:03,259 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:03,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1991134642, now seen corresponding path program 1 times [2018-11-18 08:49:03,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:03,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:03,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 08:49:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:03,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:03,355 INFO L87 Difference]: Start difference. First operand 3005 states and 4152 transitions. Second operand 5 states. [2018-11-18 08:49:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:04,244 INFO L93 Difference]: Finished difference Result 7738 states and 10864 transitions. [2018-11-18 08:49:04,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:04,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-18 08:49:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:04,266 INFO L225 Difference]: With dead ends: 7738 [2018-11-18 08:49:04,267 INFO L226 Difference]: Without dead ends: 4756 [2018-11-18 08:49:04,276 INFO L604 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-11-18 08:49:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2018-11-18 08:49:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 4288. [2018-11-18 08:49:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-11-18 08:49:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5749 transitions. [2018-11-18 08:49:04,614 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5749 transitions. Word has length 228 [2018-11-18 08:49:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:04,614 INFO L480 AbstractCegarLoop]: Abstraction has 4288 states and 5749 transitions. [2018-11-18 08:49:04,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5749 transitions. [2018-11-18 08:49:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-18 08:49:04,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:04,623 INFO L375 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, 3, 3, 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] [2018-11-18 08:49:04,623 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:04,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1379865584, now seen corresponding path program 1 times [2018-11-18 08:49:04,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:04,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:04,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 08:49:04,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:04,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:04,695 INFO L87 Difference]: Start difference. First operand 4288 states and 5749 transitions. Second operand 5 states. [2018-11-18 08:49:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:05,155 INFO L93 Difference]: Finished difference Result 8551 states and 11538 transitions. [2018-11-18 08:49:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:49:05,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-18 08:49:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:05,167 INFO L225 Difference]: With dead ends: 8551 [2018-11-18 08:49:05,167 INFO L226 Difference]: Without dead ends: 4288 [2018-11-18 08:49:05,174 INFO L604 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-11-18 08:49:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-11-18 08:49:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4288. [2018-11-18 08:49:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-11-18 08:49:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5695 transitions. [2018-11-18 08:49:05,372 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5695 transitions. Word has length 228 [2018-11-18 08:49:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:05,372 INFO L480 AbstractCegarLoop]: Abstraction has 4288 states and 5695 transitions. [2018-11-18 08:49:05,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5695 transitions. [2018-11-18 08:49:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-18 08:49:05,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:05,378 INFO L375 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, 3, 3, 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] [2018-11-18 08:49:05,378 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:05,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -25326094, now seen corresponding path program 1 times [2018-11-18 08:49:05,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:05,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:05,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:05,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:05,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 08:49:05,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:05,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:05,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:05,452 INFO L87 Difference]: Start difference. First operand 4288 states and 5695 transitions. Second operand 5 states. [2018-11-18 08:49:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:05,875 INFO L93 Difference]: Finished difference Result 8551 states and 11430 transitions. [2018-11-18 08:49:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:49:05,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-18 08:49:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:05,887 INFO L225 Difference]: With dead ends: 8551 [2018-11-18 08:49:05,887 INFO L226 Difference]: Without dead ends: 4288 [2018-11-18 08:49:05,897 INFO L604 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-11-18 08:49:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-11-18 08:49:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4288. [2018-11-18 08:49:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-11-18 08:49:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5641 transitions. [2018-11-18 08:49:06,214 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5641 transitions. Word has length 228 [2018-11-18 08:49:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:06,214 INFO L480 AbstractCegarLoop]: Abstraction has 4288 states and 5641 transitions. [2018-11-18 08:49:06,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5641 transitions. [2018-11-18 08:49:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-18 08:49:06,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:06,223 INFO L375 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, 3, 3, 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] [2018-11-18 08:49:06,223 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:06,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1869007792, now seen corresponding path program 1 times [2018-11-18 08:49:06,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:06,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:06,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 08:49:06,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:06,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:06,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:06,293 INFO L87 Difference]: Start difference. First operand 4288 states and 5641 transitions. Second operand 5 states. [2018-11-18 08:49:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:06,905 INFO L93 Difference]: Finished difference Result 8530 states and 11795 transitions. [2018-11-18 08:49:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:06,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-18 08:49:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:06,918 INFO L225 Difference]: With dead ends: 8530 [2018-11-18 08:49:06,919 INFO L226 Difference]: Without dead ends: 4267 [2018-11-18 08:49:06,935 INFO L604 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-11-18 08:49:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2018-11-18 08:49:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4028. [2018-11-18 08:49:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2018-11-18 08:49:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 5157 transitions. [2018-11-18 08:49:07,257 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 5157 transitions. Word has length 228 [2018-11-18 08:49:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:07,258 INFO L480 AbstractCegarLoop]: Abstraction has 4028 states and 5157 transitions. [2018-11-18 08:49:07,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 5157 transitions. [2018-11-18 08:49:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 08:49:07,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:07,268 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 08:49:07,268 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:07,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash 146104675, now seen corresponding path program 1 times [2018-11-18 08:49:07,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:07,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:07,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-11-18 08:49:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:07,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:07,385 INFO L87 Difference]: Start difference. First operand 4028 states and 5157 transitions. Second operand 5 states. [2018-11-18 08:49:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:08,039 INFO L93 Difference]: Finished difference Result 8939 states and 11958 transitions. [2018-11-18 08:49:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:08,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2018-11-18 08:49:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:08,057 INFO L225 Difference]: With dead ends: 8939 [2018-11-18 08:49:08,057 INFO L226 Difference]: Without dead ends: 4934 [2018-11-18 08:49:08,067 INFO L604 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-11-18 08:49:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2018-11-18 08:49:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4625. [2018-11-18 08:49:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2018-11-18 08:49:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 5903 transitions. [2018-11-18 08:49:08,424 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 5903 transitions. Word has length 252 [2018-11-18 08:49:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:08,425 INFO L480 AbstractCegarLoop]: Abstraction has 4625 states and 5903 transitions. [2018-11-18 08:49:08,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 5903 transitions. [2018-11-18 08:49:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-11-18 08:49:08,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:08,437 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:08,437 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:08,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:08,438 INFO L82 PathProgramCache]: Analyzing trace with hash -277610576, now seen corresponding path program 1 times [2018-11-18 08:49:08,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:08,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:08,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-11-18 08:49:08,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:08,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:08,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-18 08:49:08,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:08,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 08:49:08,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:08,803 INFO L87 Difference]: Start difference. First operand 4625 states and 5903 transitions. Second operand 6 states. [2018-11-18 08:49:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:09,905 INFO L93 Difference]: Finished difference Result 10765 states and 15118 transitions. [2018-11-18 08:49:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:49:09,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2018-11-18 08:49:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:09,924 INFO L225 Difference]: With dead ends: 10765 [2018-11-18 08:49:09,924 INFO L226 Difference]: Without dead ends: 6165 [2018-11-18 08:49:09,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 365 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:49:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6165 states. [2018-11-18 08:49:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6165 to 5059. [2018-11-18 08:49:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5059 states. [2018-11-18 08:49:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 6150 transitions. [2018-11-18 08:49:10,182 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 6150 transitions. Word has length 358 [2018-11-18 08:49:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:10,182 INFO L480 AbstractCegarLoop]: Abstraction has 5059 states and 6150 transitions. [2018-11-18 08:49:10,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6150 transitions. [2018-11-18 08:49:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 08:49:10,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:10,188 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 08:49:10,189 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:10,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash -694961885, now seen corresponding path program 1 times [2018-11-18 08:49:10,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:10,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-11-18 08:49:10,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:10,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:10,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:10,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:10,302 INFO L87 Difference]: Start difference. First operand 5059 states and 6150 transitions. Second operand 5 states. [2018-11-18 08:49:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:10,959 INFO L93 Difference]: Finished difference Result 10883 states and 14245 transitions. [2018-11-18 08:49:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:10,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2018-11-18 08:49:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:10,976 INFO L225 Difference]: With dead ends: 10883 [2018-11-18 08:49:10,976 INFO L226 Difference]: Without dead ends: 5849 [2018-11-18 08:49:10,983 INFO L604 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-11-18 08:49:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5849 states. [2018-11-18 08:49:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5849 to 5444. [2018-11-18 08:49:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5444 states. [2018-11-18 08:49:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 6606 transitions. [2018-11-18 08:49:11,250 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 6606 transitions. Word has length 252 [2018-11-18 08:49:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:11,251 INFO L480 AbstractCegarLoop]: Abstraction has 5444 states and 6606 transitions. [2018-11-18 08:49:11,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 6606 transitions. [2018-11-18 08:49:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 08:49:11,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:11,257 INFO L375 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, 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, 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] [2018-11-18 08:49:11,257 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:11,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:11,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1005079974, now seen corresponding path program 1 times [2018-11-18 08:49:11,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:11,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:11,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:11,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:11,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 08:49:11,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:11,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:11,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 08:49:11,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:11,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 08:49:11,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:11,467 INFO L87 Difference]: Start difference. First operand 5444 states and 6606 transitions. Second operand 6 states. [2018-11-18 08:49:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:13,564 INFO L93 Difference]: Finished difference Result 28145 states and 41822 transitions. [2018-11-18 08:49:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:49:13,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2018-11-18 08:49:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:13,625 INFO L225 Difference]: With dead ends: 28145 [2018-11-18 08:49:13,625 INFO L226 Difference]: Without dead ends: 22726 [2018-11-18 08:49:13,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:49:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22726 states. [2018-11-18 08:49:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22726 to 21349. [2018-11-18 08:49:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-11-18 08:49:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 29507 transitions. [2018-11-18 08:49:15,175 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 29507 transitions. Word has length 252 [2018-11-18 08:49:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:15,176 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 29507 transitions. [2018-11-18 08:49:15,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 29507 transitions. [2018-11-18 08:49:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-18 08:49:15,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:15,223 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-18 08:49:15,223 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:15,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -180144417, now seen corresponding path program 1 times [2018-11-18 08:49:15,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-18 08:49:15,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:15,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:15,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:15,313 INFO L87 Difference]: Start difference. First operand 21349 states and 29507 transitions. Second operand 4 states. [2018-11-18 08:49:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:16,454 INFO L93 Difference]: Finished difference Result 38910 states and 53635 transitions. [2018-11-18 08:49:16,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:16,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-11-18 08:49:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:16,506 INFO L225 Difference]: With dead ends: 38910 [2018-11-18 08:49:16,506 INFO L226 Difference]: Without dead ends: 17591 [2018-11-18 08:49:16,638 INFO L604 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-11-18 08:49:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17591 states. [2018-11-18 08:49:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17591 to 17591. [2018-11-18 08:49:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17591 states. [2018-11-18 08:49:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17591 states to 17591 states and 24170 transitions. [2018-11-18 08:49:17,587 INFO L78 Accepts]: Start accepts. Automaton has 17591 states and 24170 transitions. Word has length 306 [2018-11-18 08:49:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:17,587 INFO L480 AbstractCegarLoop]: Abstraction has 17591 states and 24170 transitions. [2018-11-18 08:49:17,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17591 states and 24170 transitions. [2018-11-18 08:49:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 08:49:17,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:17,601 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 08:49:17,601 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:17,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 293837714, now seen corresponding path program 1 times [2018-11-18 08:49:17,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:17,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:17,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-18 08:49:17,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:17,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:17,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:17,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 08:49:17,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:17,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-18 08:49:17,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:17,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:17,856 INFO L87 Difference]: Start difference. First operand 17591 states and 24170 transitions. Second operand 4 states. [2018-11-18 08:49:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:20,052 INFO L93 Difference]: Finished difference Result 50288 states and 77863 transitions. [2018-11-18 08:49:20,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:20,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2018-11-18 08:49:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:20,154 INFO L225 Difference]: With dead ends: 50288 [2018-11-18 08:49:20,154 INFO L226 Difference]: Without dead ends: 32727 [2018-11-18 08:49:20,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 259 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-11-18 08:49:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32727 states. [2018-11-18 08:49:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32727 to 32656. [2018-11-18 08:49:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2018-11-18 08:49:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 44846 transitions. [2018-11-18 08:49:22,310 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 44846 transitions. Word has length 260 [2018-11-18 08:49:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:22,310 INFO L480 AbstractCegarLoop]: Abstraction has 32656 states and 44846 transitions. [2018-11-18 08:49:22,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 44846 transitions. [2018-11-18 08:49:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 08:49:22,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:22,349 INFO L375 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, 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-11-18 08:49:22,349 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:22,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1455473865, now seen corresponding path program 1 times [2018-11-18 08:49:22,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:22,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:22,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:22,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:22,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-11-18 08:49:22,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:22,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:22,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:22,455 INFO L87 Difference]: Start difference. First operand 32656 states and 44846 transitions. Second operand 4 states. [2018-11-18 08:49:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:24,245 INFO L93 Difference]: Finished difference Result 57074 states and 78033 transitions. [2018-11-18 08:49:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:24,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-11-18 08:49:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:24,298 INFO L225 Difference]: With dead ends: 57074 [2018-11-18 08:49:24,299 INFO L226 Difference]: Without dead ends: 24441 [2018-11-18 08:49:24,357 INFO L604 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-11-18 08:49:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24441 states. [2018-11-18 08:49:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24441 to 24441. [2018-11-18 08:49:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24441 states. [2018-11-18 08:49:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24441 states to 24441 states and 33215 transitions. [2018-11-18 08:49:25,991 INFO L78 Accepts]: Start accepts. Automaton has 24441 states and 33215 transitions. Word has length 252 [2018-11-18 08:49:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:25,991 INFO L480 AbstractCegarLoop]: Abstraction has 24441 states and 33215 transitions. [2018-11-18 08:49:25,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 24441 states and 33215 transitions. [2018-11-18 08:49:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-11-18 08:49:26,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:26,005 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:26,005 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:26,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 68690439, now seen corresponding path program 1 times [2018-11-18 08:49:26,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:26,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:26,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:26,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:26,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-18 08:49:26,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:26,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/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-11-18 08:49:26,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:26,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 08:49:26,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:26,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-18 08:49:26,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:49:26,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:49:26,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:49:26,315 INFO L87 Difference]: Start difference. First operand 24441 states and 33215 transitions. Second operand 9 states. [2018-11-18 08:49:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:27,320 INFO L93 Difference]: Finished difference Result 36503 states and 49929 transitions. [2018-11-18 08:49:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 08:49:27,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 361 [2018-11-18 08:49:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:27,345 INFO L225 Difference]: With dead ends: 36503 [2018-11-18 08:49:27,345 INFO L226 Difference]: Without dead ends: 12087 [2018-11-18 08:49:27,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-11-18 08:49:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12087 states. [2018-11-18 08:49:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12087 to 10822. [2018-11-18 08:49:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2018-11-18 08:49:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 12643 transitions. [2018-11-18 08:49:28,174 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 12643 transitions. Word has length 361 [2018-11-18 08:49:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:28,175 INFO L480 AbstractCegarLoop]: Abstraction has 10822 states and 12643 transitions. [2018-11-18 08:49:28,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:49:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 12643 transitions. [2018-11-18 08:49:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-18 08:49:28,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:28,181 INFO L375 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, 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, 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] [2018-11-18 08:49:28,181 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:28,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1698505659, now seen corresponding path program 1 times [2018-11-18 08:49:28,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:28,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 08:49:28,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:28,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:49:28,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:28,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 08:49:28,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:28,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-18 08:49:28,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:28,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:28,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:28,479 INFO L87 Difference]: Start difference. First operand 10822 states and 12643 transitions. Second operand 6 states. [2018-11-18 08:49:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:29,025 INFO L93 Difference]: Finished difference Result 20492 states and 24529 transitions. [2018-11-18 08:49:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:29,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2018-11-18 08:49:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:29,048 INFO L225 Difference]: With dead ends: 20492 [2018-11-18 08:49:29,048 INFO L226 Difference]: Without dead ends: 9788 [2018-11-18 08:49:29,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9788 states. [2018-11-18 08:49:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9788 to 9742. [2018-11-18 08:49:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9742 states. [2018-11-18 08:49:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9742 states to 9742 states and 11083 transitions. [2018-11-18 08:49:29,561 INFO L78 Accepts]: Start accepts. Automaton has 9742 states and 11083 transitions. Word has length 256 [2018-11-18 08:49:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:29,561 INFO L480 AbstractCegarLoop]: Abstraction has 9742 states and 11083 transitions. [2018-11-18 08:49:29,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9742 states and 11083 transitions. [2018-11-18 08:49:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-18 08:49:29,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:29,567 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-18 08:49:29,568 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:29,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1370333605, now seen corresponding path program 1 times [2018-11-18 08:49:29,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:29,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:29,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:29,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:29,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-11-18 08:49:29,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:29,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:49:29,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:29,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 08:49:30,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-18 08:49:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:30,024 INFO L87 Difference]: Start difference. First operand 9742 states and 11083 transitions. Second operand 6 states. [2018-11-18 08:49:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:30,594 INFO L93 Difference]: Finished difference Result 14194 states and 16139 transitions. [2018-11-18 08:49:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:49:30,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-11-18 08:49:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:30,604 INFO L225 Difference]: With dead ends: 14194 [2018-11-18 08:49:30,604 INFO L226 Difference]: Without dead ends: 5392 [2018-11-18 08:49:30,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 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-11-18 08:49:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2018-11-18 08:49:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 5260. [2018-11-18 08:49:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2018-11-18 08:49:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 5866 transitions. [2018-11-18 08:49:30,882 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 5866 transitions. Word has length 318 [2018-11-18 08:49:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:30,882 INFO L480 AbstractCegarLoop]: Abstraction has 5260 states and 5866 transitions. [2018-11-18 08:49:30,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 5866 transitions. [2018-11-18 08:49:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-11-18 08:49:30,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:30,886 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:30,887 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:30,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash -719635531, now seen corresponding path program 1 times [2018-11-18 08:49:30,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:30,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-11-18 08:49:31,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:31,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:49:31,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:31,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-18 08:49:31,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:31,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 08:49:31,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 08:49:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:49:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:49:31,278 INFO L87 Difference]: Start difference. First operand 5260 states and 5866 transitions. Second operand 10 states. [2018-11-18 08:49:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:31,884 INFO L93 Difference]: Finished difference Result 7340 states and 8193 transitions. [2018-11-18 08:49:31,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 08:49:31,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 514 [2018-11-18 08:49:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:31,887 INFO L225 Difference]: With dead ends: 7340 [2018-11-18 08:49:31,887 INFO L226 Difference]: Without dead ends: 1055 [2018-11-18 08:49:31,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:49:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-11-18 08:49:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1044. [2018-11-18 08:49:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-11-18 08:49:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1097 transitions. [2018-11-18 08:49:31,948 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1097 transitions. Word has length 514 [2018-11-18 08:49:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:31,948 INFO L480 AbstractCegarLoop]: Abstraction has 1044 states and 1097 transitions. [2018-11-18 08:49:31,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 08:49:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1097 transitions. [2018-11-18 08:49:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-11-18 08:49:31,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:31,950 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:31,950 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:31,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash -97431788, now seen corresponding path program 1 times [2018-11-18 08:49:31,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:49:31,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:49:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:31,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-18 08:49:32,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:32,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 08:49:32,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 08:49:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:49:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:49:32,101 INFO L87 Difference]: Start difference. First operand 1044 states and 1097 transitions. Second operand 8 states. [2018-11-18 08:49:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:32,764 INFO L93 Difference]: Finished difference Result 1044 states and 1097 transitions. [2018-11-18 08:49:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 08:49:32,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 385 [2018-11-18 08:49:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:32,765 INFO L225 Difference]: With dead ends: 1044 [2018-11-18 08:49:32,765 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 08:49:32,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 08:49:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 08:49:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 08:49:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 08:49:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 08:49:32,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 385 [2018-11-18 08:49:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:32,768 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:49:32,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 08:49:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:49:32,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 08:49:32,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 08:49:33,182 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 250 [2018-11-18 08:49:33,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:34,123 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-18 08:49:34,908 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 250 [2018-11-18 08:49:35,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:35,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:35,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:35,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:36,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:37,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:37,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:37,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:37,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:38,754 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 121 [2018-11-18 08:49:41,126 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 305 DAG size of output: 214 [2018-11-18 08:49:42,617 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-11-18 08:49:42,880 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 117 [2018-11-18 08:49:44,656 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 182 DAG size of output: 111 [2018-11-18 08:49:46,913 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 253 DAG size of output: 132 [2018-11-18 08:49:47,759 WARN L180 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 115 [2018-11-18 08:49:48,073 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 134 [2018-11-18 08:49:48,488 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 147 [2018-11-18 08:49:48,657 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 103 [2018-11-18 08:49:49,318 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2018-11-18 08:49:49,515 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 1 [2018-11-18 08:49:50,921 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 165 DAG size of output: 112 [2018-11-18 08:49:54,229 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 187 DAG size of output: 117 [2018-11-18 08:49:54,509 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 121 [2018-11-18 08:49:55,629 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 212 DAG size of output: 169 [2018-11-18 08:49:57,908 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 305 DAG size of output: 214 [2018-11-18 08:49:59,147 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2018-11-18 08:50:00,182 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 149 DAG size of output: 103 [2018-11-18 08:50:02,143 WARN L180 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 193 DAG size of output: 129 [2018-11-18 08:50:02,314 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2018-11-18 08:50:04,081 WARN L180 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 189 DAG size of output: 124 [2018-11-18 08:50:04,190 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 73 [2018-11-18 08:50:05,145 WARN L180 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 164 [2018-11-18 08:50:07,386 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 206 DAG size of output: 144 [2018-11-18 08:50:07,666 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 95 [2018-11-18 08:50:09,605 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 191 DAG size of output: 109 [2018-11-18 08:50:10,979 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 172 DAG size of output: 119 [2018-11-18 08:50:13,241 WARN L180 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 218 DAG size of output: 152 [2018-11-18 08:50:14,272 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 157 DAG size of output: 112 [2018-11-18 08:50:14,574 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 117 [2018-11-18 08:50:15,502 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2018-11-18 08:50:17,917 WARN L180 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 234 DAG size of output: 124 [2018-11-18 08:50:18,116 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 1 [2018-11-18 08:50:19,851 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 164 DAG size of output: 116 [2018-11-18 08:50:19,982 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2018-11-18 08:50:20,132 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 113 [2018-11-18 08:50:21,100 WARN L180 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 109 [2018-11-18 08:50:21,240 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2018-11-18 08:50:21,400 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 113 [2018-11-18 08:50:21,693 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-11-18 08:50:25,657 WARN L180 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 224 DAG size of output: 150 [2018-11-18 08:50:26,678 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 149 DAG size of output: 107 [2018-11-18 08:50:26,824 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 109 [2018-11-18 08:50:27,088 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 117 [2018-11-18 08:50:27,366 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 121 [2018-11-18 08:50:28,632 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 179 DAG size of output: 130 [2018-11-18 08:50:29,691 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 157 DAG size of output: 112 [2018-11-18 08:50:30,008 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 117 [2018-11-18 08:50:31,646 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 178 DAG size of output: 118 [2018-11-18 08:50:31,951 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 117 [2018-11-18 08:50:33,165 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 217 DAG size of output: 176 [2018-11-18 08:50:33,995 WARN L180 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 110 [2018-11-18 08:50:34,099 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-11-18 08:50:34,369 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 121 [2018-11-18 08:50:36,226 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 189 DAG size of output: 124 [2018-11-18 08:50:36,419 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2018-11-18 08:50:37,809 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 166 DAG size of output: 117 [2018-11-18 08:50:38,079 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 121 [2018-11-18 08:50:39,233 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 217 DAG size of output: 177 [2018-11-18 08:50:40,176 WARN L180 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 108 [2018-11-18 08:50:40,728 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2018-11-18 08:50:41,215 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 147 [2018-11-18 08:50:42,582 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 199 DAG size of output: 142 [2018-11-18 08:50:42,714 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2018-11-18 08:50:42,846 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2018-11-18 08:50:44,251 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 161 DAG size of output: 110 [2018-11-18 08:50:44,254 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-18 08:50:44,255 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 86 121) the Hoare annotation is: (let ((.cse49 (= ~t1_pc~0 1))) (let ((.cse8 (= 1 ~t2_pc~0)) (.cse42 (= ~m_st~0 0)) (.cse33 (= 1 ~m_pc~0)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse44 (= ~token~0 |old(~token~0)|)) (.cse43 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse41 (not .cse49)) (.cse50 (<= 2 ~m_st~0)) (.cse45 (= |old(~E_2~0)| ~E_2~0)) (.cse48 (= 0 ~t2_st~0)) (.cse46 (= |old(~t3_st~0)| ~t3_st~0)) (.cse47 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse6 (and .cse41 .cse50 .cse45 .cse48 .cse46 .cse47)) (.cse35 (and .cse41 .cse50 .cse43 .cse45 .cse46 .cse47)) (.cse37 (and .cse49 .cse50 .cse43 .cse44 .cse45 .cse46 .cse47)) (.cse39 (and .cse49 .cse50 .cse45 .cse48 .cse46 .cse47)) (.cse3 (< |old(~m_st~0)| 2)) (.cse38 (not .cse15)) (.cse22 (not .cse33)) (.cse28 (and .cse41 .cse42 .cse44 .cse45 .cse48 .cse46 .cse47)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse30 (not (= 1 ~t3_pc~0))) (.cse31 (< |old(~t3_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse27 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_3~0)) (.cse9 (= 1 ~E_1~0)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse40 (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 |old(~E_2~0)|)) (.cse13 (= |old(~t1_st~0)| 0)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse14 (= 0 ~E_3~0)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse16 (not (= 0 |old(~t3_st~0)|))) (.cse17 (= 1 ~E_M~0)) (.cse36 (not .cse8)) (.cse18 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse23 (= 0 ~E_1~0)) (.cse24 (< 0 ~t3_pc~0)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse30 .cse31 .cse17 .cse18 .cse32 .cse19 .cse20 .cse21 .cse23 .cse25 .cse26 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse14 .cse15 .cse35 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse37 .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse14 .cse29 .cse38 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse14 .cse15 .cse30 .cse31 .cse17 .cse36 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse3 .cse37 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse14 .cse29 .cse38 .cse30 .cse31 .cse17 .cse36 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse38 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse33) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse14 .cse29 .cse15 .cse40 .cse30 .cse31 .cse17 .cse36 .cse18 .cse32 .cse19 .cse20 .cse23 .cse25 .cse26 .cse33) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse40 .cse11 .cse12 .cse13 .cse34 .cse14 .cse29 .cse15 .cse16 .cse17 .cse36 .cse18 .cse32 .cse19 .cse20 .cse23 .cse24 .cse25 .cse26 .cse33))))) [2018-11-18 08:50:44,255 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-18 08:50:44,255 INFO L421 ceAbstractionStarter]: At program point L94(lines 89 120) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse36 (= ~t1_pc~0 1)) (.cse37 (<= 2 ~m_st~0)) (.cse38 (= |old(~E_2~0)| ~E_2~0)) (.cse39 (= |old(~t3_st~0)| ~t3_st~0)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (and .cse36 .cse37 .cse38 (= 0 ~t2_st~0) .cse39 .cse40)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse20 (not (= 0 |old(~t2_st~0)|))) (.cse15 (not (= 0 |old(~t3_st~0)|))) (.cse23 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse26 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse35 (and .cse36 .cse37 (= ~t2_st~0 |old(~t2_st~0)|) (= ~token~0 |old(~token~0)|) .cse38 .cse39 .cse40)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 |old(~E_2~0)|)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse27 (< |old(~t2_st~0)| 2)) (.cse13 (= 0 ~E_3~0)) (.cse28 (< |old(~token~0)| ~local~0)) (.cse33 (not (= 1 ~t3_pc~0))) (.cse34 (< |old(~t3_st~0)| 2)) (.cse16 (= 1 ~E_M~0)) (.cse30 (not .cse7)) (.cse17 (= ~T1_E~0 1)) (.cse18 (not (= 1 ~t3_i~0))) (.cse19 (not (= ~m_i~0 1))) (.cse21 (not .cse32)) (.cse22 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31 .cse18 .cse19 .cse22 .cse23 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse33 .cse34 .cse16 .cse30 .cse17 .cse31 .cse18 .cse19 .cse22 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse29 .cse15 .cse16 .cse17 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse29 .cse33 .cse34 .cse16 .cse30 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse29 .cse15 .cse16 .cse30 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse33 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse29 .cse33 .cse34 .cse16 .cse17 .cse31 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse33 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (or .cse35 .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse15 .cse16 .cse30 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse33 .cse34 .cse16 .cse30 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24 .cse25)))) [2018-11-18 08:50:44,256 INFO L421 ceAbstractionStarter]: At program point L115(lines 86 121) the Hoare annotation is: (let ((.cse35 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse47 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse29 (= ~token~0 |old(~token~0)|)) (.cse25 (= ~t1_pc~0 1)) (.cse46 (<= 2 ~m_st~0)) (.cse26 (not (= ~E_2~0 1))) (.cse27 (not (= ~E_2~0 0))) (.cse28 (not (= 0 ~t1_st~0))) (.cse30 (= 0 ~t2_st~0)) (.cse31 (= |old(~t3_st~0)| ~t3_st~0))) (let ((.cse39 (and .cse25 .cse46 .cse26 (<= ~token~0 (+ |old(~token~0)| 1)) .cse27 .cse28 .cse30 .cse31 (<= (+ ~local~0 1) ~token~0))) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse38 (and .cse24 .cse25 .cse47 .cse26 .cse27 .cse28 .cse29 .cse31)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse23 (not (= 0 |old(~t2_st~0)|))) (.cse41 (and .cse46 .cse25 .cse47 .cse26 .cse27 .cse28 .cse31)) (.cse42 (not (= 0 |old(~t3_st~0)|))) (.cse44 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse45 (and .cse25 .cse46 .cse47 .cse26 .cse27 .cse28 .cse31)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse40 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 |old(~E_2~0)|)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse36 (< |old(~t2_st~0)| 2)) (.cse13 (= 0 ~E_3~0)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse18 (= 1 ~E_M~0)) (.cse37 (not .cse7)) (.cse19 (= ~T1_E~0 1)) (.cse21 (not (= 1 ~t3_i~0))) (.cse22 (not (= ~m_i~0 1))) (.cse43 (not .cse35)) (.cse32 (= 0 ~E_1~0)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 ~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 .cse21 .cse22 .cse23 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) .cse32 .cse33 .cse34 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse37 .cse19 .cse20 .cse21 .cse22 .cse38 .cse32 .cse33 .cse34 .cse35) (or .cse39 .cse0 .cse1 .cse2 .cse3 .cse40 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse36 .cse13 .cse14 .cse42 .cse18 .cse37 .cse19 .cse21 .cse22 .cse43 .cse32 .cse44 .cse33 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse30) .cse42 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse32 .cse44 .cse33 .cse34 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse40 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse45 .cse11 .cse12 .cse36 .cse13 .cse14 .cse16 .cse17 .cse18 .cse37 .cse19 .cse21 .cse22 .cse39 .cse43 .cse32 .cse33 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse13 .cse14 .cse15 .cse42 .cse18 .cse37 .cse19 .cse20 .cse21 .cse22 .cse32 .cse44 .cse33 .cse34 .cse35) (or .cse0 .cse1 .cse3 .cse40 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 (and .cse25 .cse46 .cse26 .cse27 .cse28 .cse30 .cse31) .cse21 .cse22 .cse23 .cse43 .cse32 .cse33 .cse34) (or .cse0 .cse1 .cse3 .cse40 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse25 .cse46 .cse26 .cse27 .cse28 .cse31 .cse30) .cse42 .cse18 .cse19 .cse21 .cse22 .cse23 .cse43 .cse32 .cse44 .cse33 .cse34) (or .cse0 .cse1 .cse3 .cse40 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse13 .cse41 .cse15 .cse42 .cse18 .cse37 .cse19 .cse21 .cse22 .cse43 .cse32 .cse44 .cse33 .cse34) (or .cse0 .cse45 .cse1 .cse3 .cse40 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse13 .cse15 .cse16 .cse17 .cse18 .cse37 .cse19 .cse21 .cse22 .cse43 .cse32 .cse33 .cse34)))) [2018-11-18 08:50:44,256 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 86 121) no Hoare annotation was computed. [2018-11-18 08:50:44,256 INFO L421 ceAbstractionStarter]: At program point L111(line 111) the Hoare annotation is: (let ((.cse34 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse36 (= ~t1_pc~0 1)) (.cse37 (<= 2 ~m_st~0)) (.cse38 (not (= ~E_2~0 0))) (.cse39 (= |old(~t3_st~0)| ~t3_st~0)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (and .cse36 .cse37 .cse38 (= 0 ~t2_st~0) .cse39 .cse40)) (.cse26 (not (= 0 |old(~t3_st~0)|))) (.cse27 (< 0 ~t3_pc~0)) (.cse33 (not (= 0 |old(~m_st~0)|))) (.cse31 (= |old(~t1_pc~0)| 1)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 |old(~E_2~0)|)) (.cse35 (and .cse36 .cse37 (= ~t2_st~0 |old(~t2_st~0)|) (<= ~token~0 (+ |old(~token~0)| 1)) .cse38 .cse39 .cse40 (<= (+ ~local~0 1) ~token~0))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse13 (= 0 ~E_3~0)) (.cse30 (< |old(~token~0)| ~local~0)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse16 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse32 (not .cse7)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse22 (not .cse34)) (.cse23 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse30 .cse31 .cse26 .cse17 .cse32 .cse18 .cse33 .cse19 .cse20 .cse23 .cse27 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse30 .cse31 .cse15 .cse16 .cse17 .cse32 .cse18 .cse33 .cse19 .cse20 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse31 .cse26 .cse17 .cse18 .cse33 .cse19 .cse20 .cse21 .cse23 .cse27 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse31 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse31 .cse26 .cse17 .cse32 .cse18 .cse19 .cse20 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse28 .cse2 .cse35 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse30 .cse26 .cse17 .cse32 .cse18 .cse19 .cse20 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse31 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse29 .cse13 .cse30 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25)))) [2018-11-18 08:50:44,256 INFO L425 ceAbstractionStarter]: For program point L111-1(line 111) no Hoare annotation was computed. [2018-11-18 08:50:44,256 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 114) no Hoare annotation was computed. [2018-11-18 08:50:44,256 INFO L421 ceAbstractionStarter]: At program point L101-2(lines 89 120) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T3_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse31 (<= 2 ~m_st~0)) (.cse55 (= 0 ~t2_st~0)) (.cse35 (= 0 ~t1_st~0)) (.cse54 (= ~m_st~0 0)) (.cse32 (not (= ~E_2~0 1))) (.cse33 (not (= ~E_2~0 0))) (.cse34 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse30 (= 1 ~t2_pc~0)) (.cse49 (and .cse54 .cse32 .cse33 .cse34)) (.cse48 (and .cse54 .cse32 .cse33 .cse35)) (.cse50 (<= ~token~0 ~local~0)) (.cse51 (<= ~local~0 ~token~0)) (.cse47 (= 1 ~m_pc~0)) (.cse53 (and .cse31 .cse32 .cse33 .cse55 .cse34)) (.cse52 (and .cse31 .cse32 .cse33 .cse35 .cse55)) (.cse56 (not .cse4)) (.cse57 (not .cse1)) (.cse58 (not (= ~E_3~0 1))) (.cse59 (not (= ~M_E~0 1))) (.cse61 (not .cse2)) (.cse62 (not .cse0)) (.cse36 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse37 (= |old(~t3_st~0)| ~t3_st~0))) (let ((.cse7 (and (or (and .cse56 .cse57 .cse31 .cse58 .cse32 .cse59 .cse33 .cse61 .cse62 .cse34) (and .cse56 .cse57 .cse31 .cse58 .cse32 .cse59 .cse33 .cse35 .cse61 .cse62)) .cse36 .cse37)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse38 (not (= 0 |old(~t2_st~0)|))) (.cse3 (< |old(~m_st~0)| 2)) (.cse44 (or .cse53 .cse52)) (.cse41 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse42 (<= (+ ~local~0 1) ~token~0)) (.cse43 (= ~t1_pc~0 1)) (.cse27 (and (<= 2 ~t2_st~0) (= ~t1_i~0 1) .cse36 (let ((.cse60 (not (= ~E_1~0 1))) (.cse63 (not (= ~E_3~0 0)))) (or (and .cse56 .cse57 .cse31 .cse58 .cse32 .cse59 .cse33 .cse35 .cse60 .cse61 .cse62 .cse63) (and .cse56 .cse57 .cse31 .cse58 .cse32 .cse59 .cse33 .cse60 .cse61 .cse62 .cse34 .cse63))) .cse37)) (.cse23 (not .cse47)) (.cse39 (< ~local~0 |old(~token~0)|)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse45 (and (or .cse49 .cse48) .cse50 .cse36 .cse51 .cse37)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 |old(~E_2~0)|)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse13 (< |old(~t2_st~0)| 2)) (.cse14 (= 0 ~E_3~0)) (.cse40 (< |old(~token~0)| ~local~0)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse28 (not (= 0 |old(~t3_st~0)|))) (.cse18 (= 1 ~E_M~0)) (.cse19 (not .cse30)) (.cse20 (= ~T1_E~0 1)) (.cse46 (not (= 0 |old(~m_st~0)|))) (.cse21 (not (= 1 ~t3_i~0))) (.cse22 (not (= ~m_i~0 1))) (.cse24 (= 0 ~E_1~0)) (.cse29 (< 0 ~t3_pc~0)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse29 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse20 (and (or (and .cse31 .cse32 .cse33 .cse34) (and .cse31 .cse32 .cse33 .cse35)) .cse36 .cse37) .cse21 .cse22 .cse38 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse39 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse40 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse41 .cse42 .cse43 .cse44 .cse37)) (or .cse0 .cse1 .cse39 .cse2 .cse4 .cse5 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse45 .cse14 .cse40 .cse15 .cse28 .cse18 .cse20 .cse46 .cse21 .cse22 .cse38 .cse24 .cse29 .cse25 .cse26 .cse47) (or .cse0 .cse1 .cse39 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse40 .cse15 .cse16 .cse17 (and (or .cse48 .cse49) .cse50 .cse36 .cse51 .cse37) .cse18 .cse19 .cse20 .cse46 .cse21 .cse22 .cse24 .cse25 .cse26 .cse47) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse28 .cse18 .cse20 .cse21 .cse22 .cse38 .cse23 .cse24 .cse29 .cse25 .cse26 (and (or .cse52 .cse53) .cse37)) (or .cse0 (and .cse50 (or (and .cse54 .cse32 .cse33 .cse35 .cse55) (and .cse54 .cse32 .cse33 .cse55 .cse34)) .cse51 .cse37) .cse1 .cse39 .cse2 .cse4 .cse5 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse40 .cse15 .cse16 .cse17 .cse18 .cse20 .cse46 .cse21 .cse22 .cse38 .cse24 .cse25 .cse26 .cse47) (or .cse0 .cse1 .cse39 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse44 .cse41 .cse42 .cse43 .cse37) .cse40 .cse27 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse29 .cse25 .cse26) (or .cse0 .cse1 .cse39 .cse2 .cse4 .cse5 .cse6 .cse8 .cse45 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse40 .cse15 .cse28 .cse18 .cse19 .cse20 .cse46 .cse21 .cse22 .cse24 .cse29 .cse25 .cse26 .cse47))))) [2018-11-18 08:50:44,257 INFO L421 ceAbstractionStarter]: At program point transmit3ENTRY(lines 158 193) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse15 (= ~t1_pc~0 1)) (.cse32 (= |old(~t1_st~0)| 0)) (.cse40 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse48 (= ~m_st~0 0)) (.cse42 (= ~token~0 |old(~token~0)|)) (.cse39 (<= 2 ~m_st~0)) (.cse41 (= |old(~E_M~0)| ~E_M~0)) (.cse49 (= 0 ~t2_st~0)) (.cse43 (= |old(~t3_st~0)| ~t3_st~0)) (.cse44 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= ~t3_pc~0 0))) (let ((.cse11 (and .cse39 .cse41 .cse49 .cse43 .cse44 .cse45)) (.cse31 (and .cse48 .cse41 .cse42 .cse49 .cse43 .cse44 .cse45)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse34 (and .cse39 .cse41 .cse42 .cse49 .cse43 .cse44 .cse45)) (.cse36 (and .cse48 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse27 (< ~local~0 |old(~token~0)|)) (.cse28 (< |old(~token~0)| ~local~0)) (.cse6 (not .cse32)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse46 (and .cse39 .cse40 .cse41 .cse43 .cse44 .cse45)) (.cse3 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_3~0)) (.cse9 (= 1 ~E_1~0)) (.cse10 (= 1 ~E_2~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_2~0)) (.cse35 (< |old(~t2_st~0)| 2)) (.cse14 (= 0 ~E_3~0)) (.cse33 (not .cse15)) (.cse16 (= 0 |old(~t3_st~0)|)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse37 (not .cse8)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse22 (not .cse30)) (.cse23 (= 0 ~E_1~0)) (.cse24 (< 0 |old(~t3_pc~0)|)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse30 .cse31) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse32 .cse14 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse34 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse31 .cse32 .cse14 .cse28 .cse33 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse30) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse35 .cse14 .cse28 .cse36 .cse15 .cse16 .cse17 .cse37 .cse18 .cse29 .cse19 .cse20 .cse23 .cse24 .cse25 .cse26 .cse30) (let ((.cse38 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (< |old(~token~0)| .cse38) .cse9 .cse10 .cse12 .cse13 .cse32 .cse14 .cse33 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (< .cse38 |old(~token~0)|) .cse24 .cse25 .cse26)) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse12 .cse36 .cse13 .cse32 .cse35 .cse14 .cse28 .cse33 .cse16 .cse17 .cse37 .cse18 .cse29 .cse19 .cse20 .cse23 .cse24 .cse25 .cse26 .cse30) (or .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse35 .cse14 .cse28 .cse33 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse22 .cse23 (and .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse46 .cse35 .cse14 .cse15 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse47 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= 1 ~t3_pc~0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse7 .cse9 .cse10 .cse12 .cse13 .cse32 .cse35 .cse14 (< .cse47 |old(~token~0)|) .cse33 (not (= 1 |old(~t3_pc~0)|)) .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26 (< |old(~token~0)| .cse47))) (or .cse0 .cse1 .cse2 .cse46 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse12 .cse13 .cse32 .cse35 .cse14 .cse33 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,257 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-18 08:50:44,257 INFO L421 ceAbstractionStarter]: At program point L166(lines 161 192) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse32 (= 1 ~m_pc~0)) (.cse28 (= 1 ~t2_pc~0)) (.cse33 (= |old(~t1_st~0)| 0))) (let ((.cse27 (not .cse33)) (.cse4 (< |old(~m_st~0)| 2)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse18 (not .cse28)) (.cse22 (not .cse32)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse15 (not .cse29)) (.cse16 (= 0 |old(~t3_st~0)|)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse19 (= ~T1_E~0 1)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse23 (= 0 ~E_1~0)) (.cse24 (< 0 |old(~t3_pc~0)|)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 .cse13 .cse29 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse27 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse29 .cse16 .cse17 .cse19 .cse31 .cse20 .cse21 .cse30 .cse23 .cse24 .cse25 .cse26 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse32) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 .cse33 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse32) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse34 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse34) .cse8 .cse9 .cse10 .cse11 .cse33 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 (< .cse34 |old(~token~0)|) .cse24 .cse25 .cse26)) (let ((.cse35 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~t3_pc~0) (<= 2 ~m_st~0) (= ~t2_st~0 |old(~t2_st~0)|) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 (< .cse35 |old(~token~0)|) .cse15 (not (= 1 |old(~t3_pc~0)|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 (< |old(~token~0)| .cse35))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse21 .cse30 .cse23 .cse24 .cse25 .cse26 .cse32)))) [2018-11-18 08:50:44,258 INFO L421 ceAbstractionStarter]: At program point L187(lines 158 193) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse33 (= ~t1_pc~0 1)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse51 (= 0 ~t2_st~0)) (.cse49 (= ~m_st~0 0)) (.cse45 (= ~token~0 |old(~token~0)|)) (.cse40 (= 1 ~t3_pc~0)) (.cse41 (<= 2 ~m_st~0)) (.cse42 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse43 (= |old(~E_M~0)| ~E_M~0)) (.cse44 (<= 2 ~t3_st~0)) (.cse46 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse38 (and .cse40 .cse41 .cse42 .cse43 .cse44 .cse46)) (.cse37 (and .cse40 .cse49 .cse42 .cse43 .cse44 .cse45 .cse46)) (.cse31 (and .cse40 .cse41 .cse43 .cse44 .cse45 .cse51 .cse46)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse30 (not .cse12)) (.cse27 (and .cse40 .cse49 .cse43 .cse44 .cse45 .cse51 .cse46)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse34 (and .cse40 .cse41 .cse43 .cse44 .cse51 .cse46)) (.cse22 (not (= 0 |old(~t2_st~0)|))) (.cse24 (< 0 |old(~t3_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse29 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse35 (< |old(~t2_st~0)| 2)) (.cse13 (= 0 ~E_3~0)) (.cse15 (not .cse33)) (.cse16 (= 0 |old(~t3_st~0)|)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse36 (not .cse7)) (.cse18 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse32 (not .cse28)) (.cse23 (= 0 ~E_1~0)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse33 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse33 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse37 .cse28) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse15 .cse38 .cse16 .cse17 .cse36 .cse18 .cse20 .cse21 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse38 .cse1 .cse3 .cse29 .cse4 .cse5 .cse30 .cse6 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse33 .cse16 .cse17 .cse36 .cse18 .cse20 .cse21 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (let ((.cse39 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse39) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse21 .cse22 .cse32 .cse23 (< .cse39 |old(~token~0)|) .cse24 .cse25 .cse26 .cse31)) (or .cse0 .cse1 .cse2 .cse3 (and .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) .cse29 .cse4 .cse5 .cse30 .cse6 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse21 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse13 .cse14 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28) (or .cse0 .cse1 .cse34 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26) (let ((.cse47 (not (= ~E_M~0 0))) (.cse48 (not (= ~E_M~0 1))) (.cse50 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 (and .cse40 .cse41 .cse47 .cse42 .cse48 .cse44 .cse46) (and .cse40 .cse49 .cse47 .cse42 .cse48 .cse44 (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) .cse46) (< .cse50 |old(~token~0)|) .cse15 (not (= 1 |old(~t3_pc~0)|)) .cse16 .cse17 .cse36 .cse18 .cse20 .cse21 .cse32 .cse23 .cse25 .cse26 (< |old(~token~0)| .cse50)))))) [2018-11-18 08:50:44,259 INFO L421 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (let ((.cse31 (= ~t1_pc~0 1)) (.cse34 (= 1 ~m_pc~0)) (.cse30 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_st~0)| 0))) (let ((.cse29 (not .cse11)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse18 (not .cse30)) (.cse3 (< |old(~m_st~0)| 2)) (.cse22 (not .cse34)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse26 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 ~E_1~0)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse27 (< |old(~token~0)| ~local~0)) (.cse15 (not .cse31)) (.cse16 (= 0 |old(~t3_st~0)|)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse19 (= ~T1_E~0 1)) (.cse33 (not (= 0 |old(~m_st~0)|))) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse23 (= 0 ~E_1~0)) (.cse28 (< 0 |old(~t3_pc~0)|)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|))) (and (let ((.cse14 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< .cse14 |old(~token~0)|) .cse15 (not (= 1 |old(~t3_pc~0)|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (< |old(~token~0)| .cse14) (and (= 1 ~t3_pc~0) (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (= ~t2_st~0 |old(~t2_st~0)|) (<= ~token~0 (+ ~local~0 3)) (= |old(~t3_st~0)| ~t3_st~0) (<= (+ |old(~token~0)| 1) ~token~0) (= |old(~t1_st~0)| ~t1_st~0)))) (or .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse28 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse30 .cse7 .cse8 .cse9 .cse10 .cse13 .cse31 .cse16 .cse17 .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse28 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse29 .cse6 .cse30 .cse7 .cse8 .cse9 .cse10 .cse13 .cse27 .cse31 .cse16 .cse17 .cse19 .cse33 .cse20 .cse21 .cse32 .cse23 .cse28 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse27 .cse31 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21 .cse23 .cse28 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse28 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse28 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse9 .cse10 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse28 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21 .cse23 .cse28 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse31 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse28 .cse24 .cse25) (let ((.cse35 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse35) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 (< .cse35 |old(~token~0)|) .cse28 .cse24 .cse25)) (or .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse33 .cse20 .cse21 .cse32 .cse23 .cse28 .cse24 .cse25 .cse34)))) [2018-11-18 08:50:44,259 INFO L425 ceAbstractionStarter]: For program point L183-1(line 183) no Hoare annotation was computed. [2018-11-18 08:50:44,259 INFO L425 ceAbstractionStarter]: For program point transmit3EXIT(lines 158 193) no Hoare annotation was computed. [2018-11-18 08:50:44,259 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 186) no Hoare annotation was computed. [2018-11-18 08:50:44,259 INFO L421 ceAbstractionStarter]: At program point L173-2(lines 161 192) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T3_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse52 (not .cse5)) (.cse34 (<= 2 ~m_st~0)) (.cse51 (= 0 ~t2_st~0)) (.cse53 (not .cse4)) (.cse54 (not .cse0)) (.cse55 (not (= ~E_2~0 0)))) (let ((.cse9 (= 1 ~t2_pc~0)) (.cse38 (= |old(~t1_st~0)| 0)) (.cse28 (= 1 ~m_pc~0)) (.cse16 (= ~t1_pc~0 1)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse49 (and (not (= ~t2_pc~0 1)) .cse52 .cse34 .cse51 .cse53 .cse54 .cse55)) (.cse37 (= ~m_st~0 0)) (.cse47 (= |old(~E_M~0)| ~E_M~0)) (.cse48 (= ~token~0 |old(~token~0)|)) (.cse32 (= |old(~t3_st~0)| ~t3_st~0)) (.cse33 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and .cse37 .cse47 .cse48 .cse51 .cse32 .cse33)) (.cse46 (and .cse32 .cse33 .cse49 .cse47)) (.cse44 (and (and .cse52 .cse34 .cse53 .cse54 .cse55) .cse31 .cse32 .cse33 .cse47)) (.cse29 (< |old(~m_st~0)| 2)) (.cse41 (not .cse16)) (.cse23 (not (= 0 |old(~t2_st~0)|))) (.cse43 (not .cse28)) (.cse1 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not .cse38)) (.cse8 (= 1 ~E_3~0)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 ~E_2~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_2~0)) (.cse45 (and .cse37 .cse31 .cse47 .cse48 .cse32 .cse33)) (.cse39 (< |old(~t2_st~0)| 2)) (.cse14 (= 0 ~E_3~0)) (.cse15 (< |old(~token~0)| ~local~0)) (.cse17 (= 0 |old(~t3_st~0)|)) (.cse18 (= 1 |old(~E_M~0)|)) (.cse42 (not .cse9)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse21 (not (= 1 ~t3_i~0))) (.cse22 (not (= ~m_i~0 1))) (.cse24 (= 0 ~E_1~0)) (.cse25 (< 0 |old(~t3_pc~0)|)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse30 (= 1 ~t3_pc~0)) (.cse36 (not (= ~E_M~0 1))) (.cse35 (not (= ~E_M~0 0))) (.cse40 (+ ~local~0 2))) (or .cse0 .cse1 .cse4 .cse29 .cse5 .cse6 .cse8 .cse10 .cse11 (and .cse30 .cse31 .cse32 .cse33 (and .cse34 .cse35) .cse36) .cse12 (and .cse30 .cse37 .cse31 .cse36 (<= ~token~0 (+ ~local~0 3)) .cse35 .cse32 (<= (+ |old(~token~0)| 1) ~token~0) .cse33) .cse13 .cse38 .cse39 .cse14 (< .cse40 |old(~token~0)|) .cse41 (not (= 1 |old(~t3_pc~0)|)) .cse17 .cse18 .cse42 .cse19 .cse21 .cse22 .cse43 .cse24 .cse26 .cse27 (< |old(~token~0)| .cse40))) (or .cse0 .cse1 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse44 .cse39 .cse14 .cse16 .cse17 .cse18 .cse42 .cse19 .cse21 .cse22 .cse43 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse38 .cse39 .cse14 .cse15 .cse41 .cse17 .cse18 .cse42 .cse19 .cse20 .cse21 .cse22 .cse45 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse46 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse43 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse39 .cse14 .cse15 .cse41 .cse17 .cse18 .cse42 .cse19 .cse21 .cse22 .cse43 (and .cse34 .cse31 .cse47 .cse48 .cse32 .cse33) .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse38 .cse14 .cse15 .cse41 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse46 .cse4 .cse29 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse38 .cse14 .cse41 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse43 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse32 .cse33 .cse49 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse47) .cse14 .cse15 .cse41 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse43 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse4 .cse29 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse38 .cse44 .cse39 .cse14 .cse41 .cse17 .cse18 .cse42 .cse19 .cse21 .cse22 .cse43 .cse24 .cse25 .cse26 .cse27) (let ((.cse50 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 .cse29 .cse5 .cse6 .cse8 (< |old(~token~0)| .cse50) .cse10 .cse11 .cse12 .cse13 .cse38 .cse14 .cse41 (and .cse48 .cse32 (and .cse34 .cse51) .cse33 .cse47) .cse17 .cse18 .cse42 .cse19 .cse21 .cse22 .cse23 .cse43 .cse24 (< .cse50 |old(~token~0)|) .cse25 .cse26 .cse27)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse45 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse42 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28)))))) [2018-11-18 08:50:44,260 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2018-11-18 08:50:44,260 INFO L421 ceAbstractionStarter]: At program point L151(lines 122 157) the Hoare annotation is: (let ((.cse37 (= |old(~t1_st~0)| 0)) (.cse17 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse47 (= ~token~0 |old(~token~0)|)) (.cse41 (not (= ~E_3~0 1))) (.cse46 (not (= ~E_3~0 0))) (.cse40 (<= 2 ~m_st~0)) (.cse43 (= 1 ~t2_pc~0)) (.cse38 (= |old(~E_3~0)| ~E_3~0)) (.cse48 (= |old(~t3_st~0)| ~t3_st~0)) (.cse44 (<= 2 ~t2_st~0)) (.cse45 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse30 (and .cse40 .cse43 .cse38 .cse48 .cse44 .cse45)) (.cse36 (and .cse40 .cse41 .cse43 .cse48 .cse44 .cse45 .cse46)) (.cse18 (not (= 1 ~t3_pc~0))) (.cse19 (< |old(~t3_st~0)| 2)) (.cse29 (< |old(~m_st~0)| 2)) (.cse34 (and .cse40 .cse43 .cse47 .cse38 .cse48 .cse44 .cse45)) (.cse32 (not .cse28)) (.cse35 (not .cse17)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (not .cse37)) (.cse9 (= 1 |old(~E_3~0)|)) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse11 (= 1 ~E_1~0)) (.cse12 (= 1 ~E_2~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (= 0 ~E_2~0)) (.cse15 (= 0 |old(~E_3~0)|)) (.cse6 (and (= ~m_st~0 0) .cse43 .cse47 .cse38 .cse48 .cse44 .cse45)) (.cse16 (< |old(~token~0)| ~local~0)) (.cse31 (not (= 0 |old(~t3_st~0)|))) (.cse20 (= 1 ~E_M~0)) (.cse21 (= ~T1_E~0 1)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse23 (not (= 1 ~t3_i~0))) (.cse24 (not (= ~m_i~0 1))) (.cse25 (= 0 ~E_1~0)) (.cse33 (< 0 ~t3_pc~0)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse30 .cse31 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse33 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse35 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse36 .cse3 .cse4 .cse29 .cse5 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse37 .cse15 .cse35 .cse31 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse33 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse15 .cse16 .cse35 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse30 .cse3 .cse4 .cse29 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse15 .cse35 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse38 .cse37 .cse15 .cse35 .cse31 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse33 .cse26 .cse27) (let ((.cse39 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse7 .cse9 (< |old(~token~0)| .cse39) .cse11 .cse12 .cse36 .cse13 .cse14 .cse37 .cse15 .cse35 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse32 (let ((.cse42 (+ ~local~0 2))) (and .cse40 .cse41 (<= ~token~0 .cse42) .cse43 (= 0 ~t3_st~0) .cse44 .cse45 .cse46 (<= .cse42 ~token~0))) .cse25 (< .cse39 |old(~token~0)|) .cse26 .cse27)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse16 .cse35 .cse31 .cse20 .cse21 .cse23 .cse24 .cse32 .cse25 .cse33 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse15 .cse16 .cse35 .cse31 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse6 .cse33 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse16 .cse17 .cse31 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse27 .cse28)))) [2018-11-18 08:50:44,261 INFO L421 ceAbstractionStarter]: At program point L147(line 147) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse13 (= |old(~t1_st~0)| 0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse30 (< ~local~0 |old(~token~0)|)) (.cse31 (< |old(~token~0)| ~local~0)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse35 (<= 2 ~m_st~0)) (.cse36 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse38 (= 1 ~t2_pc~0)) (.cse39 (= |old(~t3_st~0)| ~t3_st~0)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (not (= ~E_3~0 0))) (.cse15 (not .cse29)) (.cse26 (not (= 0 |old(~t3_st~0)|))) (.cse27 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse28 (not .cse13)) (.cse7 (= 1 |old(~E_3~0)|)) (.cse8 (= 1 |old(~t2_pc~0)|)) (.cse9 (= 1 ~E_1~0)) (.cse10 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 ~E_2~0)) (.cse14 (= 0 |old(~E_3~0)|)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not .cse33)) (.cse23 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse15 .cse26 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse27 .cse24 .cse25 .cse33) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse29 .cse26 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse27 .cse24 .cse25 .cse33) (let ((.cse34 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse34) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (let ((.cse37 (+ ~local~0 2))) (and .cse35 .cse36 (<= ~token~0 .cse37) .cse38 .cse39 .cse40 .cse41 (<= .cse37 ~token~0))) .cse23 (< .cse34 |old(~token~0)|) .cse24 .cse25)) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse24 .cse25 .cse33) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse29 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse24 .cse25 .cse33) (or (and .cse35 .cse36 .cse38 .cse39 .cse40 .cse41) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2018-11-18 08:50:44,261 INFO L425 ceAbstractionStarter]: For program point L147-1(line 147) no Hoare annotation was computed. [2018-11-18 08:50:44,261 INFO L425 ceAbstractionStarter]: For program point transmit2EXIT(lines 122 157) no Hoare annotation was computed. [2018-11-18 08:50:44,261 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 150) no Hoare annotation was computed. [2018-11-18 08:50:44,261 INFO L421 ceAbstractionStarter]: At program point L137-2(lines 125 156) the Hoare annotation is: (let ((.cse5 (= ~T2_E~0 0)) (.cse46 (= ~m_i~0 1)) (.cse43 (<= 2 ~m_st~0)) (.cse2 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse40 (= 1 ~m_pc~0)) (.cse44 (not (= ~E_3~0 0)))) (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse37 (= ~t1_pc~0 1)) (.cse10 (and (not .cse5) .cse46 .cse43 (not (= ~E_M~0 0)) (not .cse2) (not .cse0) .cse40 .cse44 (not (= ~E_1~0 0)) (= ~t2_i~0 1) (not (= ~E_2~0 0)))) (.cse8 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse47 (= |old(~E_3~0)| ~E_3~0)) (.cse31 (= |old(~t3_st~0)| ~t3_st~0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse7 (not (= ~E_3~0 1))) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse38 (and (= ~m_st~0 0) .cse8 (= ~token~0 |old(~token~0)|) .cse47 .cse31 .cse9)) (.cse34 (< ~local~0 |old(~token~0)|)) (.cse45 (and .cse8 .cse47 .cse31 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0))) (.cse36 (< |old(~token~0)| ~local~0)) (.cse20 (not .cse37)) (.cse21 (not (= 1 ~t3_pc~0))) (.cse22 (< |old(~t3_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse6 (= 1 ~M_E~0)) (.cse35 (not .cse18)) (.cse12 (= 1 |old(~E_3~0)|)) (.cse32 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (= 0 ~E_2~0)) (.cse19 (= 0 |old(~E_3~0)|)) (.cse41 (not (= 0 |old(~t3_st~0)|))) (.cse33 (and .cse8 .cse47 .cse31 .cse9 .cse10)) (.cse23 (= 1 ~E_M~0)) (.cse24 (= ~T1_E~0 1)) (.cse25 (not (= 1 ~t3_i~0))) (.cse26 (not .cse46)) (.cse27 (not .cse40)) (.cse28 (= 0 ~E_1~0)) (.cse42 (< 0 ~t3_pc~0)) (.cse29 (not (= 1 ~t2_i~0))) (.cse30 (= 0 ~E_M~0))) (and (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse11 (+ ~local~0 2))) (and .cse7 .cse8 (= 0 ~t3_st~0) .cse9 .cse10 (<= .cse11 ~token~0) (<= ~token~0 .cse11))) .cse12 (< |old(~token~0)| .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (< .cse13 |old(~token~0)|) .cse29 .cse30 (and .cse7 .cse8 .cse31 .cse9 .cse10))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse32 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse5 .cse6 .cse35 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse19 .cse36 .cse37 .cse21 .cse22 .cse38 .cse23 .cse24 .cse39 .cse25 .cse26 .cse28 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse5 .cse6 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse36 .cse20 .cse41 .cse23 .cse24 .cse39 .cse25 .cse26 .cse28 .cse42 .cse29 .cse30 .cse38 .cse40) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse38 .cse5 .cse6 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse36 .cse20 .cse21 .cse22 .cse23 .cse24 .cse39 .cse25 .cse26 .cse28 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse41 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse42 .cse29 .cse30 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse7 .cse8 .cse31 (and .cse43 .cse44) .cse9) .cse19 .cse20 .cse41 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse42 .cse29 .cse30) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse19 .cse36 .cse20 .cse41 .cse45 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse42 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse19 .cse37 .cse21 .cse22 .cse33 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse5 .cse6 .cse35 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse19 .cse36 .cse37 .cse41 .cse23 .cse24 .cse39 .cse25 .cse26 .cse38 .cse28 .cse42 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse45 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse19 .cse36 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse19 .cse37 .cse41 .cse33 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse42 .cse29 .cse30))))) [2018-11-18 08:50:44,262 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 133) no Hoare annotation was computed. [2018-11-18 08:50:44,262 INFO L421 ceAbstractionStarter]: At program point transmit2ENTRY(lines 122 157) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse44 (= ~token~0 |old(~token~0)|)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse46 (not (= ~t2_pc~0 1))) (.cse37 (<= 2 ~m_st~0)) (.cse38 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse40 (= |old(~E_3~0)| ~E_3~0)) (.cse41 (= |old(~t3_st~0)| ~t3_st~0)) (.cse42 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse30 (and .cse46 .cse37 .cse38 .cse40 .cse41 .cse42)) (.cse7 (not .cse31)) (.cse36 (and .cse46 .cse37 .cse38 .cse44 .cse40 .cse41 .cse42)) (.cse33 (not (= 0 |old(~t3_st~0)|))) (.cse35 (< 0 ~t3_pc~0)) (.cse39 (= 1 ~t2_pc~0)) (.cse29 (< |old(~m_st~0)| 2)) (.cse43 (not .cse9)) (.cse34 (not .cse28)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 |old(~E_3~0)|)) (.cse10 (= 1 ~E_1~0)) (.cse14 (and .cse46 (= ~m_st~0 0) .cse38 .cse44 .cse40 .cse41 .cse42)) (.cse11 (= 1 ~E_2~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_2~0)) (.cse15 (= 0 |old(~E_3~0)|)) (.cse16 (< |old(~token~0)| ~local~0)) (.cse32 (not .cse17)) (.cse18 (not (= 1 ~t3_pc~0))) (.cse19 (< |old(~t3_st~0)| 2)) (.cse20 (= 1 ~E_M~0)) (.cse21 (= ~T1_E~0 1)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse23 (not (= 1 ~t3_i~0))) (.cse24 (not (= ~m_i~0 1))) (.cse25 (= 0 ~E_1~0)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15 .cse32 .cse33 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse35 .cse26 .cse27) (or .cse0 .cse30 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15 .cse32 .cse18 .cse19 .cse30 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse36 .cse16 .cse32 .cse33 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse35 .cse26 .cse27) (or (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15 .cse32 .cse33 .cse20 .cse43 .cse21 .cse23 .cse24 .cse34 .cse25 .cse35 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13 .cse15 .cse16 .cse17 .cse33 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse35 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse33 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse35 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse32 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse36 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse31 .cse15 .cse16 .cse32 .cse33 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse35 .cse26 .cse27 .cse28) (let ((.cse45 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 (and .cse37 .cse38 .cse39 .cse44 .cse40 .cse41 .cse42) .cse29 .cse5 .cse6 .cse8 (< |old(~token~0)| .cse45) .cse10 .cse11 .cse12 .cse13 .cse31 .cse15 .cse32 .cse18 .cse19 .cse20 .cse43 .cse21 .cse23 .cse24 .cse34 .cse25 (< .cse45 |old(~token~0)|) .cse26 .cse27)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse31 .cse15 .cse16 .cse32 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)))) [2018-11-18 08:50:44,262 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-18 08:50:44,263 INFO L421 ceAbstractionStarter]: At program point L130(lines 125 156) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse13 (= |old(~t1_st~0)| 0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse26 (not (= 0 |old(~t3_st~0)|))) (.cse27 (< 0 ~t3_pc~0)) (.cse34 (<= 2 ~m_st~0)) (.cse35 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse36 (= 1 ~t2_pc~0)) (.cse37 (= |old(~E_3~0)| ~E_3~0)) (.cse38 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (not .cse29)) (.cse30 (< ~local~0 |old(~token~0)|)) (.cse31 (< |old(~token~0)| ~local~0)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse28 (not .cse13)) (.cse7 (= 1 |old(~E_3~0)|)) (.cse8 (= 1 |old(~t2_pc~0)|)) (.cse9 (= 1 ~E_1~0)) (.cse10 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 ~E_2~0)) (.cse14 (= 0 |old(~E_3~0)|)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not .cse33)) (.cse23 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse15 .cse26 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse27 .cse24 .cse25 .cse33) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse29 .cse26 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse27 .cse24 .cse25 .cse33) (or (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25) (let ((.cse40 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (and .cse34 .cse35 .cse36 (= ~token~0 |old(~token~0)|) .cse37 .cse38 .cse39) .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse40) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse40 |old(~token~0)|) .cse24 .cse25)) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse24 .cse25 .cse33) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse31 .cse29 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse24 .cse25 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2018-11-18 08:50:44,263 INFO L425 ceAbstractionStarter]: For program point L718(line 718) no Hoare annotation was computed. [2018-11-18 08:50:44,263 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 712 723) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (= 1 |old(~t3_i~0)|) (< |old(~local~0)| |old(~token~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (not (= ~t3_i~0 1)) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (not (= ~m_i~0 1)) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~m_i~0)| 1) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~t2_i~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,263 INFO L421 ceAbstractionStarter]: At program point L717(line 717) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (= 1 |old(~t3_i~0)|) (< |old(~local~0)| |old(~token~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (not (= ~t3_i~0 1)) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (not (= ~m_i~0 1)) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~m_i~0)| 1) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~t2_i~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,263 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 712 723) no Hoare annotation was computed. [2018-11-18 08:50:44,264 INFO L421 ceAbstractionStarter]: At program point L717-1(line 717) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (= 1 |old(~t3_i~0)|) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~m_i~0)| 1) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~t2_i~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (= ~m_i~0 1) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= ~t3_i~0 1) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,264 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 712 723) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L428 ceAbstractionStarter]: At program point L640(line 640) the Hoare annotation is: true [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point L640-1(line 640) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L428 ceAbstractionStarter]: At program point L649(lines 638 651) the Hoare annotation is: true [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 634 652) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 634 652) the Hoare annotation is: true [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 634 652) no Hoare annotation was computed. [2018-11-18 08:50:44,265 INFO L421 ceAbstractionStarter]: At program point L247(lines 235 249) the Hoare annotation is: (let ((.cse44 (= 0 ~t2_st~0)) (.cse43 (= 1 ~m_pc~0)) (.cse35 (= 1 ~t2_pc~0))) (let ((.cse18 (= 0 ~t3_st~0)) (.cse38 (= ~t1_pc~0 1)) (.cse13 (= ~t1_st~0 0)) (.cse19 (not .cse35)) (.cse24 (not .cse43)) (.cse9 (= 1 ~E_2~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse15 (= 0 ~E_3~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse0 (= 1 ~E_M~0)) (.cse20 (= ~T1_E~0 1)) (.cse23 (not (= ~m_i~0 1))) (.cse36 (not .cse44)) (.cse25 (= 0 ~E_1~0)) (.cse42 (< 0 ~t3_pc~0)) (.cse26 (not (= 1 ~t2_i~0))) (.cse37 (= 0 ~E_M~0)) (.cse12 (= 0 ~E_2~0))) (let ((.cse29 (or .cse9 (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse0 .cse20 .cse23 .cse35 .cse36 .cse25 .cse42 .cse26 .cse37 .cse12 .cse43))) (.cse33 (or .cse9 (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse0 .cse19 .cse20 .cse23 .cse24 .cse25 .cse26 .cse37 .cse12))) (.cse39 (or (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse0 .cse19 .cse20 .cse23 .cse25 .cse26 .cse37 .cse12 .cse43) .cse9)) (.cse21 (not (= 0 ~m_st~0))) (.cse41 (or .cse9 (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse0 .cse20 .cse23 .cse35 .cse36 .cse25 .cse26 .cse37 .cse12 .cse43))) (.cse27 (< ~local~0 ~token~0)) (.cse28 (< ~token~0 ~local~0)) (.cse7 (= 1 ~E_3~0)) (.cse14 (< ~t2_st~0 2)) (.cse40 (or .cse9 (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse0 .cse19 .cse20 .cse23 .cse25 .cse42 .cse26 .cse37 .cse12 .cse43))) (.cse31 (not .cse13)) (.cse17 (not (= 1 ~t3_pc~0))) (.cse32 (< ~t3_st~0 2)) (.cse34 (< ~m_st~0 2)) (.cse8 (= 1 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse10 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse16 (not .cse38)) (.cse30 (not .cse18)) (.cse22 (not (= 1 ~t3_i~0)))) (and (let ((.cse6 (+ ~local~0 3))) (or (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse6 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (< ~token~0 .cse6))) (or .cse7 .cse22 .cse10 .cse27 .cse28 .cse11 .cse29 .cse30 .cse31) (or .cse7 .cse22 .cse14 .cse10 .cse16 .cse11 .cse32 .cse17 .cse13 .cse33) (or .cse10 .cse22 (or .cse1 .cse2 .cse15 .cse3 .cse34 .cse32 .cse4 .cse5 .cse0 .cse20 .cse7 .cse23 .cse35 .cse8 .cse36 .cse24 .cse25 .cse26 .cse37 .cse12) .cse16 .cse11 .cse17) (or .cse1 .cse2 .cse3 .cse34 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse37) (or .cse7 .cse22 .cse10 .cse11 .cse38 .cse29 .cse30 .cse31) (or .cse7 .cse22 .cse14 .cse39 .cse10 .cse16 .cse11 .cse32 .cse17 .cse13) (or .cse7 .cse22 .cse14 .cse40 .cse16 .cse11 .cse13 .cse30 .cse10) (or .cse7 .cse22 .cse16 .cse11 .cse32 .cse17 .cse13 .cse41 .cse10) (or .cse10 .cse7 .cse22 .cse27 .cse28 .cse11 .cse32 .cse17 .cse41 .cse31) (or .cse7 .cse22 .cse16 .cse11 .cse10 .cse13 .cse29 .cse30) (or .cse14 .cse39 .cse27 .cse28 .cse32 .cse17 .cse31 .cse7 .cse22 .cse11 .cse10) (or .cse14 .cse10 .cse27 .cse16 .cse28 .cse32 .cse17 .cse33 .cse7 .cse22 .cse11) (or .cse22 (or .cse1 .cse2 .cse15 .cse3 .cse34 .cse4 .cse5 .cse0 .cse20 .cse7 .cse23 .cse35 .cse8 .cse36 .cse24 .cse25 .cse42 .cse26 .cse37 .cse12) .cse10 .cse16 .cse11 .cse30) (or .cse7 .cse22 .cse14 .cse39 .cse10 .cse11 .cse38 .cse32 .cse17 .cse31) (or .cse10 .cse1 .cse2 .cse3 .cse34 .cse4 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse0 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse37) (or .cse1 .cse2 .cse27 .cse3 .cse4 .cse31 .cse7 .cse35 .cse8 .cse9 .cse11 .cse12 .cse15 .cse28 .cse38 .cse30 .cse0 .cse20 .cse21 .cse22 .cse23 .cse36 .cse25 .cse42 .cse26 .cse37 .cse10 .cse43) (or .cse10 .cse7 .cse22 .cse11 .cse38 .cse32 .cse17 .cse41 .cse31) (or .cse10 .cse7 .cse22 .cse14 .cse40 .cse27 .cse28 .cse11 .cse30 .cse31) (or .cse7 .cse22 .cse14 .cse40 .cse10 .cse11 .cse38 .cse30 .cse31) (let ((.cse45 (+ ~local~0 2))) (or .cse1 .cse2 .cse3 .cse44 .cse34 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 (< .cse45 ~token~0) .cse16 .cse17 .cse32 .cse0 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse37 (< ~token~0 .cse45) .cse10)) (or .cse1 .cse2 .cse3 .cse44 .cse34 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse10 .cse15 .cse16 .cse30 .cse0 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse42 .cse26 .cse37))))) [2018-11-18 08:50:44,267 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 232 250) no Hoare annotation was computed. [2018-11-18 08:50:44,267 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2018-11-18 08:50:44,267 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 245) no Hoare annotation was computed. [2018-11-18 08:50:44,267 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 245) no Hoare annotation was computed. [2018-11-18 08:50:44,267 INFO L428 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 232 250) the Hoare annotation is: true [2018-11-18 08:50:44,267 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 232 250) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 415 462) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= |old(~T3_E~0)| 0)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 1 |old(~M_E~0)|)) (.cse10 (= ~t1_st~0 0)) (.cse5 (= 1 |old(~E_3~0)|)) (.cse15 (= 1 ~t2_pc~0)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse7 (= 1 |old(~E_2~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 |old(~E_2~0)|)) (.cse11 (= 0 |old(~E_3~0)|)) (.cse12 (= ~t1_pc~0 1)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse16 (= |old(~T1_E~0)| 1)) (.cse17 (not (= 1 ~t3_i~0))) (.cse13 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse18 (not (= ~m_i~0 1))) (.cse20 (= 0 |old(~E_1~0)|)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 |old(~E_M~0)|)) (.cse19 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 (< ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~t2_st~0 2) .cse11 (not .cse12) .cse13 (not (= 1 ~t3_pc~0)) (< ~t3_st~0 2) .cse14 (not .cse15) .cse16 .cse17 .cse18 (not .cse19) .cse20 .cse21 .cse22) (or .cse0 .cse1 (< ~local~0 ~token~0) .cse2 .cse3 .cse4 (not .cse10) .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse11 (< ~token~0 ~local~0) .cse12 (not (= 0 ~t3_st~0)) .cse14 .cse16 (not (= 0 ~m_st~0)) .cse17 .cse13 .cse18 (not (= 0 ~t2_st~0)) .cse20 (< 0 ~t3_pc~0) .cse21 .cse22 .cse19))) [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L434-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L449-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 415 462) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 415 462) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point L419-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 194 212) no Hoare annotation was computed. [2018-11-18 08:50:44,268 INFO L421 ceAbstractionStarter]: At program point L209(lines 197 211) the Hoare annotation is: (let ((.cse38 (= 0 ~t2_st~0)) (.cse41 (= 0 ~t3_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse7 (= 1 ~t2_pc~0)) (.cse32 (= ~t1_st~0 0)) (.cse26 (= 1 ~m_pc~0)) (.cse42 (+ ~local~0 1))) (let ((.cse31 (< ~token~0 .cse42)) (.cse37 (< .cse42 ~token~0)) (.cse29 (< ~t3_st~0 2)) (.cse30 (< ~m_st~0 2)) (.cse8 (= 1 ~E_1~0)) (.cse28 (not (= 1 ~t3_pc~0))) (.cse36 (not .cse26)) (.cse5 (not .cse32)) (.cse33 (< ~t2_st~0 2)) (.cse35 (not .cse7)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse27 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse9 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 ~E_2~0)) (.cse10 (= 0 is_master_triggered_~__retres1~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< ~token~0 ~local~0)) (.cse34 (not .cse15)) (.cse16 (not .cse41)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse21 (not .cse38)) (.cse22 (= 0 ~E_1~0)) (.cse23 (< 0 ~t3_pc~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= 0 ~m_st~0)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse27 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse15 .cse28 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse27 .cse6 .cse31 .cse8 .cse11 .cse12 .cse32 .cse10 .cse33 .cse13 .cse34 .cse28 .cse29 .cse17 .cse35 .cse18 .cse19 .cse20 .cse36 .cse22 .cse37 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse6 .cse9 .cse11 .cse12 .cse32 .cse33 .cse13 .cse14 .cse34 .cse16 .cse17 .cse35 .cse10 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse10 .cse3 .cse30 .cse4 .cse27 .cse6 .cse7 .cse8 .cse11 .cse12 .cse32 .cse13 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36 .cse22 .cse23 .cse24 .cse25) (let ((.cse39 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse38 .cse30 .cse4 .cse27 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 (< .cse39 ~token~0) .cse34 .cse28 .cse29 .cse17 .cse35 .cse18 .cse19 .cse20 .cse36 .cse22 .cse10 .cse24 .cse25 (< ~token~0 .cse39))) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse10 .cse6 .cse8 .cse9 .cse11 .cse12 .cse32 .cse33 .cse13 .cse34 .cse28 .cse29 .cse17 .cse35 .cse18 .cse19 .cse20 .cse36 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse27 .cse6 .cse31 .cse8 .cse11 .cse12 .cse32 .cse10 .cse33 .cse13 .cse34 .cse16 .cse17 .cse35 .cse18 .cse19 .cse20 .cse36 .cse22 .cse37 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse27 .cse6 .cse7 .cse8 .cse11 .cse12 .cse32 .cse10 .cse13 .cse34 .cse28 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse27 .cse6 .cse9 .cse11 .cse12 .cse32 .cse33 .cse13 .cse14 .cse34 .cse28 .cse29 .cse17 .cse35 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse27 .cse5 .cse10 .cse6 .cse9 .cse11 .cse12 .cse33 .cse13 .cse15 .cse28 .cse29 .cse17 .cse35 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse38 .cse30 .cse4 .cse10 .cse27 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 .cse34 .cse16 .cse17 .cse35 .cse18 .cse19 .cse20 .cse36 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse6 .cse7 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse34 .cse28 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse24 .cse25 .cse26) (let ((.cse40 (+ ~local~0 3))) (or .cse10 .cse0 .cse1 .cse3 .cse30 .cse4 .cse27 (< .cse40 ~token~0) .cse6 .cse8 .cse9 .cse11 .cse12 .cse32 .cse33 .cse13 .cse34 .cse17 .cse28 .cse41 .cse35 .cse18 .cse19 .cse20 .cse36 .cse22 .cse24 .cse25 (< ~token~0 .cse40))) (or .cse0 .cse1 .cse3 .cse4 .cse27 .cse5 .cse6 .cse9 .cse11 .cse12 .cse33 .cse13 .cse15 .cse16 .cse10 .cse17 .cse35 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse6 .cse7 .cse9 .cse11 .cse12 .cse32 .cse10 .cse13 .cse14 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 194 212) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 204) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 207) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 194 212) the Hoare annotation is: true [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L198-2(lines 198 207) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L578-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 574 621) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L603-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L608-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L598-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 574 621) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (= |old(~T3_E~0)| 0) (< ~m_st~0 2) (= |old(~T2_E~0)| 0) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= ~t1_st~0 0) (< ~t2_st~0 2) (= 0 |old(~E_3~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0)) (not (= ~t1_pc~0 1)) (not (= 1 ~t3_pc~0)) (< ~t3_st~0 2) (= 1 |old(~E_M~0)|) (not (= 1 ~t2_pc~0)) (= |old(~T1_E~0)| 1) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 1 ~m_pc~0)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|)) [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 574 621) no Hoare annotation was computed. [2018-11-18 08:50:44,272 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 554 564) no Hoare annotation was computed. [2018-11-18 08:50:44,273 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 554 564) the Hoare annotation is: (let ((.cse43 (= 0 |old(~t2_st~0)|)) (.cse36 (= 0 |old(~t3_st~0)|)) (.cse30 (= ~t1_pc~0 1)) (.cse26 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse48 (<= 2 ~m_st~0)) (.cse45 (= 0 ~t2_st~0)) (.cse50 (+ ~local~0 1)) (.cse49 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse46 (= |old(~t3_st~0)| ~t3_st~0)) (.cse47 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse28 (and .cse49 .cse46 .cse47)) (.cse38 (< ~token~0 .cse50)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse39 (< .cse50 ~token~0)) (.cse42 (and .cse48 .cse45 .cse46 .cse47)) (.cse27 (not .cse11)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse32 (and .cse48 .cse49 .cse46 .cse47)) (.cse33 (< |old(~m_st~0)| 2)) (.cse35 (= 1 ~E_1~0)) (.cse31 (not .cse7)) (.cse37 (not .cse26)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< ~token~0 ~local~0)) (.cse15 (not .cse30)) (.cse40 (not .cse36)) (.cse12 (and .cse45 .cse46 .cse47)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not .cse43)) (.cse23 (= 0 ~E_1~0)) (.cse41 (< 0 ~t3_pc~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse28 .cse8 .cse9 .cse10 .cse29 .cse13 .cse30 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26) (let ((.cse34 (+ ~local~0 3))) (or .cse32 .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 (< .cse34 ~token~0) .cse6 .cse35 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse15 .cse16 .cse36 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 (< ~token~0 .cse34))) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 .cse6 .cse38 .cse35 .cse9 .cse10 .cse11 .cse32 .cse29 .cse13 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse39 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse28 .cse29 .cse13 .cse30 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse42 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse40 .cse18 .cse19 .cse20 .cse12 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse32 .cse3 .cse33 .cse4 .cse5 .cse6 .cse38 .cse35 .cse9 .cse10 .cse11 .cse29 .cse13 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse39 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse13 .cse15 .cse42 .cse40 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse41 .cse24 .cse25) (let ((.cse44 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse43 .cse33 .cse4 .cse5 .cse35 .cse8 .cse32 .cse9 .cse10 .cse11 .cse13 (< .cse44 ~token~0) .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 (< ~token~0 .cse44))) (or .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse32 .cse1 .cse3 .cse43 .cse33 .cse4 .cse5 .cse35 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse40 .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,273 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 554 564) no Hoare annotation was computed. [2018-11-18 08:50:44,276 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2018-11-18 08:50:44,276 INFO L425 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-11-18 08:50:44,276 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 511 553) no Hoare annotation was computed. [2018-11-18 08:50:44,277 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 541) no Hoare annotation was computed. [2018-11-18 08:50:44,277 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-18 08:50:44,277 INFO L421 ceAbstractionStarter]: At program point L537-2(lines 537 541) the Hoare annotation is: (let ((.cse56 (= 0 ~t1_st~0)) (.cse58 (<= 2 ~m_st~0)) (.cse42 (= |old(~t1_st~0)| ~t1_st~0)) (.cse43 (= activate_threads_~tmp___1~0 0))) (let ((.cse36 (= 1 ~t2_pc~0)) (.cse13 (= ~t1_pc~0 1)) (.cse24 (= 1 ~m_pc~0)) (.cse53 (= 0 |old(~t3_st~0)|)) (.cse57 (+ ~local~0 1)) (.cse25 (= 0 |old(~t2_st~0)|)) (.cse28 (= |old(~t1_st~0)| 0)) (.cse50 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse38 (= activate_threads_~tmp___0~0 0)) (.cse39 (= activate_threads_~tmp~1 0)) (.cse40 (= 0 ~t2_st~0)) (.cse41 (= |old(~t3_st~0)| ~t3_st~0)) (.cse60 (and .cse58 .cse42 .cse43)) (.cse59 (and .cse58 .cse56 .cse43))) (let ((.cse37 (= ~m_st~0 0)) (.cse49 (or .cse60 .cse59)) (.cse55 (and .cse56 .cse39 .cse40 .cse41 .cse43)) (.cse29 (and .cse58 .cse50 .cse38 .cse41 .cse42 .cse43)) (.cse0 (and .cse50 .cse38 .cse41 .cse39 .cse42 .cse43)) (.cse6 (not .cse28)) (.cse45 (not .cse25)) (.cse54 (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43)) (.cse46 (and .cse38 (or .cse59 .cse60) .cse50 .cse41)) (.cse26 (< |old(~m_st~0)| 2)) (.cse48 (< ~token~0 .cse57)) (.cse27 (= 1 ~E_1~0)) (.cse14 (not .cse53)) (.cse47 (and .cse38 (or (and .cse58 .cse56 .cse40) (and .cse58 .cse40 .cse42)) .cse41)) (.cse34 (not .cse24)) (.cse51 (< .cse57 ~token~0)) (.cse21 (< 0 ~t3_pc~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse35 (< ~local~0 ~token~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse12 (= 0 ~E_3~0)) (.cse44 (< ~token~0 ~local~0)) (.cse31 (not .cse13)) (.cse32 (not (= 1 ~t3_pc~0))) (.cse33 (< |old(~t3_st~0)| 2)) (.cse15 (= 1 ~E_M~0)) (.cse16 (not .cse36)) (.cse17 (= ~T1_E~0 1)) (.cse18 (not (= 1 ~t3_i~0))) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 0 ~E_1~0)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~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 .cse21 .cse22 .cse23 .cse24) (let ((.cse30 (+ ~local~0 2))) (or .cse1 .cse2 .cse3 .cse25 .cse26 .cse4 .cse5 .cse27 .cse8 .cse9 .cse10 .cse28 .cse29 .cse12 (< .cse30 ~token~0) .cse31 .cse32 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse22 .cse23 (< ~token~0 .cse30))) (or .cse1 .cse2 .cse35 .cse3 .cse4 .cse6 .cse7 .cse36 .cse27 (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) .cse8 .cse9 .cse10 .cse12 .cse44 .cse13 .cse14 .cse15 .cse17 (not (= 0 |old(~m_st~0)|)) .cse18 .cse19 .cse45 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse26 .cse4 .cse46 .cse5 .cse7 .cse36 .cse27 .cse9 .cse10 .cse28 .cse12 .cse31 .cse14 .cse15 .cse17 .cse18 .cse19 .cse45 .cse34 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse35 .cse3 .cse39 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse44 .cse31 .cse32 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse26 (not (= ~E_2~0 1)) .cse4 .cse5 .cse47 .cse7 .cse48 .cse27 (and .cse38 .cse49 .cse50 .cse41) .cse9 .cse28 .cse11 .cse12 .cse31 .cse32 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse51 .cse22 .cse23) (let ((.cse52 (+ ~local~0 3))) (or .cse1 .cse2 .cse3 (and .cse37 .cse50 .cse38 .cse41 .cse15 .cse42 .cse43) .cse26 .cse4 .cse5 (< .cse52 ~token~0) .cse7 .cse27 .cse8 .cse9 .cse10 .cse28 .cse29 .cse11 .cse12 .cse31 .cse32 .cse53 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse22 .cse23 (< ~token~0 .cse52))) (or .cse1 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse36 .cse8 .cse9 .cse10 .cse28 .cse54 .cse12 .cse44 .cse31 .cse14 .cse15 .cse17 .cse18 .cse55 .cse19 .cse45 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse7 .cse36 .cse27 .cse9 .cse10 .cse28 (and .cse49 .cse38 .cse50 .cse41) .cse12 .cse31 .cse32 .cse33 .cse15 .cse17 .cse18 .cse19 .cse45 .cse34 .cse20 .cse22 .cse23) (or .cse1 .cse2 .cse35 .cse3 .cse4 .cse5 .cse54 .cse55 .cse7 .cse36 .cse8 .cse9 .cse10 .cse28 .cse12 .cse44 .cse31 .cse32 .cse33 .cse15 .cse17 .cse18 .cse19 .cse45 .cse20 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse36 .cse8 .cse9 .cse10 .cse12 .cse13 .cse32 .cse33 .cse15 .cse17 .cse18 .cse19 .cse45 .cse54 .cse20 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse25 .cse26 .cse4 .cse5 .cse27 .cse8 .cse9 .cse10 .cse28 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse34 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse26 .cse4 .cse7 .cse27 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse31 .cse29 .cse32 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse32 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 (and .cse50 .cse38 .cse39 .cse41 .cse42 .cse43) .cse24) (or .cse1 .cse2 .cse35 .cse3 (and .cse50 .cse56 .cse41 .cse39 .cse43) .cse4 .cse5 .cse0 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse44 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse36 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse45 .cse54 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse1 .cse46 .cse2 .cse3 .cse26 .cse4 .cse5 .cse7 .cse48 .cse27 .cse9 .cse10 .cse28 .cse11 .cse12 .cse31 .cse14 .cse47 .cse15 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse51 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse35 .cse3 (and .cse50 .cse56 .cse41 .cse43) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse44 .cse31 .cse32 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse50 .cse38 .cse41 .cse42 .cse43) .cse20 .cse22 .cse23))))) [2018-11-18 08:50:44,278 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2018-11-18 08:50:44,279 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-18 08:50:44,280 INFO L421 ceAbstractionStarter]: At program point L529-2(lines 529 533) the Hoare annotation is: (let ((.cse40 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse42 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~m_st~0)) (.cse22 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse43 (= 0 |old(~t2_st~0)|)) (.cse18 (= activate_threads_~tmp___0~0 0)) (.cse50 (= activate_threads_~tmp~1 0)) (.cse47 (= 0 ~t2_st~0)) (.cse23 (= |old(~t3_st~0)| ~t3_st~0)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse54 (= 0 |old(~t3_st~0)|)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse55 (+ ~local~0 1))) (let ((.cse45 (< ~token~0 .cse55)) (.cse46 (< .cse55 ~token~0)) (.cse41 (not .cse11)) (.cse36 (not .cse54)) (.cse51 (and .cse18 .cse50 .cse47 .cse23 .cse21)) (.cse39 (< 0 ~t3_pc~0)) (.cse26 (not .cse43)) (.cse48 (and .cse18 .cse23 .cse50 .cse47 .cse21)) (.cse31 (< ~local~0 ~token~0)) (.cse32 (and .cse22 .cse20 .cse23 .cse50)) (.cse35 (< ~token~0 ~local~0)) (.cse37 (and .cse22 .cse18 .cse23 .cse50 .cse21)) (.cse15 (< |old(~t3_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse44 (and .cse19 .cse22 .cse18 .cse23 .cse21)) (.cse2 (= ~T3_E~0 0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse33 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse49 (= ~m_st~0 0)) (.cse16 (= 1 ~E_M~0)) (.cse10 (= 0 ~E_2~0)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse12 (= 0 ~E_3~0)) (.cse13 (not .cse42)) (.cse14 (not (= 1 ~t3_pc~0))) (.cse38 (not .cse7)) (.cse17 (= ~T1_E~0 1)) (.cse24 (not (= 1 ~t3_i~0))) (.cse25 (not (= ~m_i~0 1))) (.cse27 (not .cse40)) (.cse28 (= 0 ~E_1~0)) (.cse29 (not (= 1 ~t2_i~0))) (.cse30 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse18 (or (and .cse19 .cse20) (and .cse19 .cse21)) .cse22 .cse23) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse31 .cse32 .cse2 .cse4 .cse5 .cse6 .cse33 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse37 .cse16 .cse38 .cse17 .cse24 .cse25 .cse28 .cse39 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse41 .cse37 .cse6 .cse33 .cse9 .cse10 .cse34 .cse12 .cse42 .cse36 .cse16 .cse38 .cse17 .cse24 .cse25 .cse28 .cse39 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse2 .cse43 .cse3 .cse4 .cse5 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse16 .cse38 .cse17 .cse24 .cse25 .cse27 .cse28 .cse44 .cse39 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse45 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse36 .cse16 .cse38 .cse17 .cse24 .cse25 .cse27 .cse28 .cse46 .cse39 .cse29 .cse30 .cse44) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse16 .cse17 .cse24 .cse25 .cse26 .cse27 (and .cse18 (or (and .cse19 .cse47 .cse21) (and .cse19 .cse20 .cse47)) .cse23) .cse28 .cse39 .cse29 .cse30) (or (and .cse22 .cse18 .cse23 .cse21) .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse33 .cse9 .cse10 .cse11 (and .cse22 .cse20 .cse23) .cse34 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse24 .cse25 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse41 .cse6 .cse7 .cse33 .cse9 .cse10 .cse48 .cse12 .cse42 .cse14 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse41 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse12 .cse35 .cse42 .cse36 .cse16 .cse17 (not (= 0 |old(~m_st~0)|)) (and .cse49 .cse18 .cse50 .cse47 .cse23 .cse21) .cse24 .cse25 .cse26 .cse28 .cse39 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse45 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse38 .cse44 .cse17 .cse24 .cse25 .cse27 .cse28 .cse46 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse41 .cse37 .cse6 .cse33 .cse9 .cse10 .cse34 .cse12 .cse42 .cse14 .cse15 .cse16 .cse38 .cse17 .cse24 .cse25 .cse28 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse51 .cse2 .cse4 .cse5 .cse41 .cse6 .cse7 .cse33 .cse9 .cse10 .cse12 .cse42 .cse36 .cse16 .cse17 .cse24 .cse25 .cse26 .cse28 .cse39 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 (and .cse20 .cse50 .cse47 .cse23) .cse6 .cse7 .cse33 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse36 .cse16 .cse17 .cse24 .cse25 .cse26 .cse28 .cse51 .cse39 .cse29 .cse30 .cse40) (let ((.cse52 (+ ~local~0 2))) (or .cse44 .cse0 .cse1 .cse2 .cse43 .cse3 .cse4 .cse5 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 (< .cse52 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 (< ~token~0 .cse52))) (or (and .cse20 .cse23 .cse50 .cse47) .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse7 .cse33 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse48 .cse28 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse32 .cse33 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse24 .cse37 .cse25 .cse28 .cse29 .cse30 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse33 .cse9 .cse10 .cse11 .cse44 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30) (let ((.cse53 (+ ~local~0 3))) (or .cse0 .cse1 .cse44 .cse2 .cse3 .cse4 .cse5 (< .cse53 ~token~0) .cse6 .cse8 .cse33 .cse9 (and .cse49 .cse22 .cse18 .cse23 .cse16 .cse21) .cse10 .cse11 .cse34 .cse12 .cse13 .cse14 .cse54 .cse38 .cse17 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 (< ~token~0 .cse53)))))) [2018-11-18 08:50:44,281 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 525) no Hoare annotation was computed. [2018-11-18 08:50:44,285 INFO L421 ceAbstractionStarter]: At program point L519(line 519) the Hoare annotation is: (let ((.cse46 (= 0 |old(~t2_st~0)|)) (.cse36 (= 0 |old(~t3_st~0)|)) (.cse30 (= ~t1_pc~0 1)) (.cse26 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse48 (<= 2 ~m_st~0)) (.cse43 (= 0 ~t2_st~0)) (.cse50 (+ ~local~0 1)) (.cse49 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse44 (= |old(~t3_st~0)| ~t3_st~0)) (.cse45 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse28 (and .cse49 .cse44 .cse45)) (.cse38 (< ~token~0 .cse50)) (.cse39 (< .cse50 ~token~0)) (.cse42 (and .cse48 .cse43 .cse44 .cse45)) (.cse27 (not .cse11)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse32 (and .cse48 .cse49 .cse44 .cse45)) (.cse33 (< |old(~m_st~0)| 2)) (.cse35 (= 1 ~E_1~0)) (.cse31 (not .cse7)) (.cse37 (not .cse26)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< ~token~0 ~local~0)) (.cse15 (not .cse30)) (.cse40 (not .cse36)) (.cse12 (and .cse43 .cse44 .cse45)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not .cse46)) (.cse23 (= 0 ~E_1~0)) (.cse41 (< 0 ~t3_pc~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse28 .cse8 .cse9 .cse10 .cse29 .cse13 .cse30 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26) (let ((.cse34 (+ ~local~0 3))) (or .cse32 .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 (< .cse34 ~token~0) .cse6 .cse35 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse15 .cse16 .cse36 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 (< ~token~0 .cse34))) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 .cse6 .cse38 .cse35 .cse9 .cse10 .cse11 .cse32 .cse29 .cse13 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse39 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse28 .cse29 .cse13 .cse30 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse42 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse40 .cse18 .cse19 .cse20 .cse12 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse32 .cse3 .cse33 .cse4 .cse5 .cse6 .cse38 .cse35 .cse9 .cse10 .cse11 .cse29 .cse13 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse39 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse13 .cse15 .cse42 .cse40 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse6 .cse7 .cse35 .cse8 .cse9 .cse10 .cse13 .cse14 .cse30 (and (= ~m_st~0 0) .cse43 .cse44 .cse45) .cse40 .cse18 .cse19 (not (= 0 |old(~m_st~0)|)) .cse20 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26) (let ((.cse47 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse46 .cse33 .cse4 .cse5 .cse35 .cse8 .cse32 .cse9 .cse10 .cse11 .cse13 (< .cse47 ~token~0) .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 (< ~token~0 .cse47))) (or .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse6 .cse35 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse32 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25) (or .cse0 .cse32 .cse1 .cse3 .cse46 .cse33 .cse4 .cse5 .cse35 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse40 .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,287 INFO L421 ceAbstractionStarter]: At program point L521-2(lines 521 525) the Hoare annotation is: (let ((.cse34 (= 1 ~m_pc~0)) (.cse29 (= 1 ~t2_pc~0)) (.cse41 (= 0 |old(~t3_st~0)|)) (.cse45 (= ~t1_pc~0 1)) (.cse51 (+ ~local~0 1)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse37 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse49 (= activate_threads_~tmp~1 0)) (.cse52 (<= 2 ~m_st~0)) (.cse50 (= 0 ~t2_st~0)) (.cse38 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse42 (and .cse52 .cse50 .cse38 .cse39)) (.cse36 (= ~m_st~0 0)) (.cse27 (< ~local~0 ~token~0)) (.cse46 (and .cse37 .cse49 .cse38 .cse39)) (.cse30 (< ~token~0 ~local~0)) (.cse44 (not .cse11)) (.cse8 (= 1 ~E_2~0)) (.cse26 (and .cse49 .cse50 .cse38 .cse39)) (.cse31 (not (= 1 ~t3_pc~0))) (.cse32 (< |old(~t3_st~0)| 2)) (.cse33 (not .cse3)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse28 (= 1 ~E_3~0)) (.cse12 (and .cse52 .cse37 .cse38 .cse39)) (.cse47 (< ~token~0 .cse51)) (.cse7 (= 1 ~E_1~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse35 (< |old(~t2_st~0)| 2)) (.cse13 (= 0 ~E_3~0)) (.cse14 (not .cse45)) (.cse15 (not .cse41)) (.cse16 (= 1 ~E_M~0)) (.cse17 (not .cse29)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse21 (not .cse34)) (.cse22 (= 0 ~E_1~0)) (.cse48 (< .cse51 ~token~0)) (.cse23 (< 0 ~t3_pc~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse26 .cse1 .cse27 .cse2 .cse5 .cse6 .cse28 .cse29 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse14 .cse31 .cse32 .cse16 .cse18 .cse19 .cse20 .cse33 .cse22 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse31 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse12) (let ((.cse40 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse4 .cse5 (and .cse36 .cse37 .cse38 .cse16 .cse39) .cse6 (< .cse40 ~token~0) .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse31 .cse41 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 (< ~token~0 .cse40))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse28 .cse29 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse42 .cse33 .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse43 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< .cse43 ~token~0) .cse14 .cse31 .cse32 .cse12 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 (< ~token~0 .cse43))) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse44 .cse28 .cse8 .cse9 .cse10 .cse35 .cse13 .cse45 .cse46 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse28 .cse47 .cse7 .cse9 .cse10 .cse11 .cse35 .cse13 .cse12 .cse14 .cse31 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse48 .cse24 .cse25) (or .cse0 .cse1 .cse27 .cse2 (and .cse37 .cse38 .cse39) .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse30 .cse14 .cse31 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse28 .cse29 .cse7 .cse9 .cse10 .cse11 .cse42 .cse13 .cse14 .cse31 .cse32 .cse16 .cse18 .cse19 .cse20 .cse33 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse44 .cse28 .cse8 .cse9 .cse10 .cse46 .cse35 .cse13 .cse45 .cse31 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse44 .cse28 .cse29 .cse8 .cse9 .cse10 .cse13 .cse45 .cse15 .cse16 .cse18 .cse19 .cse20 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse34) (or .cse0 .cse1 .cse27 .cse2 .cse5 .cse44 .cse28 .cse29 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse45 .cse15 .cse16 .cse18 (not (= 0 |old(~m_st~0)|)) (and .cse36 .cse49 .cse50 .cse38 .cse39) .cse19 .cse20 .cse33 .cse22 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse27 .cse2 .cse5 .cse6 .cse28 .cse29 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse14 .cse26 .cse15 .cse16 .cse18 .cse19 .cse20 .cse33 .cse22 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse27 .cse2 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse30 .cse14 .cse31 .cse32 .cse49 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse27 .cse2 .cse5 .cse6 .cse46 .cse28 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse44 .cse28 .cse29 .cse8 .cse9 .cse10 .cse26 .cse13 .cse45 .cse31 .cse32 .cse16 .cse18 .cse19 .cse20 .cse33 .cse22 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse28 .cse12 .cse47 .cse7 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse48 .cse23 .cse24 .cse25)))) [2018-11-18 08:50:44,288 INFO L425 ceAbstractionStarter]: For program point L519-1(line 519) no Hoare annotation was computed. [2018-11-18 08:50:44,289 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 511 553) the Hoare annotation is: (let ((.cse46 (= 0 |old(~t2_st~0)|)) (.cse36 (= 0 |old(~t3_st~0)|)) (.cse30 (= ~t1_pc~0 1)) (.cse26 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse48 (<= 2 ~m_st~0)) (.cse43 (= 0 ~t2_st~0)) (.cse50 (+ ~local~0 1)) (.cse49 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse44 (= |old(~t3_st~0)| ~t3_st~0)) (.cse45 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse28 (and .cse49 .cse44 .cse45)) (.cse38 (< ~token~0 .cse50)) (.cse39 (< .cse50 ~token~0)) (.cse42 (and .cse48 .cse43 .cse44 .cse45)) (.cse27 (not .cse11)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse32 (and .cse48 .cse49 .cse44 .cse45)) (.cse33 (< |old(~m_st~0)| 2)) (.cse35 (= 1 ~E_1~0)) (.cse31 (not .cse7)) (.cse37 (not .cse26)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< ~token~0 ~local~0)) (.cse15 (not .cse30)) (.cse40 (not .cse36)) (.cse12 (and .cse43 .cse44 .cse45)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not .cse46)) (.cse23 (= 0 ~E_1~0)) (.cse41 (< 0 ~t3_pc~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse28 .cse8 .cse9 .cse10 .cse29 .cse13 .cse30 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26) (let ((.cse34 (+ ~local~0 3))) (or .cse32 .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 (< .cse34 ~token~0) .cse6 .cse35 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse15 .cse16 .cse36 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 (< ~token~0 .cse34))) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 .cse6 .cse38 .cse35 .cse9 .cse10 .cse11 .cse32 .cse29 .cse13 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse39 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse28 .cse29 .cse13 .cse30 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse42 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse40 .cse18 .cse19 .cse20 .cse12 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse23 .cse41 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse32 .cse3 .cse33 .cse4 .cse5 .cse6 .cse38 .cse35 .cse9 .cse10 .cse11 .cse29 .cse13 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse39 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse13 .cse15 .cse42 .cse40 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse6 .cse7 .cse35 .cse8 .cse9 .cse10 .cse13 .cse14 .cse30 (and (= ~m_st~0 0) .cse43 .cse44 .cse45) .cse40 .cse18 .cse19 (not (= 0 |old(~m_st~0)|)) .cse20 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26) (let ((.cse47 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse46 .cse33 .cse4 .cse5 .cse35 .cse8 .cse32 .cse9 .cse10 .cse11 .cse13 (< .cse47 ~token~0) .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 (< ~token~0 .cse47))) (or .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse33 .cse4 .cse6 .cse35 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse32 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25) (or .cse0 .cse32 .cse1 .cse3 .cse46 .cse33 .cse4 .cse5 .cse35 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse40 .cse18 .cse31 .cse19 .cse20 .cse21 .cse37 .cse23 .cse41 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse40 .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,291 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 511 553) no Hoare annotation was computed. [2018-11-18 08:50:44,294 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 328) no Hoare annotation was computed. [2018-11-18 08:50:44,294 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 306 335) no Hoare annotation was computed. [2018-11-18 08:50:44,294 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 329) no Hoare annotation was computed. [2018-11-18 08:50:44,294 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 330) no Hoare annotation was computed. [2018-11-18 08:50:44,294 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 306 335) the Hoare annotation is: true [2018-11-18 08:50:44,294 INFO L421 ceAbstractionStarter]: At program point L332(lines 309 334) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0)) (.cse12 (= ~t1_st~0 0)) (.cse29 (= 1 ~t2_pc~0)) (.cse30 (= ~t1_pc~0 1)) (.cse41 (+ ~local~0 1))) (let ((.cse7 (< ~token~0 .cse41)) (.cse24 (< .cse41 ~token~0)) (.cse15 (not .cse30)) (.cse35 (not (= 0 ~m_st~0))) (.cse31 (< ~local~0 ~token~0)) (.cse37 (< ~t2_st~0 2)) (.cse32 (< ~token~0 ~local~0)) (.cse16 (not (= 0 ~t3_st~0))) (.cse39 (not .cse29)) (.cse25 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (< ~m_st~0 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse28 (not .cse12)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse14 (= 0 ~E_3~0)) (.cse13 (= exists_runnable_thread_~__retres1~4 1)) (.cse33 (not (= 1 ~t3_pc~0))) (.cse34 (< ~t3_st~0 2)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse21 (not (= 0 ~t2_st~0))) (.cse22 (not .cse36)) (.cse23 (= 0 ~E_1~0)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse14 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse32 .cse15 .cse33 .cse34 .cse17 .cse18 .cse35 .cse19 .cse20 .cse21 .cse23 .cse13 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse13) (let ((.cse38 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse37 .cse14 (< .cse38 ~token~0) .cse15 .cse33 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20 .cse22 .cse23 .cse26 .cse27 (< ~token~0 .cse38))) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse14 .cse15 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse14 .cse32 .cse30 .cse16 .cse17 .cse18 .cse35 .cse19 .cse20 .cse21 .cse23 .cse25 .cse26 .cse27 .cse13 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse33 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse37 .cse14 .cse32 .cse30 .cse16 .cse17 .cse39 .cse18 .cse35 .cse19 .cse20 .cse23 .cse25 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse13 .cse31 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse14 .cse32 .cse30 .cse33 .cse34 .cse17 .cse18 .cse35 .cse19 .cse20 .cse21 .cse23 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse13 .cse9 .cse10 .cse11 .cse37 .cse14 .cse30 .cse33 .cse34 .cse17 .cse39 .cse18 .cse19 .cse20 .cse22 .cse23 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse37 .cse14 .cse32 .cse33 .cse34 .cse17 .cse39 .cse18 .cse19 .cse20 .cse22 .cse23 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse32 .cse15 .cse16 .cse17 .cse18 .cse35 .cse19 .cse20 .cse21 .cse23 .cse25 .cse26 .cse27 .cse13 .cse36) (let ((.cse40 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse4 .cse5 (< .cse40 ~token~0) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse14 .cse13 .cse15 .cse33 .cse34 .cse17 .cse39 .cse18 .cse35 .cse19 .cse20 .cse22 .cse23 .cse26 .cse27 (< ~token~0 .cse40))) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse8 .cse13 .cse9 .cse10 .cse11 .cse12 .cse37 .cse14 .cse32 .cse15 .cse16 .cse17 .cse39 .cse18 .cse35 .cse19 .cse20 .cse23 .cse25 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse14 .cse32 .cse15 .cse16 .cse17 .cse13 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse32 .cse33 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse33 .cse34 .cse13 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse13 .cse10 .cse11 .cse37 .cse14 .cse30 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse28 .cse6 .cse8 .cse13 .cse9 .cse10 .cse11 .cse37 .cse14 .cse32 .cse30 .cse33 .cse34 .cse17 .cse39 .cse18 .cse35 .cse19 .cse20 .cse23 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse14 .cse13 .cse32 .cse15 .cse33 .cse34 .cse17 .cse39 .cse18 .cse35 .cse19 .cse20 .cse23 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse37 .cse14 .cse32 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse30 .cse33 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse27)))) [2018-11-18 08:50:44,297 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 327) no Hoare annotation was computed. [2018-11-18 08:50:44,299 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 306 335) no Hoare annotation was computed. [2018-11-18 08:50:44,299 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 213 231) no Hoare annotation was computed. [2018-11-18 08:50:44,299 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-18 08:50:44,299 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 226) no Hoare annotation was computed. [2018-11-18 08:50:44,299 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 213 231) the Hoare annotation is: true [2018-11-18 08:50:44,299 INFO L425 ceAbstractionStarter]: For program point L217-2(lines 217 226) no Hoare annotation was computed. [2018-11-18 08:50:44,299 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 213 231) no Hoare annotation was computed. [2018-11-18 08:50:44,300 INFO L421 ceAbstractionStarter]: At program point L228(lines 216 230) the Hoare annotation is: (let ((.cse29 (= 1 ~t2_pc~0)) (.cse11 (= ~t1_st~0 0)) (.cse35 (= 0 ~t2_st~0)) (.cse17 (= 0 ~t3_st~0)) (.cse32 (= 1 ~m_pc~0)) (.cse30 (= ~t1_pc~0 1)) (.cse41 (+ ~local~0 1))) (let ((.cse37 (< ~token~0 .cse41)) (.cse38 (< .cse41 ~token~0)) (.cse3 (< ~m_st~0 2)) (.cse7 (= 1 ~E_1~0)) (.cse15 (not .cse30)) (.cse36 (not (= 0 ~m_st~0))) (.cse22 (not .cse32)) (.cse33 (not .cse17)) (.cse31 (not .cse35)) (.cse34 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse28 (not .cse11)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse13 (< ~t2_st~0 2)) (.cse14 (= 0 ~E_3~0)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse26 (< ~t3_st~0 2)) (.cse27 (= 1 ~E_M~0)) (.cse18 (not .cse29)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse23 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~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 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse12) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse14 .cse12 .cse30 .cse16 .cse26 .cse27 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse12 .cse9 .cse10 .cse11 .cse14 .cse15 .cse33 .cse27 .cse19 .cse20 .cse21 .cse31 .cse22 .cse23 .cse34 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse33 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse12 .cse23 .cse34 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse30 .cse33 .cse27 .cse18 .cse19 .cse20 .cse21 .cse12 .cse23 .cse34 .cse24 .cse25 .cse32) (or .cse0 .cse1 (< ~local~0 ~token~0) .cse2 .cse4 .cse28 .cse6 .cse29 .cse7 .cse8 .cse12 .cse9 .cse10 .cse14 (< ~token~0 ~local~0) .cse30 .cse33 .cse27 .cse19 .cse36 .cse20 .cse21 .cse31 .cse23 .cse34 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse37 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse33 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse38 .cse34 .cse24 .cse25 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse26 .cse12 .cse27 .cse19 .cse20 .cse21 .cse31 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse37 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse38 .cse24 .cse25) (let ((.cse39 (+ ~local~0 2))) (or .cse12 .cse0 .cse1 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 (< .cse39 ~token~0) .cse15 .cse16 .cse26 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (< ~token~0 .cse39))) (let ((.cse40 (+ ~local~0 3))) (or (not .cse27) .cse0 .cse1 .cse2 .cse4 .cse5 (< .cse40 ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse12 .cse16 .cse17 .cse18 .cse19 .cse36 .cse20 .cse21 .cse22 .cse23 .cse24 (< ~token~0 .cse40))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse12 .cse29 .cse8 .cse9 .cse10 .cse14 .cse30 .cse33 .cse27 .cse19 .cse20 .cse21 .cse31 .cse23 .cse34 .cse24 .cse25 .cse32) (or .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse30 .cse16 .cse26 .cse27 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse32)))) [2018-11-18 08:50:44,305 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,305 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 463 510) no Hoare annotation was computed. [2018-11-18 08:50:44,306 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 463 510) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= |old(~T3_E~0)| 0)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse5 (= 1 |old(~E_3~0)|)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 |old(~E_2~0)|)) (.cse4 (= ~t1_st~0 0)) (.cse11 (= 0 |old(~E_3~0)|)) (.cse13 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse12 (= ~t1_pc~0 1)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse6 (= 1 ~t2_pc~0)) (.cse15 (= |old(~T1_E~0)| 1)) (.cse16 (not (= 1 ~t3_i~0))) (.cse17 (not (= ~m_i~0 1))) (.cse21 (= 1 ~m_pc~0)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 (< ~local~0 ~token~0) .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 ~local~0) .cse12 .cse13 (not (= 0 ~t3_st~0)) .cse14 .cse15 (not (= 0 ~m_st~0)) .cse16 .cse17 (not (= 0 ~t2_st~0)) .cse18 (< 0 ~t3_pc~0) .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 (< ~m_st~0 2) .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse4 (< ~t2_st~0 2) .cse11 .cse13 (not .cse12) (not (= 1 ~t3_pc~0)) (< ~t3_st~0 2) .cse14 (not .cse6) .cse15 .cse16 .cse17 (not .cse21) .cse18 .cse19 .cse20))) [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point L467-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point L482-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point L497-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 463 510) no Hoare annotation was computed. [2018-11-18 08:50:44,307 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point L287-1(lines 281 304) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 278 305) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point L282-1(lines 281 304) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 278 305) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< ~local~0 ~token~0) (= ~T3_E~0 0) (= ~T2_E~0 0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_3~0) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (not (= 1 ~t1_i~0)) (= 0 ~E_2~0) (= 0 ~E_3~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (not (= 0 |old(~t3_st~0)|)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (and (= ~m_st~0 0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 ~E_1~0) (< 0 ~t3_pc~0) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point L297-1(lines 278 305) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point L292-1(lines 281 304) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 42 85) no Hoare annotation was computed. [2018-11-18 08:50:44,308 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-18 08:50:44,314 INFO L421 ceAbstractionStarter]: At program point L50(lines 45 84) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse7 (= 1 ~t2_pc~0)) (.cse12 (= |old(~t1_st~0)| 0))) (let ((.cse16 (not (= 0 |old(~t3_st~0)|))) (.cse23 (< 0 ~t3_pc~0)) (.cse27 (not .cse12)) (.cse28 (< |old(~t2_st~0)| 2)) (.cse30 (not .cse7)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< |old(~token~0)| |old(~local~0)|)) (.cse15 (not .cse29)) (.cse32 (not (= 1 ~t3_pc~0))) (.cse33 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse28 .cse13 .cse29 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse31 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse3 .cse4 .cse5 (< .cse31 |old(~token~0)|) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse15 .cse32 .cse33 .cse17 .cse30 .cse18 .cse19 .cse20 (not .cse26) (let ((.cse34 (+ ~local~0 3))) (and (= |old(~E_1~0)| ~E_1~0) (= ~t2_st~0 |old(~t2_st~0)|) (<= .cse34 ~token~0) (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse34) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= 1 ~m_pc~0))) .cse22 .cse24 .cse25 (< |old(~token~0)| .cse31))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse32 .cse33 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse29 .cse32 .cse33 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse28 .cse13 .cse29 .cse32 .cse33 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,314 INFO L421 ceAbstractionStarter]: At program point L79(lines 42 85) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1))) (let ((.cse28 (= 1 ~t2_pc~0)) (.cse13 (= ~t1_pc~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse2 (= ~T3_E~0 0)) (.cse48 (not .cse1)) (.cse49 (not .cse0)) (.cse38 (<= ~token~0 ~local~0)) (.cse39 (= 0 ~t1_st~0)) (.cse51 (= 0 ~t2_st~0)) (.cse44 (<= ~local~0 ~token~0)) (.cse33 (= |old(~t1_st~0)| 0)) (.cse36 (<= 2 ~m_st~0)) (.cse37 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse40 (not (= ~E_1~0 1))) (.cse41 (= |old(~t3_st~0)| ~t3_st~0)) (.cse50 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (= 1 ~m_pc~0)) (.cse43 (not (= ~E_1~0 0)))) (let ((.cse26 (not (= 0 |old(~t3_st~0)|))) (.cse21 (and .cse36 .cse37 .cse40 .cse41 .cse50 .cse42 .cse43)) (.cse27 (< 0 ~t3_pc~0)) (.cse5 (not .cse33)) (.cse32 (and .cse36 .cse38 .cse39 .cse40 .cse51 .cse41 .cse42 .cse43 .cse44)) (.cse29 (and .cse36 .cse40 .cse51 .cse41 .cse50 .cse42 .cse43)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse45 (and .cse48 .cse36 .cse37 .cse40 .cse41 .cse49 .cse50 .cse42 .cse43)) (.cse31 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse12 (= 0 ~E_3~0)) (.cse47 (and (not .cse3) .cse48 .cse36 (not (= ~E_3~0 1)) .cse37 (not (= ~E_2~0 1)) (not (= ~M_E~0 1)) .cse38 (not (= ~E_2~0 0)) (= ~t1_i~0 1) .cse39 .cse40 .cse41 (<= 2 ~t2_st~0) (not .cse2) .cse49 .cse42 (not (= ~E_3~0 0)) .cse43 .cse44)) (.cse34 (< |old(~token~0)| |old(~local~0)|)) (.cse35 (not .cse13)) (.cse14 (not (= 1 ~t3_pc~0))) (.cse15 (< |old(~t3_st~0)| 2)) (.cse16 (= 1 ~E_M~0)) (.cse17 (not .cse28)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse7 .cse29 .cse8 .cse9 .cse10 .cse12 .cse13 .cse26 .cse16 .cse18 .cse19 .cse20 .cse30 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse31 .cse2 .cse32 .cse3 .cse4 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse33 .cse12 .cse34 .cse35 .cse26 .cse16 .cse18 .cse19 .cse20 .cse30 .cse22 .cse29 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse33 .cse11 .cse12 .cse34 .cse35 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse22 .cse21 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse6 .cse28 .cse7 .cse8 .cse32 .cse9 .cse10 .cse33 .cse12 .cse34 .cse35 .cse14 .cse15 .cse29 .cse16 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse24 .cse25) (let ((.cse46 (+ |old(~local~0)| 3))) (or .cse0 .cse45 .cse1 .cse2 .cse3 .cse4 (< .cse46 |old(~token~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse33 .cse11 .cse12 .cse47 .cse35 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not .cse25) .cse22 .cse23 .cse24 (< |old(~token~0)| .cse46))) (or .cse0 .cse1 .cse45 .cse31 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse33 .cse11 .cse12 .cse47 .cse34 .cse35 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25))))) [2018-11-18 08:50:44,315 INFO L421 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse7 (= 1 ~t2_pc~0)) (.cse12 (= |old(~t1_st~0)| 0))) (let ((.cse16 (not (= 0 |old(~t3_st~0)|))) (.cse23 (< 0 ~t3_pc~0)) (.cse27 (not .cse12)) (.cse28 (< |old(~t2_st~0)| 2)) (.cse30 (not .cse7)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse14 (< |old(~token~0)| |old(~local~0)|)) (.cse15 (not .cse29)) (.cse31 (not (= 1 ~t3_pc~0))) (.cse32 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= 1 ~t3_i~0))) (.cse20 (not (= ~m_i~0 1))) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse28 .cse13 .cse29 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse31 .cse32 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse29 .cse31 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse28 .cse13 .cse29 .cse31 .cse32 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26) (let ((.cse33 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse3 .cse4 .cse5 (< .cse33 |old(~token~0)|) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse15 .cse31 .cse32 .cse17 .cse30 .cse18 .cse19 .cse20 (not .cse26) .cse22 .cse24 .cse25 (< |old(~token~0)| .cse33))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26)))) [2018-11-18 08:50:44,318 INFO L421 ceAbstractionStarter]: At program point L71(lines 45 84) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1)) (.cse45 (<= ~token~0 ~local~0)) (.cse37 (= ~token~0 |old(~token~0)|)) (.cse47 (<= ~local~0 ~token~0)) (.cse29 (= 1 ~t2_pc~0)) (.cse46 (= 0 ~t2_st~0)) (.cse32 (= |old(~t1_st~0)| 0)) (.cse34 (= |old(~E_1~0)| ~E_1~0)) (.cse35 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse44 (not (= ~m_pc~0 1))) (.cse38 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (and .cse34 .cse35 .cse44 .cse38 .cse39)) (.cse5 (not .cse32)) (.cse28 (and .cse34 .cse44 .cse46 .cse38 .cse39)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse26 (not (= 0 |old(~t3_st~0)|))) (.cse18 (not .cse29)) (.cse43 (and .cse34 .cse35 .cse44 .cse45 .cse37 .cse38 .cse39 .cse47)) (.cse27 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse40 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse41 (and .cse34 .cse44 .cse45 .cse37 .cse46 .cse38 .cse39 .cse47)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse42 (< |old(~token~0)| |old(~local~0)|)) (.cse33 (not .cse14)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse16 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse26 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse28 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (let ((.cse31 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< .cse31 |old(~token~0)|) .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not .cse25) (let ((.cse36 (+ ~local~0 3))) (and .cse34 .cse35 (<= .cse36 ~token~0) .cse37 (<= ~token~0 .cse36) .cse38 .cse39 (= 1 ~m_pc~0))) .cse22 .cse23 .cse24 (< |old(~token~0)| .cse31))) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse41 .cse4 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse32 .cse13 .cse42 .cse33 .cse26 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse43 .cse12 .cse13 .cse42 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse42 .cse33 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse43 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse2 .cse41 .cse3 .cse4 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse32 .cse13 .cse42 .cse33 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25)))) [2018-11-18 08:50:44,320 INFO L421 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (let ((.cse8 (= 1 ~t2_pc~0)) (.cse41 (= ~t1_pc~0 1)) (.cse13 (= |old(~t1_st~0)| 0)) (.cse32 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse44 (not (= ~m_pc~0 1))) (.cse33 (<= ~token~0 ~local~0)) (.cse45 (= 0 ~t2_st~0)) (.cse34 (= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (not (= ~E_1~0 0))) (.cse37 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse44 .cse33 .cse45 .cse34 .cse35 .cse36 .cse37)) (.cse42 (and .cse32 .cse44 .cse34 .cse35 .cse36)) (.cse39 (not .cse13)) (.cse30 (not (= 1 ~t3_pc~0))) (.cse31 (< |old(~t3_st~0)| 2)) (.cse40 (and .cse44 .cse45 .cse34 .cse35 .cse36)) (.cse22 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (= ~T3_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_3~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 ~E_2~0)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse14 (= 0 ~E_3~0)) (.cse15 (< |old(~token~0)| |old(~local~0)|)) (.cse16 (not .cse41)) (.cse43 (and .cse32 .cse44 .cse33 .cse34 .cse35 .cse36 .cse37)) (.cse17 (not (= 0 |old(~t3_st~0)|))) (.cse18 (= 1 ~E_M~0)) (.cse38 (not .cse8)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse23 (= 0 |old(~E_1~0)|)) (.cse24 (< 0 ~t3_pc~0)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (let ((.cse28 (+ |old(~local~0)| 3))) (or .cse0 .cse2 .cse4 .cse5 .cse6 (< .cse28 |old(~token~0)|) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse16 .cse30 .cse31 (and .cse32 .cse33 .cse34 .cse35 (= 1 ~m_pc~0) .cse36 .cse37) .cse18 .cse38 .cse19 .cse20 .cse21 (not .cse27) .cse23 .cse25 .cse26 (< |old(~token~0)| .cse28))) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse39 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse40 .cse14 .cse41 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse39 .cse7 .cse9 .cse10 .cse11 .cse12 .cse29 .cse14 .cse42 .cse41 .cse17 .cse18 .cse38 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 .cse15 .cse16 .cse30 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse3 .cse4 .cse43 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse30 .cse31 .cse18 .cse38 .cse19 .cse20 .cse21 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse39 .cse7 .cse9 .cse10 .cse11 .cse12 .cse29 .cse14 .cse41 .cse30 .cse31 .cse18 .cse38 .cse19 .cse20 .cse21 .cse23 .cse42 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse39 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse41 .cse30 .cse31 .cse18 .cse40 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse43 .cse17 .cse18 .cse38 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2018-11-18 08:50:44,321 INFO L425 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-11-18 08:50:44,321 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 78) no Hoare annotation was computed. [2018-11-18 08:50:44,321 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 53) no Hoare annotation was computed. [2018-11-18 08:50:44,321 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 42 85) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1)) (.cse45 (<= ~token~0 ~local~0)) (.cse37 (= ~token~0 |old(~token~0)|)) (.cse47 (<= ~local~0 ~token~0)) (.cse29 (= 1 ~t2_pc~0)) (.cse46 (= 0 ~t2_st~0)) (.cse32 (= |old(~t1_st~0)| 0)) (.cse34 (= |old(~E_1~0)| ~E_1~0)) (.cse35 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse44 (not (= ~m_pc~0 1))) (.cse38 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (and .cse34 .cse35 .cse44 .cse38 .cse39)) (.cse5 (not .cse32)) (.cse28 (and .cse34 .cse44 .cse46 .cse38 .cse39)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse26 (not (= 0 |old(~t3_st~0)|))) (.cse18 (not .cse29)) (.cse43 (and .cse34 .cse35 .cse44 .cse45 .cse37 .cse38 .cse39 .cse47)) (.cse27 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse40 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse41 (and .cse34 .cse44 .cse45 .cse37 .cse46 .cse38 .cse39 .cse47)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse13 (= 0 ~E_3~0)) (.cse42 (< |old(~token~0)| |old(~local~0)|)) (.cse33 (not .cse14)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse16 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse26 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse28 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (let ((.cse31 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< .cse31 |old(~token~0)|) .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not .cse25) (let ((.cse36 (+ ~local~0 3))) (and .cse34 .cse35 (<= .cse36 ~token~0) .cse37 (<= ~token~0 .cse36) .cse38 .cse39 (= 1 ~m_pc~0))) .cse22 .cse23 .cse24 (< |old(~token~0)| .cse31))) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse41 .cse4 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse32 .cse13 .cse42 .cse33 .cse26 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse43 .cse12 .cse13 .cse42 .cse33 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse42 .cse33 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse43 .cse22 .cse27 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse2 .cse41 .cse3 .cse4 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse32 .cse13 .cse42 .cse33 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25)))) [2018-11-18 08:50:44,323 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 565 573) no Hoare annotation was computed. [2018-11-18 08:50:44,323 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 565 573) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (= ~T3_E~0 0) (< ~m_st~0 2) (= ~T2_E~0 0) (= 1 |old(~M_E~0)|) (= 1 ~E_3~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (not (= 1 ~t1_i~0)) (= 0 ~E_2~0) (= ~t1_st~0 0) (< ~t2_st~0 2) (= 0 ~E_3~0) (not (= ~t1_pc~0 1)) (= |old(~M_E~0)| ~M_E~0) (not (= 1 ~t3_pc~0)) (< ~t3_st~0 2) (= 1 ~E_M~0) (not (= 1 ~t2_pc~0)) (= ~T1_E~0 1) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 1 ~m_pc~0)) (= 0 ~E_1~0) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0)) [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 565 573) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_1~0)| ~E_1~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~M_E~0)| ~M_E~0) (= ~t2_st~0 |old(~t2_st~0)|) (= |old(~E_3~0)| ~E_3~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~t3_st~0)| ~t3_st~0)) [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point is_transmit3_triggeredEXIT(lines 251 269) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point L255(lines 255 264) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L428 ceAbstractionStarter]: At program point is_transmit3_triggeredENTRY(lines 251 269) the Hoare annotation is: true [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point L255-2(lines 255 264) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L425 ceAbstractionStarter]: For program point is_transmit3_triggeredFINAL(lines 251 269) no Hoare annotation was computed. [2018-11-18 08:50:44,324 INFO L421 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse20 (= 1 ~t2_pc~0)) (.cse42 (= 0 ~t2_st~0)) (.cse47 (= 1 ~m_pc~0))) (let ((.cse32 (= ~t1_st~0 0)) (.cse35 (= 0 ~t3_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse48 (+ ~local~0 1)) (.cse23 (not .cse47)) (.cse22 (not .cse42)) (.cse34 (= 1 ~E_2~0)) (.cse10 (= ~T1_E~0 0)) (.cse11 (= ~T2_E~0 1)) (.cse12 (= 0 ~E_3~0)) (.cse13 (= ~T3_E~0 0)) (.cse15 (= ~T2_E~0 0)) (.cse16 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse36 (not .cse20)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse24 (= 0 ~E_1~0)) (.cse25 (< 0 ~t3_pc~0)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~E_M~0)) (.cse28 (= 0 ~E_2~0))) (let ((.cse9 (or .cse34 (or .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse24 .cse25 .cse26 .cse27 .cse28 .cse47))) (.cse5 (or .cse34 (or .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse47))) (.cse43 (or .cse34 (or .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse23 .cse24 .cse26 .cse27 .cse28))) (.cse44 (< ~token~0 .cse48)) (.cse45 (not .cse34)) (.cse14 (< ~m_st~0 2)) (.cse29 (not .cse4)) (.cse46 (< .cse48 ~token~0)) (.cse33 (or .cse34 (or .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse26 .cse27 .cse28 .cse47))) (.cse40 (< ~local~0 ~token~0)) (.cse21 (= 1 ~E_1~0)) (.cse41 (< ~token~0 ~local~0)) (.cse6 (not .cse35)) (.cse39 (not (= 0 ~m_st~0))) (.cse0 (= 1 ~E_3~0)) (.cse1 (not (= 1 ~t3_i~0))) (.cse8 (< ~t2_st~0 2)) (.cse37 (or (or .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse24 .cse26 .cse27 .cse28 .cse47) .cse34)) (.cse2 (= 0 is_transmit3_triggered_~__retres1~3)) (.cse3 (not (= 1 ~t1_i~0))) (.cse30 (< ~t3_st~0 2)) (.cse31 (not (= 1 ~t3_pc~0))) (.cse7 (not .cse32))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse2 .cse1 (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse29 .cse3 .cse6) (or .cse1 .cse2 (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27 .cse28) .cse29 .cse3 .cse31) (or .cse2 .cse0 .cse1 .cse29 .cse3 .cse30 .cse31 .cse32 .cse33) (or .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse0 .cse21 .cse34 .cse2 .cse3 .cse28 .cse32 .cse8 .cse12 .cse29 .cse31 .cse35 .cse36 .cse18 .cse1 .cse19 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse8 .cse37 .cse29 .cse2 .cse3 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse8 .cse9 .cse29 .cse3 .cse32 .cse2 .cse6) (let ((.cse38 (+ ~local~0 3))) (or (not .cse17) .cse10 .cse11 .cse13 .cse15 .cse16 (< .cse38 ~token~0) .cse0 .cse21 .cse34 .cse3 .cse28 .cse32 .cse8 .cse12 .cse29 .cse31 .cse35 .cse36 .cse18 .cse39 .cse1 .cse19 .cse23 .cse24 .cse26 .cse2 (< ~token~0 .cse38))) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse40 .cse41 .cse3 .cse6 .cse7) (or .cse10 .cse11 .cse13 .cse42 .cse14 .cse15 .cse2 .cse16 .cse21 .cse34 .cse3 .cse28 .cse32 .cse12 .cse29 .cse6 .cse17 .cse36 .cse18 .cse1 .cse19 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse8 .cse2 .cse40 .cse29 .cse41 .cse30 .cse31 .cse43 .cse0 .cse1 .cse3) (or .cse0 .cse1 .cse40 .cse29 .cse41 .cse3 .cse2 .cse5 .cse6) (or .cse8 .cse37 .cse2 .cse40 .cse41 .cse30 .cse31 .cse7 .cse0 .cse1 .cse3) (or .cse0 .cse1 .cse29 .cse3 .cse32 .cse5 .cse6 .cse2) (or .cse1 .cse44 .cse2 .cse29 .cse3 (or .cse10 .cse45 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse0 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse46 .cse6) (or .cse10 .cse11 .cse13 .cse14 .cse15 .cse0 .cse21 .cse34 .cse3 .cse28 .cse32 .cse8 .cse12 .cse29 .cse31 .cse30 .cse17 .cse36 .cse18 .cse1 .cse19 .cse23 .cse2 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse8 .cse29 .cse3 .cse30 .cse31 .cse32 .cse2 .cse43) (or .cse1 .cse8 .cse2 .cse29 .cse3 .cse6 (or .cse10 .cse45 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse0 .cse19 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27)) (or .cse0 .cse1 .cse2 .cse40 .cse41 .cse3 .cse30 .cse31 .cse33 .cse7) (or .cse1 (or .cse10 .cse45 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse36 .cse18 .cse0 .cse19 .cse21 .cse23 .cse24 .cse26 .cse27) .cse8 .cse29 .cse3 .cse31 .cse2) (or .cse1 .cse2 .cse44 (or .cse10 .cse45 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse0 .cse19 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27) .cse29 .cse3 .cse46 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse30 .cse31 .cse33 .cse2 .cse7) (or .cse10 .cse2 .cse11 .cse40 .cse13 .cse15 .cse7 .cse0 .cse20 .cse21 .cse34 .cse3 .cse28 .cse12 .cse41 .cse4 .cse6 .cse17 .cse18 .cse39 .cse1 .cse19 .cse22 .cse24 .cse25 .cse26 .cse27 .cse47) (or .cse0 .cse1 .cse8 .cse37 .cse2 .cse3 .cse4 .cse30 .cse31 .cse7))))) [2018-11-18 08:50:44,326 INFO L425 ceAbstractionStarter]: For program point L345(line 345) no Hoare annotation was computed. [2018-11-18 08:50:44,329 INFO L425 ceAbstractionStarter]: For program point L366(lines 342 408) no Hoare annotation was computed. [2018-11-18 08:50:44,329 INFO L421 ceAbstractionStarter]: At program point L358(line 358) the Hoare annotation is: (let ((.cse55 (= ~m_i~0 1))) (let ((.cse0 (= ~T1_E~0 0)) (.cse10 (= ~T2_E~0 1)) (.cse11 (= ~T3_E~0 0)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 1 ~M_E~0)) (.cse24 (= 1 |old(~E_3~0)|)) (.cse26 (= 1 |old(~E_1~0)|)) (.cse27 (= 1 |old(~E_2~0)|)) (.cse28 (not (= 1 ~t1_i~0))) (.cse29 (= 0 |old(~E_2~0)|)) (.cse14 (= |old(~t1_st~0)| 0)) (.cse31 (= 0 |old(~E_3~0)|)) (.cse35 (= |old(~t1_pc~0)| 1)) (.cse36 (= 1 |old(~E_M~0)|)) (.cse25 (= 1 |old(~t2_pc~0)|)) (.cse37 (= ~T1_E~0 1)) (.cse38 (not (= 1 ~t3_i~0))) (.cse40 (not .cse55)) (.cse45 (= 1 |old(~m_pc~0)|)) (.cse42 (= 0 |old(~E_1~0)|)) (.cse43 (not (= 1 ~t2_i~0))) (.cse44 (= 0 |old(~E_M~0)|))) (and (let ((.cse4 (= ~t1_pc~0 1)) (.cse47 (not .cse37)) (.cse52 (<= ~t3_pc~0 0)) (.cse54 (= |old(~E_M~0)| ~E_M~0)) (.cse41 (= 0 ~t1_st~0)) (.cse46 (not (= ~t2_pc~0 1))) (.cse51 (= 0 ~t2_st~0)) (.cse19 (not (= ~E_2~0 1))) (.cse48 (= |old(~E_1~0)| ~E_1~0)) (.cse20 (= 1 ~t2_pc~0)) (.cse53 (not (= ~M_E~0 1))) (.cse49 (not .cse10)) (.cse21 (and (and (and (not .cse11) (not .cse0) (not .cse12) .cse55 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse50 (not (= ~m_pc~0 1))) (.cse22 (not (= ~E_M~0 1))) (.cse23 (not (= ~E_1~0 1)))) (let ((.cse32 (and .cse19 .cse48 (and .cse20 .cse53 .cse49 .cse21 .cse50 .cse22) .cse23)) (.cse15 (<= 2 ~t3_st~0)) (.cse16 (= 1 ~t3_pc~0)) (.cse30 (and .cse19 .cse48 .cse23 (and .cse46 .cse53 .cse49 .cse21 .cse50 .cse22 .cse51))) (.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (not .cse41)) (.cse3 (= ~token~0 |old(~token~0)|)) (.cse7 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~t2_st~0)) (.cse39 (and .cse47 .cse20 .cse48 .cse49 .cse21 .cse23 .cse50 .cse19 .cse52 .cse53 .cse54 .cse22)) (.cse33 (not .cse4)) (.cse1 (and .cse46 .cse47 .cse48 .cse49 .cse21 .cse23 .cse50 .cse51 .cse19 .cse52 .cse53 .cse54 .cse22)) (.cse8 (= eval_~tmp~0 1)) (.cse5 (= |old(~E_3~0)| ~E_3~0)) (.cse6 (= |old(~t3_st~0)| ~t3_st~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (< |old(~local~0)| |old(~token~0)|) .cse11 .cse12 .cse13 (not .cse14) (let ((.cse17 (+ ~local~0 3))) (and .cse15 .cse2 .cse16 (<= ~token~0 .cse17) .cse4 (not (= ~E_3~0 1)) .cse18 (<= .cse17 ~token~0) (and .cse19 (and (and .cse20 (= 1 ~m_pc~0) .cse21 .cse22) .cse23)) .cse8)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (and .cse15 .cse2 .cse16 .cse3 .cse4 .cse5 .cse30 .cse7 .cse8 .cse9) .cse31 (and .cse32 .cse15 .cse2 .cse16 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9) (< |old(~token~0)| |old(~local~0)|) (and .cse33 .cse32 .cse15 .cse16 .cse5 .cse18 .cse34 .cse8) .cse35 (and .cse33 .cse15 .cse16 .cse5 .cse30 .cse34 .cse8) (not (= 0 |old(~t3_st~0)|)) .cse36 .cse37 (not (= 0 |old(~m_st~0)|)) .cse38 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse39 .cse9) .cse40 (not (= 0 |old(~t2_st~0)|)) (and .cse18 .cse33 .cse41 .cse8 .cse5 .cse39 .cse6) .cse42 (and .cse33 .cse1 .cse41 .cse8 .cse5 .cse6) (< 0 |old(~t3_pc~0)|) .cse43 .cse44 .cse45))) (or .cse0 .cse10 .cse11 (< |old(~m_st~0)| 2) .cse12 .cse13 .cse24 .cse26 .cse27 .cse28 .cse29 .cse14 (< |old(~t2_st~0)| 2) .cse31 (not .cse35) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse36 (not .cse25) .cse37 .cse38 .cse40 (not .cse45) .cse42 .cse43 .cse44)))) [2018-11-18 08:50:44,329 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2018-11-18 08:50:44,329 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 336 414) no Hoare annotation was computed. [2018-11-18 08:50:44,329 INFO L425 ceAbstractionStarter]: For program point L342-1(lines 342 408) no Hoare annotation was computed. [2018-11-18 08:50:44,329 INFO L421 ceAbstractionStarter]: At program point L400(line 400) the Hoare annotation is: (let ((.cse59 (= ~m_i~0 1))) (let ((.cse0 (= ~T1_E~0 0)) (.cse16 (= ~T2_E~0 1)) (.cse17 (= ~T3_E~0 0)) (.cse18 (= ~T2_E~0 0)) (.cse19 (= 1 ~M_E~0)) (.cse21 (= 1 |old(~E_3~0)|)) (.cse23 (= 1 |old(~E_1~0)|)) (.cse34 (= 1 |old(~E_2~0)|)) (.cse37 (not (= 1 ~t1_i~0))) (.cse39 (= 0 |old(~E_2~0)|)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse40 (= 0 |old(~E_3~0)|)) (.cse41 (= |old(~t1_pc~0)| 1)) (.cse42 (= 1 |old(~E_M~0)|)) (.cse22 (= 1 |old(~t2_pc~0)|)) (.cse45 (= ~T1_E~0 1)) (.cse46 (not (= 1 ~t3_i~0))) (.cse47 (not .cse59)) (.cse51 (= 1 |old(~m_pc~0)|)) (.cse48 (= 0 |old(~E_1~0)|)) (.cse49 (not (= 1 ~t2_i~0))) (.cse50 (= 0 |old(~E_M~0)|))) (and (let ((.cse36 (= 0 ~t1_st~0)) (.cse53 (not .cse45)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse9 (= 1 ~m_pc~0)) (.cse43 (not (= ~E_M~0 1))) (.cse52 (not (= ~t2_pc~0 1))) (.cse56 (= |old(~E_1~0)| ~E_1~0)) (.cse57 (= ~m_st~0 0)) (.cse54 (not .cse16)) (.cse4 (and (and (and (not .cse17) (not .cse0) (not .cse18) .cse59 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse5 (not (= ~E_1~0 1))) (.cse58 (not (= ~m_pc~0 1))) (.cse6 (= 0 ~t2_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (<= ~t3_pc~0 0)) (.cse55 (not (= ~M_E~0 1))) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse30 (not .cse13)) (.cse26 (and .cse52 .cse56 .cse57 .cse54 .cse4 .cse5 .cse58 .cse6 .cse7 .cse8 .cse55 .cse10)) (.cse33 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (not (= ~E_3~0 1))) (.cse14 (not (= 0 eval_~tmp~0))) (.cse35 (and .cse53 .cse2 .cse54 .cse3 .cse4 .cse5 .cse7 .cse8 .cse55 .cse9 .cse10 .cse43)) (.cse12 (not .cse36)) (.cse24 (= ~token~0 |old(~token~0)|)) (.cse31 (and .cse53 .cse2 .cse56 .cse57 .cse54 .cse4 .cse5 .cse58 .cse7 .cse8 .cse55 .cse10 .cse43)) (.cse32 (<= 2 ~t2_st~0)) (.cse38 (and .cse52 .cse53 .cse54 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse55 .cse9 (= ~t2_i~0 1) .cse10 .cse43)) (.cse27 (<= ~token~0 ~local~0)) (.cse28 (= eval_~tmp~0 1)) (.cse25 (= |old(~E_3~0)| ~E_3~0)) (.cse15 (not (= 0 ~t3_st~0))) (.cse29 (<= ~local~0 ~token~0))) (or .cse0 (let ((.cse1 (+ ~local~0 1))) (and (<= ~token~0 .cse1) (and (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) .cse12 .cse13 .cse14) (<= .cse1 ~token~0) .cse15)) .cse16 (< |old(~local~0)| |old(~token~0)|) .cse17 .cse18 .cse19 (not .cse20) .cse21 .cse22 .cse23 (and .cse12 .cse24 .cse13 .cse25 .cse15 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse24 .cse31 .cse25 .cse15 .cse32 .cse33 .cse27 .cse28 .cse29) .cse34 (and .cse32 .cse30 .cse35 .cse36 .cse28 .cse25 .cse15) .cse37 (and .cse38 .cse30 .cse36 .cse28 .cse25 .cse15) (and .cse38 .cse12 .cse13 .cse28 .cse25 .cse15) .cse39 (and .cse30 .cse24 .cse25 .cse15 .cse26 .cse33 .cse27 .cse28 .cse29) .cse40 (and .cse32 (and .cse35 .cse12 .cse13 .cse11 .cse14) .cse15) (< |old(~token~0)| |old(~local~0)|) .cse41 (not (= 0 |old(~t3_st~0)|)) .cse42 (let ((.cse44 (+ ~local~0 2))) (and .cse32 (and .cse12 (= 1 ~t3_pc~0) .cse13 (and .cse7 (and .cse2 .cse9 .cse3 .cse4 .cse43) .cse5) .cse11 .cse14) (<= .cse44 ~token~0) .cse15 (<= ~token~0 .cse44))) .cse45 (not (= 0 |old(~m_st~0)|)) .cse46 .cse47 (and .cse32 .cse35 .cse27 .cse36 .cse28 .cse25 .cse15 .cse29) (not (= 0 |old(~t2_st~0)|)) (and .cse12 .cse24 .cse13 .cse31 .cse25 .cse15 .cse32 .cse27 .cse28 .cse29) .cse48 (< 0 |old(~t3_pc~0)|) .cse49 .cse50 (and .cse38 .cse27 .cse36 .cse28 .cse25 .cse15 .cse29) .cse51))) (or .cse0 .cse16 .cse17 (< |old(~m_st~0)| 2) .cse18 .cse19 .cse21 .cse23 .cse34 .cse37 .cse39 .cse20 (< |old(~t2_st~0)| 2) .cse40 (not .cse41) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse42 (not .cse22) .cse45 .cse46 .cse47 (not .cse51) .cse48 .cse49 .cse50)))) [2018-11-18 08:50:44,330 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2018-11-18 08:50:44,331 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 336 414) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_3~0)|)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 |old(~E_2~0)|)) (.cse5 (= |old(~t1_st~0)| 0)) (.cse12 (= 0 |old(~E_3~0)|)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse17 (= ~t1_pc~0 1)) (.cse19 (= |old(~E_M~0)| ~E_M~0)) (.cse20 (= |old(~E_2~0)| ~E_2~0)) (.cse21 (= |old(~E_3~0)| ~E_3~0)) (.cse22 (= |old(~t3_st~0)| ~t3_st~0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse7 (= 1 |old(~t2_pc~0)|)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= 1 ~t3_i~0))) (.cse24 (not (= ~m_i~0 1))) (.cse28 (= 1 |old(~m_pc~0)|)) (.cse25 (= 0 |old(~E_1~0)|)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 (< |old(~local~0)| |old(~token~0)|) .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< |old(~token~0)| |old(~local~0)|) .cse13 (not (= 0 |old(~t3_st~0)|)) .cse14 .cse15 (not (= 0 |old(~m_st~0)|)) .cse16 (and (not (= ~t2_pc~0 1)) (not .cse17) .cse18 (= ~m_st~0 0) (not (= ~m_pc~0 1)) (<= ~token~0 ~local~0) .cse19 (= ~token~0 |old(~token~0)|) .cse20 .cse21 (= 0 ~t2_st~0) .cse22 .cse23 (<= ~t3_pc~0 0) (<= ~local~0 ~token~0)) .cse24 (not (= 0 |old(~t2_st~0)|)) .cse25 (< 0 |old(~t3_pc~0)|) .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 (< |old(~m_st~0)| 2) .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse5 (< |old(~t2_st~0)| 2) .cse12 (not .cse13) (and .cse18 (= 1 ~t3_pc~0) .cse17 (<= 2 ~m_st~0) (= ~t2_st~0 |old(~t2_st~0)|) .cse19 (= 1 ~t2_pc~0) .cse20 .cse21 .cse22 .cse23 (= 1 ~m_pc~0)) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse14 (not .cse7) .cse15 .cse16 .cse24 (not .cse28) .cse25 .cse26 .cse27))) [2018-11-18 08:50:44,332 INFO L425 ceAbstractionStarter]: For program point L380(lines 342 408) no Hoare annotation was computed. [2018-11-18 08:50:44,332 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2018-11-18 08:50:44,332 INFO L425 ceAbstractionStarter]: For program point L347-1(lines 342 408) no Hoare annotation was computed. [2018-11-18 08:50:44,332 INFO L421 ceAbstractionStarter]: At program point L409(lines 336 414) the Hoare annotation is: (let ((.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 0))) (let ((.cse4 (= 1 ~M_E~0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse11 (= 1 ~t3_pc~0)) (.cse12 (= ~t1_pc~0 1)) (.cse13 (not (= ~E_2~0 1))) (.cse14 (and (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (not .cse1) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not .cse2) (not .cse0) (not .cse3) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= ~E_M~0 1)))) (.cse5 (= 1 |old(~E_3~0)|)) (.cse18 (= 1 |old(~t2_pc~0)|)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse7 (= 1 |old(~E_2~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 |old(~E_2~0)|)) (.cse15 (= 0 |old(~E_3~0)|)) (.cse16 (= |old(~t1_pc~0)| 1)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= 1 ~t3_i~0))) (.cse21 (not (= ~m_i~0 1))) (.cse23 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|)) (.cse22 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 (< |old(~m_st~0)| 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 (= ~t2_st~0 |old(~t2_st~0)|) (= |old(~E_3~0)| ~E_3~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (and .cse13 (= |old(~E_1~0)| ~E_1~0) .cse14)) (< |old(~t2_st~0)| 2) .cse15 (not .cse16) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse17 (not .cse18) .cse19 .cse20 .cse21 (not .cse22) .cse23 .cse24 .cse25) (or .cse0 .cse1 (< |old(~local~0)| |old(~token~0)|) .cse2 .cse3 .cse4 (not .cse10) (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) .cse11 .cse12 (and .cse13 .cse14 (not (= ~E_1~0 1))) (not (= ~E_3~0 1))) .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse15 (< |old(~token~0)| |old(~local~0)|) .cse16 (not (= 0 |old(~t3_st~0)|)) .cse17 .cse19 (not (= 0 |old(~m_st~0)|)) .cse20 .cse21 (not (= 0 |old(~t2_st~0)|)) .cse23 (< 0 |old(~t3_pc~0)|) .cse24 .cse25 .cse22)))) [2018-11-18 08:50:44,336 INFO L421 ceAbstractionStarter]: At program point L343(line 343) the Hoare annotation is: (let ((.cse50 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse51 (= ~T2_E~0 0)) (.cse69 (= ~m_i~0 1)) (.cse48 (= ~T2_E~0 1))) (let ((.cse27 (= 1 ~t2_pc~0)) (.cse63 (not (= ~M_E~0 1))) (.cse62 (not .cse48)) (.cse29 (= 1 ~m_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse30 (and (and (and (not .cse50) (not .cse0) (not .cse51) .cse69 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse32 (not (= ~E_M~0 1)))) (let ((.cse18 (= 1 ~M_E~0)) (.cse20 (= 1 |old(~E_3~0)|)) (.cse52 (= 1 |old(~E_1~0)|)) (.cse53 (= 1 |old(~E_2~0)|)) (.cse54 (not (= 1 ~t1_i~0))) (.cse55 (= 0 |old(~E_2~0)|)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse56 (= 0 |old(~E_3~0)|)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse4 (= ~t1_pc~0 1)) (.cse26 (not (= ~E_2~0 1))) (.cse64 (= |old(~E_1~0)| ~E_1~0)) (.cse67 (and .cse27 .cse63 .cse62 .cse29 .cse28 .cse30 .cse32)) (.cse14 (= |old(~E_3~0)| ~E_3~0)) (.cse15 (= |old(~t3_st~0)| ~t3_st~0)) (.cse37 (= |old(~t1_pc~0)| 1)) (.cse39 (= 1 |old(~E_M~0)|)) (.cse21 (= 1 |old(~t2_pc~0)|)) (.cse57 (= ~T1_E~0 1)) (.cse58 (not (= 1 ~t3_i~0))) (.cse40 (not .cse69)) (.cse60 (= 1 |old(~m_pc~0)|)) (.cse43 (= 0 |old(~E_1~0)|)) (.cse59 (not (= 1 ~t2_i~0))) (.cse44 (= 0 |old(~E_M~0)|))) (and (let ((.cse17 (= 0 ~t1_st~0)) (.cse61 (not .cse57)) (.cse68 (+ ~local~0 1)) (.cse65 (not (= ~t2_pc~0 1))) (.cse33 (not (= ~E_1~0 1))) (.cse31 (= 0 ~t2_st~0)) (.cse45 (<= ~t3_pc~0 0)) (.cse46 (= |old(~E_M~0)| ~E_M~0)) (.cse66 (not (= ~m_pc~0 1))) (.cse42 (= ~m_st~0 0))) (let ((.cse23 (and .cse26 .cse64 (and .cse27 .cse63 .cse30 .cse66 .cse32) .cse42)) (.cse12 (and .cse65 .cse28 .cse30 .cse33 .cse31 .cse26 .cse45 .cse63 .cse29 .cse46 .cse32)) (.cse25 (<= ~token~0 .cse68)) (.cse34 (<= .cse68 ~token~0)) (.cse49 (and .cse65 .cse64 .cse42 .cse62 .cse30 .cse33 .cse66 .cse31 .cse26 .cse45 .cse63 .cse46 .cse32)) (.cse47 (and .cse26 (and .cse65 .cse63 .cse62 .cse28 .cse29 .cse30 .cse31 .cse32) .cse33)) (.cse16 (not .cse4)) (.cse38 (and .cse27 .cse64 .cse42 .cse62 .cse30 .cse33 .cse66 .cse26 .cse45 .cse63 .cse46 .cse32)) (.cse5 (and .cse26 .cse67 .cse33)) (.cse10 (<= 2 ~t3_st~0)) (.cse22 (= ~token~0 |old(~token~0)|)) (.cse35 (and .cse26 .cse64 .cse42 .cse33 (and .cse65 .cse61 .cse63 .cse62 .cse30 .cse66 .cse32 .cse31))) (.cse2 (not .cse17)) (.cse6 (not (= ~E_3~0 1))) (.cse7 (not (= 0 eval_~tmp~0))) (.cse36 (and .cse61 .cse27 .cse62 .cse28 .cse30 .cse33 .cse26 .cse45 .cse63 .cse29 (= ~t2_i~0 1) .cse46 .cse32)) (.cse1 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (= eval_~tmp~0 1)) (.cse11 (<= ~local~0 ~token~0))) (or .cse0 (let ((.cse8 (+ ~local~0 2))) (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= .cse8 ~token~0) (= 0 ~t3_st~0) (<= ~token~0 .cse8))) (and .cse9 (and .cse1 (and .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse11) (and .cse12 .cse2 .cse4 .cse13 .cse14 .cse15) (and .cse12 .cse16 .cse17 .cse13 .cse14 .cse15) .cse18 (not .cse19) .cse20 .cse21 (and .cse16 .cse10 .cse3 .cse22 .cse14 .cse1 .cse23 .cse24 .cse9 .cse13 .cse11) (and .cse25 (and .cse10 .cse2 .cse3 .cse4 (and (and .cse26 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse33) .cse6) .cse7) .cse34) (and .cse16 .cse10 .cse3 .cse22 .cse35 .cse14 .cse24 .cse9 .cse13 .cse11) (and .cse1 .cse16 .cse36 .cse17 .cse13 .cse14 .cse15) (< |old(~token~0)| |old(~local~0)|) .cse37 (and .cse2 .cse22 .cse4 .cse38 .cse14 .cse15 .cse1 .cse9 .cse13 .cse11) .cse39 (and .cse10 .cse2 .cse3 .cse22 .cse4 .cse14 .cse1 .cse23 .cse9 .cse13 .cse11) .cse40 (not (= 0 |old(~t2_st~0)|)) (let ((.cse41 (+ ~local~0 3))) (and .cse1 (<= .cse41 ~token~0) (and .cse10 .cse2 .cse3 .cse4 (and .cse26 .cse27 .cse42 .cse29 .cse30 .cse33 .cse32) .cse6 .cse7) (<= ~token~0 .cse41))) .cse43 (< 0 |old(~t3_pc~0)|) .cse44 (and .cse17 .cse14 .cse15 .cse12 .cse9 .cse13 .cse11) (and .cse25 (and (and (and .cse27 .cse28 .cse30 .cse33 .cse31 .cse26 .cse45 .cse29 .cse46) .cse6) .cse2 .cse4 .cse7) .cse34 .cse15) (and .cse10 .cse3 .cse17 .cse14 .cse47 .cse9 .cse13 .cse11) .cse48 (< |old(~local~0)| |old(~token~0)|) (and .cse2 .cse22 .cse4 .cse14 .cse15 .cse49 .cse9 .cse13 .cse11) .cse50 .cse51 (and .cse10 .cse2 .cse3 .cse4 .cse13 .cse14 .cse47) .cse52 .cse53 .cse54 .cse55 (and (and .cse16 .cse49 .cse17 .cse14) .cse22 .cse9 .cse11 .cse15) (and .cse16 .cse10 .cse3 .cse14 .cse47 .cse24 .cse13) (and .cse16 .cse10 .cse3 .cse14 .cse1 .cse24 .cse5 .cse13) .cse56 (and .cse16 .cse22 .cse38 .cse14 .cse15 .cse1 .cse24 .cse9 .cse13 .cse11) (and .cse1 (and .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 0 |old(~t3_st~0)|)) .cse57 (not (= 0 |old(~m_st~0)|)) .cse58 (and .cse10 .cse2 .cse3 .cse22 .cse35 .cse4 .cse14 .cse9 .cse13 .cse11) (and .cse1 (and .cse36 .cse2 .cse4 .cse6 .cse7) .cse15) .cse59 (and .cse36 .cse17 .cse14 .cse15 .cse1 .cse9 .cse13 .cse11) .cse60))) (or .cse0 .cse48 .cse50 (< |old(~m_st~0)| 2) .cse51 .cse18 .cse20 .cse52 .cse53 .cse54 .cse55 .cse19 (< |old(~t2_st~0)| 2) .cse56 (and (and .cse24 .cse3 .cse4 (and .cse26 .cse64 .cse67) .cse14) (= ~t2_st~0 |old(~t2_st~0)|) .cse15) (not .cse37) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse39 (not .cse21) .cse57 .cse58 .cse40 (not .cse60) .cse43 .cse59 .cse44))))) [2018-11-18 08:50:44,337 INFO L421 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse55 (= ~m_i~0 1))) (let ((.cse0 (= ~T1_E~0 0)) (.cse18 (= ~T2_E~0 1)) (.cse24 (= ~T3_E~0 0)) (.cse29 (= ~T2_E~0 0)) (.cse30 (= 1 ~M_E~0)) (.cse32 (= 1 |old(~E_3~0)|)) (.cse34 (= 1 |old(~E_1~0)|)) (.cse35 (= 1 |old(~E_2~0)|)) (.cse36 (not (= 1 ~t1_i~0))) (.cse37 (= 0 |old(~E_2~0)|)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse38 (= 0 |old(~E_3~0)|)) (.cse41 (= |old(~t1_pc~0)| 1)) (.cse42 (= 1 |old(~E_M~0)|)) (.cse33 (= 1 |old(~t2_pc~0)|)) (.cse43 (= ~T1_E~0 1)) (.cse44 (not (= 1 ~t3_i~0))) (.cse45 (not .cse55)) (.cse50 (= 1 |old(~m_pc~0)|)) (.cse46 (= 0 |old(~E_1~0)|)) (.cse47 (not (= 1 ~t2_i~0))) (.cse48 (= 0 |old(~E_M~0)|))) (and (let ((.cse25 (<= ~t3_pc~0 0)) (.cse26 (= |old(~E_M~0)| ~E_M~0)) (.cse8 (not (= ~E_2~0 1))) (.cse51 (not .cse43)) (.cse10 (= 1 ~t2_pc~0)) (.cse53 (not (= ~M_E~0 1))) (.cse52 (not .cse18)) (.cse21 (= 1 ~m_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse11 (and (and (and (not .cse24) (not .cse0) (not .cse29) .cse55 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse54 (= ~t2_i~0 1)) (.cse13 (not (= ~E_M~0 1))) (.cse23 (not (= ~E_1~0 1))) (.cse49 (= ~t1_pc~0 1))) (let ((.cse27 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse19 (not (= ~t2_pc~0 1))) (.cse22 (= 0 ~t2_st~0)) (.cse5 (= ~token~0 |old(~token~0)|)) (.cse9 (= |old(~E_1~0)| ~E_1~0)) (.cse14 (= ~m_st~0 0)) (.cse12 (not (= ~m_pc~0 1))) (.cse1 (not .cse49)) (.cse2 (<= 2 ~t3_st~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse39 (and .cse8 (and .cse51 .cse10 .cse53 .cse52 .cse21 .cse20 .cse11 .cse54 .cse13) .cse23)) (.cse40 (and .cse51 .cse10 .cse52 .cse20 .cse11 .cse23 .cse8 .cse25 .cse53 .cse21 .cse54 .cse26 .cse13)) (.cse3 (not (= 0 ~t1_st~0))) (.cse6 (= |old(~E_3~0)| ~E_3~0)) (.cse28 (= |old(~t3_st~0)| ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (= eval_~tmp~0 1)) (.cse17 (<= ~local~0 ~token~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13) .cse14) .cse15 .cse16 .cse17) .cse18 (and .cse2 .cse3 .cse4 .cse16 .cse6 (and .cse8 (and .cse19 .cse20 .cse21 .cse11 .cse22 .cse13) .cse23)) (< |old(~local~0)| |old(~token~0)|) .cse24 (and (and .cse19 .cse20 .cse11 .cse23 .cse8 .cse25 .cse21 .cse26) .cse3 .cse27 .cse16 .cse6 .cse28) .cse29 .cse30 (not .cse31) (and .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse8 .cse9 .cse14 (and .cse19 .cse11 .cse12 .cse13)) .cse27 .cse6 .cse15 .cse16 .cse17) .cse32 .cse33 .cse34 (and .cse1 .cse3 .cse5 .cse6 .cse28 (and .cse19 .cse9 .cse14 .cse11 .cse12 .cse22 .cse8 .cse25 .cse26) .cse15 .cse16 .cse17) .cse35 (and .cse1 .cse3 .cse5 (and .cse10 .cse9 .cse14 .cse11 .cse12 .cse8 .cse25 .cse26) .cse6 .cse28 .cse7 .cse15 .cse16 .cse17) .cse36 .cse37 .cse38 (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse39 .cse16 .cse6) (and .cse7 .cse1 .cse40 .cse3 .cse16 .cse6 .cse28) (< |old(~token~0)| |old(~local~0)|) .cse41 (not (= 0 |old(~t3_st~0)|)) .cse42 .cse43 (not (= 0 |old(~m_st~0)|)) .cse44 .cse45 (not (= 0 |old(~t2_st~0)|)) .cse46 (< 0 |old(~t3_pc~0)|) .cse47 .cse48 (and (and .cse7 .cse2 .cse3 .cse4 .cse49 .cse39 (not (= ~E_3~0 1)) .cse16) .cse15 .cse17) (and .cse40 .cse3 .cse6 .cse28 .cse7 .cse15 .cse16 .cse17) .cse50))) (or .cse0 .cse18 .cse24 (< |old(~m_st~0)| 2) .cse29 .cse30 .cse32 .cse34 .cse35 .cse36 .cse37 .cse31 (< |old(~t2_st~0)| 2) .cse38 (not .cse41) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse42 (not .cse33) .cse43 .cse44 .cse45 (not .cse50) .cse46 .cse47 .cse48)))) [2018-11-18 08:50:44,340 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 404) no Hoare annotation was computed. [2018-11-18 08:50:44,340 INFO L425 ceAbstractionStarter]: For program point L352(lines 342 408) no Hoare annotation was computed. [2018-11-18 08:50:44,340 INFO L425 ceAbstractionStarter]: For program point L369(lines 369 376) no Hoare annotation was computed. [2018-11-18 08:50:44,340 INFO L421 ceAbstractionStarter]: At program point L394(lines 342 408) the Hoare annotation is: (let ((.cse50 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse51 (= ~T2_E~0 0)) (.cse69 (= ~m_i~0 1)) (.cse48 (= ~T2_E~0 1))) (let ((.cse27 (= 1 ~t2_pc~0)) (.cse63 (not (= ~M_E~0 1))) (.cse62 (not .cse48)) (.cse29 (= 1 ~m_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse30 (and (and (and (not .cse50) (not .cse0) (not .cse51) .cse69 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse32 (not (= ~E_M~0 1)))) (let ((.cse18 (= 1 ~M_E~0)) (.cse20 (= 1 |old(~E_3~0)|)) (.cse52 (= 1 |old(~E_1~0)|)) (.cse53 (= 1 |old(~E_2~0)|)) (.cse54 (not (= 1 ~t1_i~0))) (.cse55 (= 0 |old(~E_2~0)|)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse56 (= 0 |old(~E_3~0)|)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse4 (= ~t1_pc~0 1)) (.cse26 (not (= ~E_2~0 1))) (.cse64 (= |old(~E_1~0)| ~E_1~0)) (.cse67 (and .cse27 .cse63 .cse62 .cse29 .cse28 .cse30 .cse32)) (.cse14 (= |old(~E_3~0)| ~E_3~0)) (.cse15 (= |old(~t3_st~0)| ~t3_st~0)) (.cse37 (= |old(~t1_pc~0)| 1)) (.cse39 (= 1 |old(~E_M~0)|)) (.cse21 (= 1 |old(~t2_pc~0)|)) (.cse57 (= ~T1_E~0 1)) (.cse58 (not (= 1 ~t3_i~0))) (.cse40 (not .cse69)) (.cse60 (= 1 |old(~m_pc~0)|)) (.cse43 (= 0 |old(~E_1~0)|)) (.cse59 (not (= 1 ~t2_i~0))) (.cse44 (= 0 |old(~E_M~0)|))) (and (let ((.cse17 (= 0 ~t1_st~0)) (.cse61 (not .cse57)) (.cse68 (+ ~local~0 1)) (.cse65 (not (= ~t2_pc~0 1))) (.cse33 (not (= ~E_1~0 1))) (.cse31 (= 0 ~t2_st~0)) (.cse45 (<= ~t3_pc~0 0)) (.cse46 (= |old(~E_M~0)| ~E_M~0)) (.cse66 (not (= ~m_pc~0 1))) (.cse42 (= ~m_st~0 0))) (let ((.cse23 (and .cse26 .cse64 (and .cse27 .cse63 .cse30 .cse66 .cse32) .cse42)) (.cse12 (and .cse65 .cse28 .cse30 .cse33 .cse31 .cse26 .cse45 .cse63 .cse29 .cse46 .cse32)) (.cse25 (<= ~token~0 .cse68)) (.cse34 (<= .cse68 ~token~0)) (.cse49 (and .cse65 .cse64 .cse42 .cse62 .cse30 .cse33 .cse66 .cse31 .cse26 .cse45 .cse63 .cse46 .cse32)) (.cse47 (and .cse26 (and .cse65 .cse63 .cse62 .cse28 .cse29 .cse30 .cse31 .cse32) .cse33)) (.cse16 (not .cse4)) (.cse38 (and .cse27 .cse64 .cse42 .cse62 .cse30 .cse33 .cse66 .cse26 .cse45 .cse63 .cse46 .cse32)) (.cse5 (and .cse26 .cse67 .cse33)) (.cse10 (<= 2 ~t3_st~0)) (.cse22 (= ~token~0 |old(~token~0)|)) (.cse35 (and .cse26 .cse64 .cse42 .cse33 (and .cse65 .cse61 .cse63 .cse62 .cse30 .cse66 .cse32 .cse31))) (.cse2 (not .cse17)) (.cse6 (not (= ~E_3~0 1))) (.cse7 (not (= 0 eval_~tmp~0))) (.cse36 (and .cse61 .cse27 .cse62 .cse28 .cse30 .cse33 .cse26 .cse45 .cse63 .cse29 (= ~t2_i~0 1) .cse46 .cse32)) (.cse1 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (= eval_~tmp~0 1)) (.cse11 (<= ~local~0 ~token~0))) (or .cse0 (let ((.cse8 (+ ~local~0 2))) (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= .cse8 ~token~0) (= 0 ~t3_st~0) (<= ~token~0 .cse8))) (and .cse9 (and .cse1 (and .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse11) (and .cse12 .cse2 .cse4 .cse13 .cse14 .cse15) (and .cse12 .cse16 .cse17 .cse13 .cse14 .cse15) .cse18 (not .cse19) .cse20 .cse21 (and .cse16 .cse10 .cse3 .cse22 .cse14 .cse1 .cse23 .cse24 .cse9 .cse13 .cse11) (and .cse25 (and .cse10 .cse2 .cse3 .cse4 (and (and .cse26 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse33) .cse6) .cse7) .cse34) (and .cse16 .cse10 .cse3 .cse22 .cse35 .cse14 .cse24 .cse9 .cse13 .cse11) (and .cse1 .cse16 .cse36 .cse17 .cse13 .cse14 .cse15) (< |old(~token~0)| |old(~local~0)|) .cse37 (and .cse2 .cse22 .cse4 .cse38 .cse14 .cse15 .cse1 .cse9 .cse13 .cse11) .cse39 (and .cse10 .cse2 .cse3 .cse22 .cse4 .cse14 .cse1 .cse23 .cse9 .cse13 .cse11) .cse40 (not (= 0 |old(~t2_st~0)|)) (let ((.cse41 (+ ~local~0 3))) (and .cse1 (<= .cse41 ~token~0) (and .cse10 .cse2 .cse3 .cse4 (and .cse26 .cse27 .cse42 .cse29 .cse30 .cse33 .cse32) .cse6 .cse7) (<= ~token~0 .cse41))) .cse43 (< 0 |old(~t3_pc~0)|) .cse44 (and .cse17 .cse14 .cse15 .cse12 .cse9 .cse13 .cse11) (and .cse25 (and (and (and .cse27 .cse28 .cse30 .cse33 .cse31 .cse26 .cse45 .cse29 .cse46) .cse6) .cse2 .cse4 .cse7) .cse34 .cse15) (and .cse10 .cse3 .cse17 .cse14 .cse47 .cse9 .cse13 .cse11) .cse48 (< |old(~local~0)| |old(~token~0)|) (and .cse2 .cse22 .cse4 .cse14 .cse15 .cse49 .cse9 .cse13 .cse11) .cse50 .cse51 (and .cse10 .cse2 .cse3 .cse4 .cse13 .cse14 .cse47) .cse52 .cse53 .cse54 .cse55 (and (and .cse16 .cse49 .cse17 .cse14) .cse22 .cse9 .cse11 .cse15) (and .cse16 .cse10 .cse3 .cse14 .cse47 .cse24 .cse13) (and .cse16 .cse10 .cse3 .cse14 .cse1 .cse24 .cse5 .cse13) .cse56 (and .cse16 .cse22 .cse38 .cse14 .cse15 .cse1 .cse24 .cse9 .cse13 .cse11) (and .cse1 (and .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 0 |old(~t3_st~0)|)) .cse57 (not (= 0 |old(~m_st~0)|)) .cse58 (and .cse10 .cse2 .cse3 .cse22 .cse35 .cse4 .cse14 .cse9 .cse13 .cse11) (and .cse1 (and .cse36 .cse2 .cse4 .cse6 .cse7) .cse15) .cse59 (and .cse36 .cse17 .cse14 .cse15 .cse1 .cse9 .cse13 .cse11) .cse60))) (or .cse0 .cse48 .cse50 (< |old(~m_st~0)| 2) .cse51 .cse18 .cse20 .cse52 .cse53 .cse54 .cse55 .cse19 (< |old(~t2_st~0)| 2) .cse56 (and (and .cse24 .cse3 .cse4 (and .cse26 .cse64 .cse67) .cse14) (= ~t2_st~0 |old(~t2_st~0)|) .cse15) (not .cse37) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse39 (not .cse21) .cse57 .cse58 .cse40 (not .cse60) .cse43 .cse59 .cse44))))) [2018-11-18 08:50:44,349 INFO L421 ceAbstractionStarter]: At program point L386(line 386) the Hoare annotation is: (let ((.cse59 (= ~m_i~0 1))) (let ((.cse15 (= ~T1_E~0 0)) (.cse16 (= ~T2_E~0 1)) (.cse17 (= ~T3_E~0 0)) (.cse26 (= ~T2_E~0 0)) (.cse30 (= 1 ~M_E~0)) (.cse32 (= 1 |old(~E_3~0)|)) (.cse34 (= 1 |old(~E_1~0)|)) (.cse35 (= 1 |old(~E_2~0)|)) (.cse39 (not (= 1 ~t1_i~0))) (.cse40 (= 0 |old(~E_2~0)|)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse42 (= 0 |old(~E_3~0)|)) (.cse43 (= |old(~t1_pc~0)| 1)) (.cse44 (= 1 |old(~E_M~0)|)) (.cse33 (= 1 |old(~t2_pc~0)|)) (.cse45 (= ~T1_E~0 1)) (.cse46 (not (= 1 ~t3_i~0))) (.cse47 (not .cse59)) (.cse51 (= 1 |old(~m_pc~0)|)) (.cse48 (= 0 |old(~E_1~0)|)) (.cse49 (not (= 1 ~t2_i~0))) (.cse50 (= 0 |old(~E_M~0)|))) (and (let ((.cse18 (= 0 ~t1_st~0)) (.cse55 (not .cse45)) (.cse52 (= |old(~E_1~0)| ~E_1~0)) (.cse53 (= ~m_st~0 0)) (.cse58 (not (= ~m_pc~0 1))) (.cse27 (<= ~t3_pc~0 0)) (.cse28 (= |old(~E_M~0)| ~E_M~0)) (.cse5 (= ~t1_pc~0 1)) (.cse6 (not (= ~E_2~0 1))) (.cse54 (not (= ~t2_pc~0 1))) (.cse56 (not (= ~M_E~0 1))) (.cse57 (not .cse16)) (.cse8 (= 1 ~m_pc~0)) (.cse9 (<= 2 ~m_st~0)) (.cse10 (and (and (and (not .cse17) (not .cse15) (not .cse26) .cse59 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse11 (not (= ~E_M~0 1))) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse7 (= 1 ~t2_pc~0)) (.cse13 (not (= ~E_3~0 1))) (.cse14 (not (= 0 eval_~tmp~0))) (.cse29 (and .cse6 (and .cse54 .cse56 .cse57 .cse8 .cse9 .cse10 .cse11) .cse12)) (.cse25 (not .cse5)) (.cse37 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (and .cse54 .cse52 .cse53 .cse57 .cse10 .cse12 .cse58 .cse6 .cse27 .cse56 .cse28)) (.cse21 (and .cse54 .cse55 .cse57 .cse9 .cse10 .cse12 .cse6 .cse27 .cse56 .cse8 .cse28 .cse11)) (.cse20 (= |old(~t3_st~0)| ~t3_st~0)) (.cse2 (<= 2 ~t3_st~0)) (.cse3 (not .cse18)) (.cse4 (= 1 ~t3_pc~0)) (.cse36 (= ~token~0 |old(~token~0)|)) (.cse1 (not (= ~t2_st~0 0))) (.cse41 (and .cse6 .cse52 .cse53 (and .cse54 .cse55 .cse56 .cse57 .cse10 (= ~t2_i~0 1) .cse58 .cse11) .cse12)) (.cse19 (= |old(~E_3~0)| ~E_3~0)) (.cse22 (<= ~token~0 ~local~0)) (.cse23 (= eval_~tmp~0 1)) (.cse24 (<= ~local~0 ~token~0))) (or (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) .cse1 (and .cse2 .cse3 .cse4 .cse5 (and (and .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) .cse13) .cse14))) .cse15 .cse16 (< |old(~local~0)| |old(~token~0)|) .cse17 (and .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse21 .cse1 .cse18 .cse23 .cse19 .cse20) .cse26 (and (and .cse3 .cse5 (and (and .cse7 .cse9 .cse10 .cse12 .cse6 .cse27 .cse8 .cse28) .cse13) .cse14) .cse1 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse1 .cse29 .cse23 .cse19) .cse30 (not .cse31) (and .cse2 .cse4 .cse1 .cse18 .cse19 .cse22 .cse29 .cse23 .cse24) .cse32 .cse33 .cse34 .cse35 (and .cse25 .cse36 .cse1 .cse19 .cse20 .cse37 .cse22 .cse38 .cse23 .cse24) .cse39 .cse40 (and .cse25 .cse2 .cse4 .cse1 .cse19 .cse37 .cse29 .cse23) (and .cse25 .cse2 .cse4 .cse36 .cse1 .cse41 .cse19 .cse37 .cse22 .cse23 .cse24) .cse42 (< |old(~token~0)| |old(~local~0)|) .cse43 (not (= 0 |old(~t3_st~0)|)) (and .cse3 .cse36 .cse5 .cse1 .cse19 .cse20 .cse22 .cse38 .cse23 .cse24) .cse44 .cse45 (not (= 0 |old(~m_st~0)|)) (and .cse21 .cse3 .cse5 .cse1 .cse23 .cse19 .cse20) .cse46 .cse47 (not (= 0 |old(~t2_st~0)|)) .cse48 (< 0 |old(~t3_pc~0)|) .cse49 .cse50 (and .cse2 .cse3 .cse4 .cse36 .cse5 .cse1 .cse41 .cse19 .cse22 .cse23 .cse24) .cse51))) (or .cse15 .cse16 .cse17 (< |old(~m_st~0)| 2) .cse26 .cse30 .cse32 .cse34 .cse35 .cse39 .cse40 .cse31 (< |old(~t2_st~0)| 2) .cse42 (not .cse43) (not (= 1 |old(~t3_pc~0)|)) (< |old(~t3_st~0)| 2) .cse44 (not .cse33) .cse45 .cse46 .cse47 (not .cse51) .cse48 .cse49 .cse50)))) [2018-11-18 08:50:44,351 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 270 277) no Hoare annotation was computed. [2018-11-18 08:50:44,351 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 270 277) the Hoare annotation is: true [2018-11-18 08:50:44,351 INFO L425 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-11-18 08:50:44,353 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 704) no Hoare annotation was computed. [2018-11-18 08:50:44,353 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 653 711) no Hoare annotation was computed. [2018-11-18 08:50:44,353 INFO L425 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-11-18 08:50:44,354 INFO L421 ceAbstractionStarter]: At program point L663(line 663) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (<= ~local~0 ~token~0)) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,354 INFO L421 ceAbstractionStarter]: At program point L661(line 661) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,354 INFO L421 ceAbstractionStarter]: At program point L661-1(line 661) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,355 INFO L421 ceAbstractionStarter]: At program point L690(line 690) the Hoare annotation is: (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (= ~t1_pc~0 1) (and (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,355 INFO L421 ceAbstractionStarter]: At program point L690-1(line 690) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (and (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1)))) (not (= ~E_3~0 1))) (= ~t1_pc~0 1)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,355 INFO L421 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (= ~t1_pc~0 1) (and (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,357 INFO L421 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (= ~t1_pc~0 1) (and (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,357 INFO L421 ceAbstractionStarter]: At program point L680-1(line 680) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (and (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1)))) (not (= ~E_3~0 1))) (= ~t1_pc~0 1)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,357 INFO L421 ceAbstractionStarter]: At program point L676(line 676) the Hoare annotation is: (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (= ~t1_pc~0 1) (and (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,359 INFO L425 ceAbstractionStarter]: For program point L676-1(line 676) no Hoare annotation was computed. [2018-11-18 08:50:44,360 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 653 711) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,360 INFO L421 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse3 (= |old(~T2_E~0)| ~T2_E~0)) (.cse2 (not (= ~E_2~0 1))) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~M_E~0 1))) (.cse5 (and (not (= ~E_3~0 0)) (and (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0))) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (.cse0 (= 0 ~t1_st~0))) (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not .cse0) (= 1 ~t3_pc~0) .cse1 (and (and .cse2 (and .cse3 (and (= 1 ~t2_pc~0) .cse4 (= 1 ~m_pc~0) (<= 2 ~m_st~0) .cse5) .cse6 (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not .cse1) (and (and .cse3 .cse2 (= |old(~E_1~0)| ~E_1~0) .cse6 (and (not (= ~t2_pc~0 1)) (<= ~t3_pc~0 0) .cse4 .cse5 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= ~m_st~0 0) (= |old(~E_M~0)| ~E_M~0)) .cse0 (= |old(~E_3~0)| ~E_3~0)) (= ~token~0 |old(~token~0)|) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= |old(~t3_st~0)| ~t3_st~0)) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 08:50:44,362 INFO L425 ceAbstractionStarter]: For program point L672-1(line 672) no Hoare annotation was computed. [2018-11-18 08:50:44,362 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 705) no Hoare annotation was computed. [2018-11-18 08:50:44,362 INFO L421 ceAbstractionStarter]: At program point L668-2(lines 665 705) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse3 (= |old(~T2_E~0)| ~T2_E~0)) (.cse2 (not (= ~E_2~0 1))) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~M_E~0 1))) (.cse5 (and (not (= ~E_3~0 0)) (and (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0))) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (.cse0 (= 0 ~t1_st~0))) (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not .cse0) (= 1 ~t3_pc~0) .cse1 (and (and .cse2 (and .cse3 (and (= 1 ~t2_pc~0) .cse4 (= 1 ~m_pc~0) (<= 2 ~m_st~0) .cse5) .cse6 (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not .cse1) (and (and .cse3 .cse2 (= |old(~E_1~0)| ~E_1~0) .cse6 (and (not (= ~t2_pc~0 1)) (<= ~t3_pc~0 0) .cse4 .cse5 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= ~m_st~0 0) (= |old(~E_M~0)| ~E_M~0)) .cse0 (= |old(~E_3~0)| ~E_3~0)) (= ~token~0 |old(~token~0)|) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= |old(~t3_st~0)| ~t3_st~0)) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 08:50:44,362 INFO L421 ceAbstractionStarter]: At program point L664(line 664) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,368 INFO L421 ceAbstractionStarter]: At program point L662(line 662) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_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) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,368 INFO L421 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (and (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1)))) (not (= ~E_3~0 1))) (= ~t1_pc~0 1)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,369 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 696) no Hoare annotation was computed. [2018-11-18 08:50:44,369 INFO L421 ceAbstractionStarter]: At program point L687-1(lines 687 696) the Hoare annotation is: (or (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (= ~t1_pc~0 1) (and (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (not (= ~E_3~0 1)))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,370 INFO L425 ceAbstractionStarter]: For program point L685(line 685) no Hoare annotation was computed. [2018-11-18 08:50:44,370 INFO L421 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and (<= 2 ~t2_st~0) (<= 2 ~t3_st~0) (not (= 0 ~t1_st~0)) (= 1 ~t3_pc~0) (and (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1)))) (not (= ~E_3~0 1))) (= ~t1_pc~0 1)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (= 0 |old(~E_3~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 08:50:44,370 INFO L428 ceAbstractionStarter]: At program point L706(lines 653 711) the Hoare annotation is: true [2018-11-18 08:50:44,370 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:50:44,370 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~T2_E~0 1)) (not (= ~E_M~0 0)) (not (= ~E_3~0 1)) (not (= ~m_pc~0 1)) (not (= ~E_2~0 1)) (not (= ~t2_i~0 1)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)) (not (= ~T1_E~0 1)) (not (= ~t3_i~0 1)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (= 0 ~t3_st~0) (= 0 ~t2_st~0) (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (<= ~t3_pc~0 0) (not (= ~E_3~0 0)) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0)) [2018-11-18 08:50:44,370 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 08:50:44,370 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:50:44,370 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 622 633) no Hoare annotation was computed. [2018-11-18 08:50:44,370 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 622 633) no Hoare annotation was computed. [2018-11-18 08:50:44,370 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 622 633) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (= 1 |old(~t3_i~0)|) (< ~local~0 ~token~0) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~t3_i~0 1)) (not (= ~m_i~0 1))) (= ~T3_E~0 0) (= ~T2_E~0 0) (= 1 ~M_E~0) (not (= ~t1_st~0 0)) (= |old(~m_i~0)| 1) (= 1 ~E_3~0) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (= 0 ~E_2~0) (= 1 |old(~t2_i~0)|) (= 0 ~E_3~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (not (= 0 ~t3_st~0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (not (= 0 ~t2_st~0)) (= 0 ~E_1~0) (< 0 ~t3_pc~0) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2018-11-18 08:50:44,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:50:44 BoogieIcfgContainer [2018-11-18 08:50:44,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:50:44,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:50:44,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:50:44,487 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:50:44,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:57" (3/4) ... [2018-11-18 08:50:44,490 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit3 [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 08:50:44,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit3_triggered [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 08:50:44,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 08:50:44,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 08:50:44,507 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-18 08:50:44,507 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 08:50:44,537 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && ((!(E_2 == 1) && ((\old(T2_E) == T2_E && (((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) || \old(T1_E) == 0) || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T3_E) == 0) || \old(T2_E) == 0) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || 0 == \old(E_3)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((!(t1_pc == 1) && (((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(E_1) == E_1) && \old(T1_E) == T1_E) && ((((!(t2_pc == 1) && t3_pc <= 0) && !(M_E == 1)) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && m_st == 0) && \old(E_M) == E_M) && 0 == t1_st) && \old(E_3) == E_3) && token == \old(token)) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) [2018-11-18 08:50:44,537 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || ((((2 <= t2_st && ((((!(0 == t1_st) && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp)) && local + 2 <= token) && 0 == t3_st) && token <= local + 2)) || ((token <= local && 2 <= t2_st && ((((2 <= t3_st && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp)) && local <= token)) || (((((((((((((((!(t2_pc == 1) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && t1_pc == 1) && tmp == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st)) || (((((((((((((((!(t2_pc == 1) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_M == 1)) && !(t1_pc == 1)) && 0 == t1_st) && tmp == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && token == \old(token)) && \old(E_3) == E_3) && 2 <= t2_st) && ((!(E_2 == 1) && \old(E_1) == E_1) && (((1 == t2_pc && !(M_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && m_st == 0) && \old(t1_st) == t1_st) && token <= local) && tmp == 1) && local <= token)) || ((token <= local + 1 && ((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && ((!(E_2 == 1) && ((((1 == t2_pc && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp)) && local + 1 <= token)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && token == \old(token)) && (((!(E_2 == 1) && \old(E_1) == E_1) && m_st == 0) && !(E_1 == 1)) && ((((((!(t2_pc == 1) && !(T1_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && 0 == t2_st) && \old(E_3) == E_3) && \old(t1_st) == t1_st) && token <= local) && tmp == 1) && local <= token)) || ((((((2 <= t2_st && !(t1_pc == 1)) && (((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((!(0 == t1_st) && token == \old(token)) && t1_pc == 1) && ((((((((((1 == t2_pc && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && token <= local) && tmp == 1) && local <= token)) || 1 == \old(E_M)) || ((((((((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && token == \old(token)) && t1_pc == 1) && \old(E_3) == E_3) && 2 <= t2_st) && ((!(E_2 == 1) && \old(E_1) == E_1) && (((1 == t2_pc && !(M_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && m_st == 0) && token <= local) && tmp == 1) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((2 <= t2_st && local + 3 <= token) && (((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && (((((!(E_2 == 1) && 1 == t2_pc) && m_st == 0) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_3 == 1)) && !(0 == tmp)) && token <= local + 3)) || 0 == \old(E_1)) || 0 < \old(t3_pc)) || 0 == \old(E_M)) || ((((((0 == t1_st && \old(E_3) == E_3) && \old(t3_st) == t3_st) && (((((((((!(t2_pc == 1) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_M == 1)) && token <= local) && tmp == 1) && local <= token)) || (((token <= local + 1 && (((((((((((1 == t2_pc && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && 1 == m_pc) && \old(E_M) == E_M) && !(E_3 == 1)) && !(0 == t1_st)) && t1_pc == 1) && !(0 == tmp)) && local + 1 <= token) && \old(t3_st) == t3_st)) || (((((((2 <= t3_st && 1 == t3_pc) && 0 == t1_st) && \old(E_3) == E_3) && (!(E_2 == 1) && ((((((!(t2_pc == 1) && !(M_E == 1)) && !(T2_E == 1)) && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && tmp == 1) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((((!(0 == t1_st) && token == \old(token)) && t1_pc == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && (((((((((((!(t2_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && token <= local) && tmp == 1) && local <= token)) || T3_E == 0) || T2_E == 0) || ((((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && tmp == 1) && \old(E_3) == E_3) && (!(E_2 == 1) && ((((((!(t2_pc == 1) && !(M_E == 1)) && !(T2_E == 1)) && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((!(t1_pc == 1) && (((((((((((!(t2_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && \old(E_3) == E_3) && token == \old(token)) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || ((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && \old(E_3) == E_3) && (!(E_2 == 1) && ((((((!(t2_pc == 1) && !(M_E == 1)) && !(T2_E == 1)) && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && \old(t1_st) == t1_st) && tmp == 1)) || (((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && \old(E_3) == E_3) && 2 <= t2_st) && \old(t1_st) == t1_st) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && tmp == 1)) || 0 == \old(E_3)) || (((((((((!(t1_pc == 1) && token == \old(token)) && ((((((((((1 == t2_pc && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && token <= local) && tmp == 1) && local <= token)) || (2 <= t2_st && (((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp))) || !(0 == \old(t3_st))) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || (((((((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && token == \old(token)) && (((!(E_2 == 1) && \old(E_1) == E_1) && m_st == 0) && !(E_1 == 1)) && ((((((!(t2_pc == 1) && !(T1_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && 0 == t2_st) && t1_pc == 1) && \old(E_3) == E_3) && token <= local) && tmp == 1) && local <= token)) || ((2 <= t2_st && (((((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && t1_pc == 1) && !(E_3 == 1)) && !(0 == tmp)) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || (((((((((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && token <= local) && tmp == 1) && local <= token)) || 1 == \old(m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((((((\old(t1_st) == t1_st && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && \old(E_3) == E_3) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-18 08:50:44,538 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((1 == t3_pc && t1_pc == 1) && t2_st == \old(t2_st)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1))) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(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)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || 0 == \old(E_3)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) [2018-11-18 08:50:44,539 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) [2018-11-18 08:50:44,539 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((2 <= m_st && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || ((((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || ((((((((2 <= m_st && t2_st == \old(t2_st)) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && \old(t3_st) == t3_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 0 == \old(E_1)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || ((((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || ((((((((!(T2_E == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || (((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((!(T2_E == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || (((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) [2018-11-18 08:50:44,539 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) [2018-11-18 08:50:44,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || ((((2 <= t2_st && t1_i == 1) && t2_st == \old(t2_st)) && ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) || (((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_3 == 0)))) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || ((((token <= \old(token) + 1 && local + 1 <= token) && t1_pc == 1) && (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st))) && \old(t3_st) == t3_st))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st)) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st)) && \old(t3_st) == t3_st))) && ((((((((((((((((((((((((((((T1_E == 0 || (((token <= local && (((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st))) && local <= token) && \old(t3_st) == t3_st)) || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || (((((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st)) && token <= \old(token) + 1) && local + 1 <= token) && t1_pc == 1) && \old(t3_st) == t3_st)) || \old(token) < local) || ((((2 <= t2_st && t1_i == 1) && t2_st == \old(t2_st)) && ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) || (((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_3 == 0)))) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) [2018-11-18 08:50:44,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st) && 0 == t2_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || ((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || ((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || ((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st) && 0 == t2_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) [2018-11-18 08:50:44,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) [2018-11-18 08:50:44,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((!(E_3 == 1) && t2_st == \old(t2_st)) && 0 == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && local + 2 <= token) && token <= local + 2)) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M) || ((((!(E_3 == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((!(E_3 == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && 2 <= m_st && !(E_3 == 0)) && \old(t1_st) == t1_st)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || ((((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && token <= local) && local <= token)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && token <= local) && local <= token)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(0 == \old(t3_st))) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) [2018-11-18 08:50:44,545 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || (((((2 <= m_st && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((2 <= m_st && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 0 == \old(E_3)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((2 <= m_st && !(E_3 == 1)) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((2 <= m_st && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_3) == E_3) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || ((((((2 <= m_st && !(E_3 == 1)) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || ((((((((2 <= m_st && !(E_3 == 1)) && token <= local + 2) && 1 == t2_pc) && 0 == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local + 2 <= token)) || 0 == E_1) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) [2018-11-18 08:50:44,547 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) [2018-11-18 08:50:44,553 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((m_st == 0 && \old(E_M) == E_M) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || (((((1 == t3_pc && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 2 <= m_st && !(E_M == 0)) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && !(E_M == 1)) && token <= local + 3) && !(E_M == 0)) && \old(t3_st) == t3_st) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((((!(T2_E == 0) && 2 <= m_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || (((((m_st == 0 && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((\old(t3_st) == t3_st && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(E_M) == E_M)) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || (((((2 <= m_st && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || (((((m_st == 0 && \old(E_M) == E_M) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((\old(t3_st) == t3_st && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(E_M) == E_M)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((\old(t3_st) == t3_st && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((((((!(T2_E == 0) && 2 <= m_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || ((((token == \old(token) && \old(t3_st) == t3_st) && 2 <= m_st && 0 == t2_st) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((m_st == 0 && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) [2018-11-18 08:50:44,558 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 1 == m_pc) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2) [2018-11-18 08:50:44,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) [2018-11-18 08:50:44,635 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c39636d-b62c-4028-9133-4927f716d0f9/bin-2019/uautomizer/witness.graphml [2018-11-18 08:50:44,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:50:44,636 INFO L168 Benchmark]: Toolchain (without parser) took 107677.48 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 959.1 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 08:50:44,637 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:50:44,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 940.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:44,637 INFO L168 Benchmark]: Boogie Preprocessor took 69.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:44,637 INFO L168 Benchmark]: RCFGBuilder took 435.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:44,638 INFO L168 Benchmark]: TraceAbstraction took 106804.11 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-11-18 08:50:44,638 INFO L168 Benchmark]: Witness Printer took 148.96 ms. Allocated memory is still 4.4 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:44,639 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 216.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 940.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 106804.11 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 148.96 ms. Allocated memory is still 4.4 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 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: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((2 <= m_st && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || ((((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || ((((((((2 <= m_st && t2_st == \old(t2_st)) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && \old(t3_st) == t3_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 0 == \old(E_1)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || ((((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((((2 <= m_st && !(E_1 == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || ((((((((!(T2_E == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || (((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((!(T2_E == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_1 == 1)) && \old(t3_st) == t3_st) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc) && !(E_1 == 0))) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || (((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_3) || 1 == E_1) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || token < local + 3) && ((((((((1 == E_3 || !(1 == t3_i)) || 0 == __retres1) || local < token) || token < local) || !(1 == t1_i)) || 1 == E_2 || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || 0 == __retres1) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || t1_st == 0) || 1 == E_2 || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((0 == __retres1 || !(1 == t3_i)) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || !(1 == t3_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((1 == E_3 || !(1 == t3_i)) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || 1 == E_2 || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || 0 == __retres1) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || t1_st == 0)) && ((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_pc == 1)) || !(1 == t1_i)) || t1_st == 0) || !(0 == t3_st)) || 0 == __retres1)) && ((((((((1 == E_3 || !(1 == t3_i)) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || t1_st == 0) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1)) && (((((((((0 == __retres1 || 1 == E_3) || !(1 == t3_i)) || local < token) || token < local) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && (((((((1 == E_3 || !(1 == t3_i)) || !(t1_pc == 1)) || !(1 == t1_i)) || 0 == __retres1) || t1_st == 0) || 1 == E_2 || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st))) && ((((((((((t2_st < 2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || local < token) || token < local) || t3_st < 2) || !(1 == t3_pc)) || !(t1_st == 0)) || 1 == E_3) || !(1 == t3_i)) || !(1 == t1_i)) || 0 == __retres1)) && ((((((((((t2_st < 2 || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_2 || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == E_3) || !(1 == t3_i)) || !(1 == t1_i))) && (((((!(1 == t3_i) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || !(t1_pc == 1)) || !(1 == t1_i)) || !(0 == t3_st))) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || !(t1_st == 0))) && (((((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || 1 == m_pc)) && ((((((((0 == __retres1 || 1 == E_3) || !(1 == t3_i)) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && (((((((((0 == __retres1 || 1 == E_3) || !(1 == t3_i)) || t2_st < 2) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || local < token) || token < local) || !(1 == t1_i)) || !(0 == t3_st)) || !(t1_st == 0))) && ((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || token < local + 2) || 0 == __retres1)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 1 == m_pc) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 0 == __retres1) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 0 == __retres1) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || 0 == __retres1) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_3) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 0 == __retres1) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == __retres1) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || token < local + 3)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || t1_pc == 1) || !(0 == t3_st)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((1 == E_3 || !(1 == t3_i)) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || 1 == E_2 || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st)) || !(t1_st == 0)) && ((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || !(0 == t3_st)) || !(t1_st == 0))) && (((((0 == __retres1 || !(1 == t3_i)) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || !(0 == t3_st))) && (((((!(1 == t3_i) || 0 == __retres1) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || !(1 == t3_pc))) && ((((((((0 == __retres1 || 1 == E_3) || !(1 == t3_i)) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || t1_st == 0) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || !(t1_pc == 1)) || 0 == __retres1) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || t1_st == 0)) && ((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_pc == 1)) || !(1 == t1_i)) || t1_st == 0) || 0 == __retres1) || !(0 == t3_st))) && (((((((((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == __retres1) || token < local + 3)) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1) || local < token) || token < local) || !(1 == t1_i)) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 0 == __retres1) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((t2_st < 2 || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_2 || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == E_3) || !(1 == t3_i)) || !(1 == t1_i))) && ((((((((1 == E_3 || !(1 == t3_i)) || local < token) || !(t1_pc == 1)) || token < local) || !(1 == t1_i)) || 0 == __retres1) || 1 == E_2 || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st))) && ((((((((((t2_st < 2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || 0 == __retres1) || local < token) || token < local) || t3_st < 2) || !(1 == t3_pc)) || !(t1_st == 0)) || 1 == E_3) || !(1 == t3_i)) || !(1 == t1_i))) && (((((((1 == E_3 || !(1 == t3_i)) || !(t1_pc == 1)) || !(1 == t1_i)) || t1_st == 0) || 1 == E_2 || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st)) || 0 == __retres1)) && (((((((!(1 == t3_i) || token < local + 1) || 0 == __retres1) || !(t1_pc == 1)) || !(1 == t1_i)) || (((((((((((((((((T1_E == 0 || !(1 == E_2)) || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || local + 1 < token) || !(0 == t3_st))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || t1_st == 0) || 0 == __retres1) || 1 == E_2 || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((!(1 == t3_i) || t2_st < 2) || 0 == __retres1) || !(t1_pc == 1)) || !(1 == t1_i)) || !(0 == t3_st)) || (((((((((((((((((T1_E == 0 || !(1 == E_2)) || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((1 == E_3 || !(1 == t3_i)) || 0 == __retres1) || local < token) || token < local) || !(1 == t1_i)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && ((((((!(1 == t3_i) || (((((((((((((((((T1_E == 0 || !(1 == E_2)) || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t1_i)) || !(1 == t3_pc)) || 0 == __retres1)) && (((((((!(1 == t3_i) || 0 == __retres1) || token < local + 1) || (((((((((((((((((T1_E == 0 || !(1 == E_2)) || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || !(t1_pc == 1)) || !(1 == t1_i)) || local + 1 < token) || !(1 == t3_pc))) && ((((((((1 == E_3 || !(1 == t3_i)) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1) || !(t1_st == 0))) && (((((((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((1 == E_3 || !(1 == t3_i)) || t2_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || !(t1_st == 0)) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st) && 0 == t2_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || ((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || ((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || ((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st) && 0 == t2_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((1 == t3_pc && t1_pc == 1) && t2_st == \old(t2_st)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1))) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(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)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || 0 == \old(E_3)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && ((!(E_2 == 1) && ((\old(T2_E) == T2_E && (((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) || \old(T1_E) == 0) || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T3_E) == 0) || \old(T2_E) == 0) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || 0 == \old(E_3)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((!(t1_pc == 1) && (((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(E_1) == E_1) && \old(T1_E) == T1_E) && ((((!(t2_pc == 1) && t3_pc <= 0) && !(M_E == 1)) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && m_st == 0) && \old(E_M) == E_M) && 0 == t1_st) && \old(E_3) == E_3) && token == \old(token)) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || (((((2 <= m_st && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((2 <= m_st && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 0 == \old(E_3)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((2 <= m_st && !(E_3 == 1)) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((2 <= m_st && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_3) == E_3) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || ((((((2 <= m_st && !(E_3 == 1)) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || ((((((((2 <= m_st && !(E_3 == 1)) && token <= local + 2) && 1 == t2_pc) && 0 == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local + 2 <= token)) || 0 == E_1) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((m_st == 0 && \old(E_M) == E_M) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || (((((1 == t3_pc && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 2 <= m_st && !(E_M == 0)) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && !(E_M == 1)) && token <= local + 3) && !(E_M == 0)) && \old(t3_st) == t3_st) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((((((!(T2_E == 0) && 2 <= m_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || (((((m_st == 0 && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((\old(t3_st) == t3_st && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(E_M) == E_M)) || 0 == E_3) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || (((((2 <= m_st && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || (((((m_st == 0 && \old(E_M) == E_M) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((\old(t3_st) == t3_st && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(E_M) == E_M)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((\old(t3_st) == t3_st && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((((((!(T2_E == 0) && 2 <= m_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || ((((token == \old(token) && \old(t3_st) == t3_st) && 2 <= m_st && 0 == t2_st) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((m_st == 0 && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || 0 == __retres1) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == __retres1) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && (((((((((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == __retres1) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || token < local + 3)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 0 == __retres1) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(t1_pc) == 1) || ((((2 <= t2_st && t1_i == 1) && t2_st == \old(t2_st)) && ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) || (((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_3 == 0)))) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || ((((token <= \old(token) + 1 && local + 1 <= token) && t1_pc == 1) && (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st))) && \old(t3_st) == t3_st))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st)) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st)) && \old(t3_st) == t3_st))) && ((((((((((((((((((((((((((((T1_E == 0 || (((token <= local && (((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st))) && local <= token) && \old(t3_st) == t3_st)) || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || (((((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st)) && token <= \old(token) + 1) && local + 1 <= token) && t1_pc == 1) && \old(t3_st) == t3_st)) || \old(token) < local) || ((((2 <= t2_st && t1_i == 1) && t2_st == \old(t2_st)) && ((((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) || (((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && !(E_3 == 1)) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_1 == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_3 == 0)))) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t2_st) < 2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || 0 == \old(E_1)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || __retres1 == 1) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((((((((T1_E == 0 || __retres1 == 1) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || __retres1 == 1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || __retres1 == 1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || __retres1 == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || __retres1 == 1) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || __retres1 == 1) || t2_st < 2) || 0 == E_3) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || __retres1 == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || __retres1 == 1) || t2_st < 2) || 0 == E_3) || token < local) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || __retres1 == 1) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || token < local + 3)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || __retres1 == 1) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || __retres1 == 1) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || token < local) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || __retres1 == 1) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || __retres1 == 1) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == E_3) || token < local) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || 0 == E_3) || __retres1 == 1) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || __retres1 == 1) || t2_st < 2) || 0 == E_3) || token < local) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == E_3) || __retres1 == 1) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || ((((2 <= t2_st && ((((!(0 == t1_st) && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp)) && local + 2 <= token) && 0 == t3_st) && token <= local + 2)) || ((token <= local && 2 <= t2_st && ((((2 <= t3_st && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp)) && local <= token)) || (((((((((((((((!(t2_pc == 1) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && t1_pc == 1) && tmp == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st)) || (((((((((((((((!(t2_pc == 1) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_M == 1)) && !(t1_pc == 1)) && 0 == t1_st) && tmp == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && token == \old(token)) && \old(E_3) == E_3) && 2 <= t2_st) && ((!(E_2 == 1) && \old(E_1) == E_1) && (((1 == t2_pc && !(M_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && m_st == 0) && \old(t1_st) == t1_st) && token <= local) && tmp == 1) && local <= token)) || ((token <= local + 1 && ((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && ((!(E_2 == 1) && ((((1 == t2_pc && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp)) && local + 1 <= token)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && token == \old(token)) && (((!(E_2 == 1) && \old(E_1) == E_1) && m_st == 0) && !(E_1 == 1)) && ((((((!(t2_pc == 1) && !(T1_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && 0 == t2_st) && \old(E_3) == E_3) && \old(t1_st) == t1_st) && token <= local) && tmp == 1) && local <= token)) || ((((((2 <= t2_st && !(t1_pc == 1)) && (((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((!(0 == t1_st) && token == \old(token)) && t1_pc == 1) && ((((((((((1 == t2_pc && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && token <= local) && tmp == 1) && local <= token)) || 1 == \old(E_M)) || ((((((((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && token == \old(token)) && t1_pc == 1) && \old(E_3) == E_3) && 2 <= t2_st) && ((!(E_2 == 1) && \old(E_1) == E_1) && (((1 == t2_pc && !(M_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && m_st == 0) && token <= local) && tmp == 1) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((2 <= t2_st && local + 3 <= token) && (((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && (((((!(E_2 == 1) && 1 == t2_pc) && m_st == 0) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_3 == 1)) && !(0 == tmp)) && token <= local + 3)) || 0 == \old(E_1)) || 0 < \old(t3_pc)) || 0 == \old(E_M)) || ((((((0 == t1_st && \old(E_3) == E_3) && \old(t3_st) == t3_st) && (((((((((!(t2_pc == 1) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && \old(E_M) == E_M) && !(E_M == 1)) && token <= local) && tmp == 1) && local <= token)) || (((token <= local + 1 && (((((((((((1 == t2_pc && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && 1 == m_pc) && \old(E_M) == E_M) && !(E_3 == 1)) && !(0 == t1_st)) && t1_pc == 1) && !(0 == tmp)) && local + 1 <= token) && \old(t3_st) == t3_st)) || (((((((2 <= t3_st && 1 == t3_pc) && 0 == t1_st) && \old(E_3) == E_3) && (!(E_2 == 1) && ((((((!(t2_pc == 1) && !(M_E == 1)) && !(T2_E == 1)) && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && tmp == 1) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((((!(0 == t1_st) && token == \old(token)) && t1_pc == 1) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && (((((((((((!(t2_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && token <= local) && tmp == 1) && local <= token)) || T3_E == 0) || T2_E == 0) || ((((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && tmp == 1) && \old(E_3) == E_3) && (!(E_2 == 1) && ((((((!(t2_pc == 1) && !(M_E == 1)) && !(T2_E == 1)) && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((!(t1_pc == 1) && (((((((((((!(t2_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && \old(E_3) == E_3) && token == \old(token)) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || ((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && \old(E_3) == E_3) && (!(E_2 == 1) && ((((((!(t2_pc == 1) && !(M_E == 1)) && !(T2_E == 1)) && 2 <= m_st) && 1 == m_pc) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && \old(t1_st) == t1_st) && tmp == 1)) || (((((((!(t1_pc == 1) && 2 <= t3_st) && 1 == t3_pc) && \old(E_3) == E_3) && 2 <= t2_st) && \old(t1_st) == t1_st) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && tmp == 1)) || 0 == \old(E_3)) || (((((((((!(t1_pc == 1) && token == \old(token)) && ((((((((((1 == t2_pc && \old(E_1) == E_1) && m_st == 0) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && token <= local) && tmp == 1) && local <= token)) || (2 <= t2_st && (((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(0 == tmp))) || !(0 == \old(t3_st))) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || (((((((((2 <= t3_st && !(0 == t1_st)) && 1 == t3_pc) && token == \old(token)) && (((!(E_2 == 1) && \old(E_1) == E_1) && m_st == 0) && !(E_1 == 1)) && ((((((!(t2_pc == 1) && !(T1_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && 0 == t2_st) && t1_pc == 1) && \old(E_3) == E_3) && token <= local) && tmp == 1) && local <= token)) || ((2 <= t2_st && (((((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && t1_pc == 1) && !(E_3 == 1)) && !(0 == tmp)) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || (((((((((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && 2 <= t2_st) && token <= local) && tmp == 1) && local <= token)) || 1 == \old(m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((((((\old(t1_st) == t1_st && 1 == t3_pc) && t1_pc == 1) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((1 == t2_pc && !(M_E == 1)) && !(T2_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(E_M == 1)) && \old(E_3) == E_3) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((!(E_3 == 1) && t2_st == \old(t2_st)) && 0 == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && local + 2 <= token) && token <= local + 2)) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M) || ((((!(E_3 == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((!(E_3 == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && 2 <= m_st && !(E_3 == 0)) && \old(t1_st) == t1_st)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || ((((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && token <= local) && local <= token)) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || (((((m_st == 0 && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && token <= local) && local <= token)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == \old(E_3)) || t1_pc == 1) || !(0 == \old(t3_st))) || ((((t2_st == \old(t2_st) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0))) || 1 == E_M) || T1_E == 1) || !(1 == t3_i)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 210 locations, 1 error locations. SAFE Result, 106.6s OverallTime, 29 OverallIterations, 7 TraceHistogramMax, 19.9s AutomataDifference, 0.0s DeadEndRemovalTime, 71.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 9719 SDtfs, 12894 SDslu, 12887 SDs, 0 SdLazy, 9701 SolverSat, 3361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3203 GetRequests, 2984 SyntacticMatches, 47 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32656occurred in iteration=23, 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: 10.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 5799 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 57896 PreInvPairs, 58355 NumberOfFragments, 61353 HoareAnnotationTreeSize, 57896 FomulaSimplifications, 428403 FormulaSimplificationTreeSizeReduction, 5.4s HoareSimplificationTime, 80 FomulaSimplificationsInter, 431600 FormulaSimplificationTreeSizeReductionInter, 65.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 9305 NumberOfCodeBlocks, 9305 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9266 ConstructedInterpolants, 0 QuantifiedInterpolants, 3350175 SizeOfPredicates, 5 NumberOfNonLiveVariables, 12621 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 39 InterpolantComputations, 29 PerfectInterpolantSequences, 6998/7172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...